On-Line Approximate String Matching with Bounded Errors

DOI10.1007/978-3-540-69068-9_14MaRDI QIDQ3506948zbMATH OpenOpenAlexFDO

Authors Claudio Telha, Marcos Kiwi, Gonzalo Navarro

Publication date 17 June 2008

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.5063

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• On-line approximate string matching with bounded errors
• Multiple approximate string matching
• Faster approximate string matching
• On-line approximate string matching in natural language
• New and faster filters for multiple approximate string matching

Cited in

(6)

• The exact online string matching problem: a review of the most recent results
• On-Line Pattern Matching on Uncertain Sequences and Applications
• Space Lower Bounds for Online Pattern Matching
• Space lower bounds for online pattern matching
• Faster Online Elastic Degenerate String Matching
• On-line approximate string matching with bounded errors

This page was built for publication: On-Line Approximate String Matching with Bounded Errors

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