scientific article; zbMATH DE number 1555939

MaRDI QIDQ4525706zbMATH OpenFDO

Authors Tadao Takaoka

Publication date 24 January 2001

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1303588
• Faster approximate string matching
• Two-dimensional pattern matching by sampling
• Approximate String Matching: A Simpler Faster Algorithm
• A randomized algorithm for approximate string matching

Cited in

(9)

• Analysis of two-dimensional approximate pattern matching algorithms
• Deterministic Sampling–A New Technique for Fast Pattern Matching
• Compact q-gram profiling of compressed strings
• On-Line Approximate String Searching Algorithms: Survey and Experimental Results
• Multiple approximate string matching
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Shift finding in sub-linear time
• On using q-gram locations in approximate string matching
• Matching statistics -- a survey

This page was built for publication:

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