On the Suffix Automaton with Mismatches

DOI10.1007/978-3-540-76336-9_15zbMath1139.68360OpenAlexW173611360MaRDI QIDQ3503902

Chiara Epifanio, Maxime Crochemore, A. Gabriele, Filippo Mignosi

Publication date: 10 June 2008

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00620159/file/07-CEGM-ciaa.pdf

zbMATH Keywords

approximate string matchingcombinatorics on wordslanguages with mismatchessuffix automata

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (1)

Dictionary-symbolwise flexible parsing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new method for approximate indexing and dictionary lookup with one error
• The smallest automaton recognizing the subwords of a text
• Data structures and algorithms for approximate string matching
• On-line construction of compact directed acyclic word graphs
• Reducing space for index implementation.
• Languages with mismatches
• Dictionary matching and indexing with errors and don't cares
• Algorithms on Strings, Trees and Sequences
• Text Indexing and Dictionary Matching with One Error
• Combinatorial Pattern Matching
• Developments in Language Theory
• Combinatorial Pattern Matching
• Words and special factors

This page was built for publication: On the Suffix Automaton with Mismatches