Approximate String Matching: A Simpler Faster Algorithm

DOI10.1137/S0097539700370527MaRDI QIDQ3149893zbMATH OpenOpenAlexFDO

Authors Ramesh Hariharan, Richard Cole

Publication date 29 September 2002

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539700370527

zbMATH Keywords

algorithmsedit distancestring matching

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1303588
• Faster approximate string matching
• An approximate string-matching algorithm
• scientific article; zbMATH DE number 4119620
• An Improved Algorithm For Approximate String Matching
• Very fast and simple approximate string matching
• Fast and practical approximate string matching
• Algorithms for approximate string matching
• scientific article; zbMATH DE number 3845091

Cited in

(27)

• scientific article; zbMATH DE number 176144 (Why is no real title available?)
• scientific article; zbMATH DE number 1555939 (Why is no real title available?)
• Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
• Faster approximate string matching for short patterns
• Approximate string-matching with q-grams and maximal matches
• Approximate pattern matching in LZ77-compressed texts
• Time-Space Trade-Offs for Longest Common Extensions
• Longest common extensions in trees
• Longest common extensions in trees
• Approximate Periods with Levenshtein Distance
• Elastic-degenerate string matching with 1 error
• Optimal spaced seeds for faster approximate string matching
• Finding approximate palindromes in strings
• Random access to grammar-compressed strings and trees
• Towards optimal packed string matching
• A fast VLSI solution for approximate string matching
• Elastic-degenerate string matching with 1 error or mismatch
• An Improved Algorithm For Approximate String Matching
• Longest common extensions in sublinear space
• Finding approximate patterns in strings
• Faster recovery of approximate periods over edit distance
• Approximate circular pattern matching under edit distance
• New and faster filters for multiple approximate string matching
• Time-space trade-offs for longest common extensions
• ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
• Simple Optimal String Matching Algorithm
• A practical semi-external memory method for approximate pattern matching

This page was built for publication: Approximate String Matching: A Simpler Faster Algorithm

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