Pages that link to "Item:Q1104103"
From MaRDI portal
The following pages link to Data structures and algorithms for approximate string matching (Q1104103):
Displaying 31 items.
- Simple and efficient string matching with k mismatches (Q582093) (← links)
- An improved algorithm for computing the edit distance of run-length coded strings (Q673470) (← links)
- On similarity of polynomial configurations (Q688225) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- A model and a fast algorithm for multiple errors spelling correction (Q808697) (← links)
- From Nerode's congruence to suffix automata with mismatches (Q840766) (← links)
- A dynamic edit distance table (Q876720) (← links)
- String matching with weighted errors (Q909451) (← links)
- Analysis of two-dimensional approximate pattern matching algorithms (Q1129016) (← links)
- An efficient algorithm for some tree matching problems (Q1182118) (← links)
- A note on the subtree isomorphism for ordered trees and related problems (Q1182123) (← links)
- Approximate string-matching with \(q\)-grams and maximal matches (Q1190465) (← links)
- Efficient algorithms for approximate string matching with swaps (Q1288533) (← links)
- Sublinear approximate string matching and biological applications (Q1336963) (← links)
- Block edit models for approximate string matching (Q1391305) (← links)
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497) (← links)
- Optimal data compression algorithm (Q1816650) (← links)
- Fast approximate matching of words against a dictionary (Q1895867) (← links)
- On-line construction of suffix trees (Q1897476) (← links)
- Multiple filtration and approximate pattern matching (Q1902470) (← links)
- Fast parallel and serial multidimensional approximate array matching (Q2277849) (← links)
- Edit distance for a run-length-encoded string and an uncompressed string (Q2380032) (← links)
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps (Q2437749) (← links)
- Full-Text Indexes for High-Throughput Sequencing (Q3305517) (← links)
- On the Suffix Automaton with Mismatches (Q3503902) (← links)
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)
- EFFICIENT PARALLEL ALGORITHMS FOR PATTERN RECOGNITION∗ (Q4819983) (← links)
- Boyer-Moore approach to approximate string matching (Q5056116) (← links)
- A linear-time algorithm for the 1-mismatch problem (Q5096932) (← links)
- Universal Data Compression Algorithm Based on Approximate String Matching (Q5485382) (← links)
