Pages that link to "Item:Q4203810"
From MaRDI portal
The following pages link to Fast parallel and serial approximate string matching (Q4203810):
Displaying 50 items.
- Longest common extensions in trees (Q294947) (← links)
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- Approximate XML structure validation based on document-grammar tree similarity (Q527155) (← links)
- A practical semi-external memory method for approximate pattern matching (Q529654) (← links)
- 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)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- Faster approximate string matching for short patterns (Q692899) (← 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)
- Computing longest common extensions in partial words (Q1647840) (← links)
- Longest common extension (Q1678103) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- Finding maximal 2-dimensional palindromes (Q1740657) (← 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)
- 2-dimensional palindromes with \(k\) mismatches (Q2203604) (← links)
- String indexing for patterns with wildcards (Q2254487) (← links)
- Fast parallel and serial multidimensional approximate array matching (Q2277849) (← links)
- Two-dimensional maximal repetitions (Q2297850) (← links)
- Approximate pattern matching in LZ77-compressed texts (Q2343301) (← links)
- Swap and mismatch edit distance (Q2369878) (← links)
- Locating maximal approximate runs in a string (Q2410363) (← links)
- Speeding up the detection of tandem repeats over the edit distance (Q2437752) (← links)
- Average-case linear-time similar substring searching by the \(q\)-gram distance (Q2440164) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Optimal spaced seeds for faster approximate string matching (Q2643727) (← links)
- Double string tandem repeats (Q2700385) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Longest Common Extensions in Trees (Q2942245) (← links)
- Longest Common Extensions in Sublinear Space (Q2942246) (← links)
