Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time

DOI10.1137/S0097539794275872zbMath0939.68159OpenAlexW2039915021MaRDI QIDQ4943755

Esko Ukkonen, Juha Kärkkäinen

Publication date: 19 March 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539794275872

zbMATH Keywords

average case analysisapproximate matchingmultidimensional matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Computing methodologies for image processing (68U10) Data structures (68P05)

Related Items (2)

Quantum pattern matching fast on average ⋮ Sequential and indexed two-dimensional combinatorial template matching allowing rotations

This page was built for publication: Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time