Languages with mismatches

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

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

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

indexingapproximate string matchingformal languagescombinatorics on words

Mathematics Subject Classification ID

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

Related Items (6)

From Nerode's congruence to suffix automata with mismatches ⋮ Fast index for approximate string matching ⋮ On the Suffix Automaton with Mismatches ⋮ Dictionary-symbolwise flexible parsing ⋮ Regularity of a dynamic neighborhood of a regular language ⋮ Streaming dictionary matching 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

This page was built for publication: Languages with mismatches