Pages that link to "Item:Q2508981"
From MaRDI portal
The following pages link to Longest repeats with a block of \(k\) don't cares (Q2508981):
Displaying 8 items.
- Maximal and minimal representations of gapped and non-gapped motifs of a string (Q732024) (← links)
- On the complexity of finding gapped motifs (Q972352) (← links)
- Motif trie: an efficient text index for pattern discovery with don't cares (Q1698709) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Longest common substrings with \(k\) mismatches (Q2345877) (← links)
- Indexing factors with gaps (Q2391183) (← links)
- Longest common substring made fully dynamic (Q5075739) (← links)
- Linear-Time Algorithm for Long LCF with k Mismatches (Q5140788) (← links)
