Combinatorial Pattern Matching

DOI10.1007/b137128zbMath1131.68430OpenAlexW4301315466MaRDI QIDQ5713556

Moritz G. Maaß, Johannes Nowak

Publication date: 14 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b137128

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (10)

From Nerode's congruence to suffix automata with mismatches ⋮ Indexing factors with gaps ⋮ Approximate string matching with compressed indexes ⋮ Fast index for approximate string matching ⋮ On the Suffix Automaton with Mismatches ⋮ Languages with mismatches ⋮ Improved space-time tradeoffs for approximate full-text indexing with one edit error ⋮ Optimal prefix and suffix queries on texts ⋮ Compressed indexes for approximate string matching ⋮ Faster and Space-Optimal Edit Distance “1” Dictionary

This page was built for publication: Combinatorial Pattern Matching