scientific article; zbMATH DE number 2087055

MaRDI QIDQ4737701zbMATH OpenFDO

Authors Heikki Hyyrö, Gonzalo Navarro

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2373/23730203.htm

Mathematics Subject Classification ID

Combinatorics on words (68R15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Increased bit-parallelism for approximate and multiple string matching
• Faster approximate string matching
• Faster approximate string matching for short patterns
• Bit-parallel witnesses and their applications to approximate string matching

Cited in

(31)

• Faster approximate string matching
• Bit-parallel witnesses and their applications to approximate string matching
• Indexing text with approximate \(q\)-grams
• Bit-parallel approximate string matching algorithms with transposition
• Practical algorithms for transposition-invariant string-matching
• Optimal spaced seeds for faster approximate string matching
• Very fast and simple approximate string matching
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Accelerating Boyer Moore Searches on Binary Texts
• Increased bit-parallelism for approximate and multiple string matching
• A fast VLSI solution for approximate string matching
• New and faster filters for multiple approximate string matching
• scientific article; zbMATH DE number 1773073 (Why is no real title available?)
• Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
• scientific article; zbMATH DE number 2149350 (Why is no real title available?)
• scientific article; zbMATH DE number 1857503 (Why is no real title available?)
• scientific article; zbMATH DE number 2112398 (Why is no real title available?)
• Algorithms and Computation
• Efficient Bit-Parallel Algorithms for (δ,α)-Matching
• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
• On-line approximate string matching in natural language
• Experimental and Efficient Algorithms
• SOFSEM 2005: Theory and Practice of Computer Science
• Tighter Packed Bit-Parallel NFA for Approximate String Matching
• String Processing and Information Retrieval
• Bit-parallel approximate string matching algorithms with transposition.
• Fast approximate dictionary matching
• Fast parallel string prefix-matching
• Faster approximate string matching for short patterns
• Accelerating Boyer-Moore searches on binary texts
• Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching

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 Q4737701)