Pages that link to "Item:Q3158541"
From MaRDI portal
The following pages link to A fast bit-vector algorithm for approximate string matching based on dynamic programming (Q3158541):
Displaying 34 items.
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- Approximate all-pairs suffix/prefix overlaps (Q418172) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- Practical and flexible pattern matching over Ziv-Lempel compressed text. (Q878012) (← links)
- Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching (Q975479) (← links)
- A robust algorithm for identification of proteins in a database (Q1037115) (← links)
- Faster approximate string matching (Q1277393) (← links)
- From cascade decompositions to bit-vector algorithms. (Q1426154) (← links)
- A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Approximate string matching on Ziv--Lempel compressed text (Q1827277) (← links)
- Approximate pattern matching and transitive closure logics. (Q1874401) (← links)
- Approximate Boyer-Moore string matching for small alphabets (Q1957645) (← links)
- Co-linear chaining with overlaps and gap costs (Q2170153) (← links)
- Fast and compact regular expression matching (Q2378530) (← links)
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time (Q2380069) (← links)
- Indexing text with approximate \(q\)-grams (Q2569395) (← links)
- Bit-parallel approximate string matching algorithms with transposition (Q2569398) (← links)
- Practical algorithms for transposition-invariant string-matching (Q2569401) (← links)
- NR-grep: A fast and flexible pattern-matching tool (Q2785069) (← links)
- Lossless Seeds for Searching Short Patterns with High Error Rates (Q2946072) (← links)
- Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment (Q2948308) (← links)
- VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING (Q3021938) (← links)
- DNA-Seq Error Correction Based on Substring Indices (Q3305526) (← links)
- BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS (Q3421848) (← links)
- Nested Counters in Bit-Parallel String Matching (Q3618593) (← links)
- A fast VLSI solution for approximate string matching (Q4015539) (← links)
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)
- (Q5111792) (← links)
- Vaquita: fast and accurate identification of structural variation using combined evidence (Q5111809) (← links)
- A succinct four Russians speedup for edit distance computation and one-against-many banded alignment (Q5140776) (← links)
- Combinatorial Pattern Matching (Q5315353) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711555) (← links)
- Improving an algorithm for approximate pattern matching (Q5940613) (← links)
