Pages that link to "Item:Q1336963"
From MaRDI portal
The following pages link to Sublinear approximate string matching and biological applications (Q1336963):
Displaying 19 items.
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- Bidirectional search in a string with wavelet trees and bidirectional matching statistics (Q418161) (← links)
- Quantum pattern matching fast on average (Q513289) (← links)
- On-line approximate string matching with bounded errors (Q653329) (← links)
- On average sequence complexity (Q703547) (← links)
- Computing suffix links for suffix trees and arrays (Q845941) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- Text indexing with errors (Q925060) (← links)
- Hardness of optimal spaced seed design (Q931726) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- Analysis of two-dimensional approximate pattern matching algorithms (Q1129016) (← links)
- Approximate string-matching with \(q\)-grams and maximal matches (Q1190465) (← links)
- Block edit models for approximate string matching (Q1391305) (← links)
- A filtering algorithm for \(k\)-mismatch with don't cares (Q1675785) (← links)
- Longest property-preserved common factor: a new string-processing framework (Q2297866) (← links)
- Longest common substrings with \(k\) mismatches (Q2345877) (← links)
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation (Q2354764) (← links)
- Average-case linear-time similar substring searching by the \(q\)-gram distance (Q2440164) (← links)
- Distributed suffix trees (Q2569396) (← links)
