Languages with mismatches

DOI10.1016/j.tcs.2007.06.006zbMath1124.68088MaRDI QIDQ2456367

Antonio Restivo, Marinella Sciortino, A. Gabriele, Filippo Mignosi, Chiara Epifanio

Publication date: 18 October 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.06.006

zbMATH Keywords

indexing; approximate string matching; formal languages; combinatorics on words

Mathematics Subject Classification ID

68R15: Combinatorics on words

68Q45: Formal languages and automata

Related Items

Dictionary-symbolwise flexible parsing, Fast index for approximate string matching, Regularity of a dynamic neighborhood of a regular language, From Nerode's congruence to suffix automata with mismatches, On the Suffix Automaton with Mismatches

Cites Work

• The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches
• Words and forbidden factors
• Words, univalent factors, and boxes
• Special issue: Average-case analysis of algorithms
• Word assembly through minimal forbidden words
• Forbidden Factors and Fragment Assembly
• Dictionary matching and indexing with errors and don't cares
• Algorithms on Strings, Trees and Sequences
• Jewels of Stringology
• Text Indexing and Dictionary Matching with One Error
• Combinatorial Pattern Matching
• Developments in Language Theory
• Combinatorial Pattern Matching
• Words and special factors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item