The following pages link to (Q4347080):
Displayed 36 items.
- Monge properties of sequence alignment (Q418004) (← links)
- BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation (Q626897) (← links)
- Scaled and permuted string matching (Q834966) (← links)
- Faster two-dimensional pattern matching with rotations (Q859847) (← links)
- Motif discovery by monotone scores (Q876467) (← links)
- Parameterized matching with mismatches (Q924551) (← links)
- Periodicity and repetitions in parameterized strings (Q947077) (← links)
- Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time (Q959798) (← links)
- Some theoretical challenges in digital geometry: a perspective (Q967394) (← links)
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms (Q988198) (← links)
- Parameterized matching on non-linear structures (Q989510) (← links)
- Discovering subword associations in strings in time linear in the output size (Q1026231) (← links)
- The constrained longest common subsequence problem (Q1029006) (← links)
- Sparse LCS common substring alignment (Q1029026) (← links)
- Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q1401328) (← links)
- Overlap matching. (Q1401926) (← links)
- Simple and fast linear space computation of longest common subsequences (Q1583368) (← links)
- The wide window string matching algorithm (Q1770398) (← links)
- Approximate string matching on Ziv--Lempel compressed text (Q1827277) (← links)
- Tree pattern matching with a more general notion of occurrence of the pattern. (Q1853013) (← links)
- A speed-up for the commute between subword trees and DAWGs. (Q1853059) (← links)
- Compact recognizers of episode sequences (Q1854526) (← links)
- Collage system: A unifying framework for compressed pattern matching. (Q1874240) (← links)
- Two-dimensional pattern matching with rotations (Q1884920) (← links)
- A hierarchical clustering algorithm for categorical sequence data (Q2390299) (← links)
- Property testing of regular tree languages (Q2461542) (← links)
- Generalized function matching (Q2466014) (← links)
- Periodicity and Repetitions in Parameterized Strings (Q3439251) (← links)
- Boosting Pattern Matching Performance via k-bit Filtering (Q4932641) (← links)
- (Q5002646) (← links)
- Location-Aware Real-Time Recommender Systems for Brick-and-Mortar Retailers (Q5084618) (← links)
- The effect of multiple reference characters on detecting matches in string-searching algorithms (Q5704752) (← links)
- Periodicity in data streams with wildcards (Q5915573) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q5967094) (← links)
- On the hardness of computing the edit distance of shallow trees (Q6111592) (← links)