Indexing structures for approximate string matching

DOI10.1007/3-540-44849-7_20MaRDI QIDQ4437504zbMATH OpenFDO

Authors A. Gabriele, Filippo Mignosi, M. Sciortino, Antonio Restivo

Publication date 2 December 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2653/26530140.htm

zbMATH Keywords

approximate string matchingautomata theoryCombinatorics on wordsDAWGsindexingsuffix trees

Mathematics Subject Classification ID

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

Recommendations

• Fast index for approximate string matching
• A metric index for approximate string matching
• scientific article; zbMATH DE number 2185640
• scientific article; zbMATH DE number 2086228
• Combinatorial Pattern Matching

Cited in

(25)

• A new method for approximate indexing and dictionary lookup with one error
• Two-dimensional substring indexing.
• Approximate string matching with compressed indexes
• String indexing for top-\(k\) close consecutive occurrences
• Practical space-efficient index for structural pattern matching
• Languages with mismatches
• Hashing and indexing: succinct data structures and smoothed analysis
• Approximate string matching using a bidirectional index
• FM-index of alignment: a compressed index for similar strings
• scientific article; zbMATH DE number 2185640 (Why is no real title available?)
• scientific article; zbMATH DE number 2086228 (Why is no real title available?)
• On the Suffix Automaton with Mismatches
• Cache-Oblivious Index for Approximate String Matching
• Simple, compact and robust approximate string dictionary
• Search data structures for skewed strings
• Dictionary-symbolwise flexible parsing
• Pattern matching in hypertext
• Approximate String Matching Using a Bidirectional Index
• Efficient indexes for jumbled pattern matching with constant-sized alphabet
• A Linear Size Index for Approximate Pattern Matching
• Fast index for approximate string matching
• An approximation algorithm for alphabet indexing problem
• A metric index for approximate string matching
• From Nerode's congruence to suffix automata with mismatches
• Text indexing with errors

This page was built for publication: Indexing structures for approximate string matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4437504)