Pages that link to "Item:Q582093"
From MaRDI portal
The following pages link to Simple and efficient string matching with k mismatches (Q582093):
Displaying 23 items.
- Efficient string-matching allowing for non-overlapping inversions (Q390885) (← links)
- Mismatch sampling (Q418198) (← links)
- Text searching allowing for inversions and translocations of factors (Q496536) (← links)
- Algorithms for finding a most similar subforest (Q538470) (← links)
- Efficient string matching with k mismatches (Q1079377) (← links)
- Fast string matching with k differences (Q1109574) (← links)
- Fast average-case pattern matching by multiplexing sparse tables (Q1190461) (← links)
- Approximate string-matching with \(q\)-grams and maximal matches (Q1190465) (← links)
- On the string matching with \(k\) mismatches (Q1743717) (← links)
- Fast and practical approximate string matching (Q1847363) (← links)
- Multiple filtration and approximate pattern matching (Q1902470) (← links)
- String matching with inversions and translocations in linear average time (most of the time) (Q1944938) (← links)
- Improved online algorithms for jumbled matching (Q2295624) (← links)
- String matching with simple devices (Q2380036) (← links)
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time (Q2380069) (← links)
- Average-case linear-time similar substring searching by the \(q\)-gram distance (Q2440164) (← links)
- Approximate pattern matching with \(k\)-mismatches in packed text (Q2445229) (← links)
- Simple Optimal String Matching Algorithm (Q4500860) (← links)
- New and faster filters for multiple approximate string matching (Q4534215) (← links)
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)
- Boyer-Moore approach to approximate string matching (Q5056116) (← links)
- Circular pattern matching with \(k\) mismatches (Q5918999) (← links)
- On using q-gram locations in approximate string matching (Q6102311) (← links)
