Pages that link to "Item:Q5463450"
From MaRDI portal
The following pages link to Average-optimal single and multiple approximate string matching (Q5463450):
Displaying 21 items.
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- Average complexity of backward \(q\)-gram string matching algorithms (Q436556) (← links)
- On-line approximate string matching with bounded errors (Q653329) (← links)
- Average-optimal string matching (Q1044048) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Average complexity of exact and approximate multiple string matching (Q1885904) (← links)
- Approximate Boyer-Moore string matching for small alphabets (Q1957645) (← links)
- Fast string matching for DNA sequences (Q2297856) (← links)
- Rotation and lighting invariant template matching (Q2373879) (← links)
- Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm (Q2503305) (← links)
- Sequential and indexed two-dimensional combinatorial template matching allowing rotations (Q2576875) (← links)
- Optimal spaced seeds for faster approximate string matching (Q2643727) (← links)
- Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance (Q2946041) (← links)
- Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time (Q3188843) (← links)
- On Minimizing Pattern Splitting in Multi-track String Matching (Q3550839) (← links)
- (Q3581624) (← links)
- Bit-Parallel Approximate Matching of Circular Strings with <i>k</i> Mismatches (Q4577948) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
- Multiple approximate string matching (Q5096936) (← links)
- Combinatorial Pattern Matching (Q5315353) (← links)
- Circular pattern matching with \(k\) mismatches (Q5918999) (← links)
