A new filtration method and a hybrid strategy for approximate string matching
From MaRDI portal
Publication:385045
DOI10.1016/J.TCS.2013.02.022zbMATH Open1291.68438OpenAlexW4246671164MaRDI QIDQ385045FDOQ385045
Authors: Chia Wei Lu, Chin Lung Lu, R. C. T. Lee
Publication date: 29 November 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.02.022
Recommendations
- New and faster filters for multiple approximate string matching
- A filtering technique for all pairs approximate parameterized string matching
- scientific article; zbMATH DE number 2185640
- String Processing and Information Retrieval
- Faster filters for approximate string matching
- Publication:4733401
- An Improved Algorithm For Approximate String Matching
- scientific article; zbMATH DE number 3845091
Protein sequences, DNA sequences (92D20) Approximation algorithms (68W25) Algorithms on strings (68W32)
Cites Work
- The String-to-String Correction Problem
- A fast string searching algorithm
- Fast Pattern Matching in Strings
- Faster approximate string matching
- Fast and practical approximate string matching
- On-line construction of suffix trees
- Very fast and simple approximate string matching
- Fast parallel and serial approximate string matching
- Improving an algorithm for approximate pattern matching
- Bit-parallel witnesses and their applications to approximate string matching
- Approximate string-matching with \(q\)-grams and maximal matches
- Sublinear approximate string matching and biological applications
- A fast bit-vector algorithm for approximate string matching based on dynamic programming
- Finding approximate patterns in strings
- Approximate Boyer–Moore String Matching
- Fast and flexible string matching by combining bit-parallelism and suffix automata
- Average-optimal single and multiple approximate string matching
Cited In (6)
- Lossless seeds for searching short patterns with high error rates
- On using q-gram locations in approximate string matching
- Multiple filtration and approximate pattern matching
- A filtering technique for all pairs approximate parameterized string matching
- An artificial neural network based approach for online string matching/filtering of large databases
- New and faster filters for multiple approximate string matching
This page was built for publication: A new filtration method and a hybrid strategy for approximate string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385045)