Pages that link to "Item:Q4203810"
From MaRDI portal
The following pages link to Fast parallel and serial approximate string matching (Q4203810):
Displayed 35 items.
- A survey on tree edit distance and related problems (Q557823) (← links)
- Simple and efficient string matching with k mismatches (Q582093) (← links)
- The approximate swap and mismatch edit distance (Q604463) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- Approximate string matching using compressed suffix arrays (Q818136) (← links)
- A dynamic edit distance table (Q876720) (← links)
- Improved approximate string matching using compressed suffix data structures (Q930602) (← links)
- Efficient algorithms for the block edit problems (Q963999) (← links)
- Some theoretical challenges in digital geometry: a perspective (Q967394) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- An approximate string-matching algorithm (Q1190457) (← links)
- Approximate string-matching with \(q\)-grams and maximal matches (Q1190465) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- Identifying periodic occurrences of a template with applications to protein structure (Q1209310) (← links)
- Efficient algorithms for approximate string matching with swaps (Q1288533) (← links)
- Sublinear approximate string matching and biological applications (Q1336963) (← links)
- Algorithms for approximate graph matching (Q1357079) (← links)
- Block edit models for approximate string matching (Q1391305) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q1401328) (← links)
- Overlap matching. (Q1401926) (← links)
- Approximate swapped matching. (Q1853034) (← links)
- Finding approximate palindromes in strings (Q1860243) (← links)
- Fast approximate matching of words against a dictionary (Q1895867) (← links)
- Multiple filtration and approximate pattern matching (Q1902470) (← links)
- A constrained edit distance between unordered labeled trees (Q1908261) (← links)
- Fast parallel and serial multidimensional approximate array matching (Q2277849) (← links)
- Swap and mismatch edit distance (Q2369878) (← links)
- Optimal spaced seeds for faster approximate string matching (Q2643727) (← links)
- New and faster filters for multiple approximate string matching (Q4534215) (← links)
- On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES (Q5483380) (← links)
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES (Q5484909) (← links)
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS (Q5696947) (← links)
- THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW (Q5714656) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q5967094) (← links)