Pages that link to "Item:Q1322483"
From MaRDI portal
The following pages link to Fast string matching with mismatches (Q1322483):
Displaying 18 items.
- Very fast and simple approximate string matching (Q294703) (← links)
- Fast and flexible packed string matching (Q405577) (← links)
- Simple and efficient string matching with k mismatches (Q582093) (← links)
- Fast pattern-matching on indeterminate strings (Q954954) (← 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)
- Fast algorithms for approximately counting mismatches (Q1313761) (← links)
- Detecting false matches in string-matching algorithms (Q1361416) (← links)
- Fast and practical approximate string matching (Q1847363) (← links)
- Approximate Boyer-Moore string matching for small alphabets (Q1957645) (← links)
- Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm (Q2503305) (← links)
- Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata (Q2569397) (← links)
- Fast string matching for multiple searches (Q2745228) (← links)
- Indexing a sequence for mapping reads with a single mismatch (Q2955639) (← links)
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)
- (Q5305177) (← links)
- FFT-based algorithms for the string matching with mismatches problem (Q5711729) (← links)