Pages that link to "Item:Q2378518"
From MaRDI portal
The following pages link to Algorithms for subsequence combinatorics (Q2378518):
Displaying 10 items.
- Versatile string kernels (Q391141) (← links)
- Concordance and consensus (Q545367) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- On measuring similarity for sequences of itemsets (Q1715867) (← links)
- Quantifying sequential subsumption (Q2326402) (← links)
- Scattered Factor-Universality of Words (Q5041246) (← links)
- Near-optimal algorithm to count occurrences of subsequences of a given length (Q5367537) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Existential Definability over the Subword Ordering (Q6178718) (← links)
- Subsequence frequency in binary words (Q6204345) (← links)
