The following pages link to (Q4449230):
Displaying 16 items.
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Patterns with bounded treewidth (Q476169) (← links)
- Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications (Q497185) (← links)
- A faster algorithm for the computation of string convolutions using LZ78 parsing (Q765493) (← links)
- Pattern matching with address errors: rearrangement distances (Q923879) (← links)
- Property matching and weighted matching (Q932325) (← links)
- Periodicity and repetitions in parameterized strings (Q947077) (← links)
- Pattern matching with pair correlation distance (Q955040) (← links)
- Fast parameterized matching with \(q\)-grams (Q1018090) (← links)
- Permuted function matching (Q1675783) (← links)
- A brief history of parameterized matching problems (Q2295633) (← links)
- Pattern matching with variables: a multivariate complexity analysis (Q2346415) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
- A note on the complexity of matching patterns with variables (Q2445237) (← links)
- Generalized function matching (Q2466014) (← links)
- Periodicity and Repetitions in Parameterized Strings (Q3439251) (← links)
