The following pages link to (Q3570040):
Displaying 30 items.
- The swap matching problem revisited (Q300248) (← links)
- A graph-theoretic model to solve the approximate string matching problem allowing for translocations (Q396701) (← links)
- Fast and flexible packed string matching (Q405577) (← links)
- Designing optimal- and fast-on-average pattern matching algorithms (Q511153) (← links)
- BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation (Q626897) (← links)
- Fast exact string matching algorithms (Q846013) (← links)
- The structure of subword graphs and suffix trees of Fibonacci words (Q860864) (← links)
- A unifying look at the Apostolico--Giancarlo string-matching algorithm (Q876692) (← links)
- Content-dependent chunking for differential compression, the local maximum approach (Q972380) (← links)
- An aggressive algorithm for multiple string matching (Q987821) (← links)
- Optimal pattern matching algorithms (Q1734696) (← links)
- A faster quick search algorithm (Q1736618) (← links)
- The wide window string matching algorithm (Q1770398) (← links)
- Improved pattern-scan-order algorithms for string matching (Q1784983) (← links)
- On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees (Q2182712) (← links)
- Fast string matching for DNA sequences (Q2297856) (← links)
- Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform (Q2414057) (← links)
- Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm (Q2503305) (← links)
- Using pattern matching for tiling and packing problems (Q2643924) (← links)
- A Very Fast String Matching Algorithm Based on Condensed Alphabets (Q2830059) (← links)
- EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM (Q3655531) (← links)
- Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition (Q4629542) (← links)
- Boosting Pattern Matching Performance via k-bit Filtering (Q4932641) (← links)
- A Filtering Technique for All Pairs Approximate Parameterized String Matching (Q5114858) (← links)
- Creating improvisations on chord progressions using suffix trees (Q5207099) (← links)
- PAMA: A FAST STRING MATCHING ALGORITHM (Q5291301) (← links)
- On the Structure of Consistent Partitions of Substring Set of a Word (Q5321725) (← links)
- A Bit-Parallel Exact String Matching Algorithm for Small Alphabet (Q5321726) (← links)
- A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns (Q5448657) (← links)
- A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS (Q5714663) (← links)
