Languages with mismatches
From MaRDI portal
Publication:2456367
DOI10.1016/j.tcs.2007.06.006zbMath1124.68088MaRDI 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
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, Streaming dictionary matching with mismatches, On the Suffix Automaton with Mismatches
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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