The following pages link to (Q4252748):
Displaying 21 items.
- The structural border array (Q396695) (← links)
- Parameterized longest previous factor (Q441845) (← links)
- Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications (Q497185) (← links)
- Efficient pattern matching for RNA secondary structures (Q500967) (← links)
- A prefix array for parameterized strings (Q511148) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Compressed parameterized pattern matching (Q897868) (← links)
- Fast parameterized matching with \(q\)-grams (Q1018090) (← links)
- Comparison and evaluation of code clone detection techniques and tools: A qualitative approach (Q1021479) (← links)
- On the longest common parameterized subsequence (Q1038473) (← links)
- Dynamic dictionary matching in external memory (Q1275745) (← links)
- Variations of the parameterized longest previous factor (Q1932360) (← links)
- \(p\)-suffix sorting as arithmetic coding (Q1932361) (← links)
- On-line construction of parameterized suffix trees for large alphabets (Q1944073) (← links)
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching (Q2220859) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
- Parameterized DAWGs: efficient constructions and bidirectional pattern searches (Q2676460) (← links)
- On the Longest Common Parameterized Subsequence (Q3506962) (← links)
- Counting Parameterized Border Arrays for a Binary Alphabet (Q3618600) (← links)
- Approximation algorithms for maximum two-dimensional pattern matching (Q5941062) (← links)
