Pages that link to "Item:Q1847363"
From MaRDI portal
The following pages link to Fast and practical approximate string matching (Q1847363):
Displaying 12 items.
- Very fast and simple approximate string matching (Q294703) (← links)
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- Novel evolutionary models and applications to sequence alignment problems (Q863608) (← links)
- Application of max-plus algebra to biological sequence comparisons (Q1870593) (← links)
- Multiple filtration and approximate pattern matching (Q1902470) (← links)
- Approximate Boyer-Moore string matching for small alphabets (Q1957645) (← links)
- Approximate pattern matching on elastic-degenerate text (Q2297854) (← links)
- A lower-variance randomized algorithm for approximate string matching (Q2444913) (← links)
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds (Q2628801) (← 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)
- An artificial neural network based approach for online string matching/filtering of large databases (Q3563649) (← links)
