Pages that link to "Item:Q3558256"
From MaRDI portal
The following pages link to Maximal Words in Sequence Comparisons Based on Subword Composition (Q3558256):
Displaying 8 items.
- Sequence similarity measures based on bounded Hamming distance (Q294940) (← links)
- Textual data compression in computational biology: algorithmic techniques (Q465689) (← links)
- The subsequence composition of a string (Q732027) (← links)
- A framework for space-efficient string kernels (Q1679234) (← links)
- State complexity of prefix distance (Q2357110) (← links)
- State Complexity of Prefix Distance (Q2947426) (← links)
- Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis (Q5881357) (← links)
- Ranking and Unranking k-Subsequence Universal Words (Q6134861) (← links)