On-line approximate string matching with bounded errors
From MaRDI portal
Publication:653329
DOI10.1016/J.TCS.2011.08.005zbMATH Open1233.68232OpenAlexW2122990924MaRDI QIDQ653329FDOQ653329
Authors: Gonzalo Navarro, Claudio Telha, Marcos Kiwi 
Publication date: 9 January 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/131582
Recommendations
- On-Line Approximate String Matching with Bounded Errors
- scientific article; zbMATH DE number 3845091
- On-line approximate string matching in natural language
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results
- On-line string matching algorithms: survey and experimental results
- Optimal On-Line Search and Sublinear Time Update in String Matching
- The exact online string matching problem: a review of the most recent results
- On-line string matching with feedback
- Fast and practical approximate string matching
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)
Cites Work
- Self-testing/correcting with applications to numerical problems
- Concentration of Measure for the Analysis of Randomized Algorithms
- Large deviations for sums of partly dependent random variables
- Approximate string-matching with \(q\)-grams and maximal matches
- Sublinear approximate string matching and biological applications
- Title not available (Why is that?)
- Approximate Boyer–Moore String Matching
- Average-optimal single and multiple approximate string matching
- On-Line Approximate String Matching with Bounded Errors
- Handbook of randomized computing. Vols. 1, 2
Cited In (10)
- Space lower bounds for online pattern matching
- On-line approximate string matching in natural language
- Approximate string matching with stuck address bits
- On-Line Pattern Matching on Uncertain Sequences and Applications
- On-line string matching in highly similar DNA sequences
- The exact online string matching problem: a review of the most recent results
- Space Lower Bounds for Online Pattern Matching
- On-Line Approximate String Matching with Bounded Errors
- Faster Online Elastic Degenerate String Matching
- On approximate pattern matching with thresholds
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 Q653329)
