Pages that link to "Item:Q5881357"
From MaRDI portal
The following pages link to Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis (Q5881357):
Displaying 8 items.
- Efficient computation of sequence mappability (Q2134748) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Longest property-preserved common factor: a new string-processing framework (Q2297866) (← links)
- Longest common substring with approximately \(k\) mismatches (Q2414870) (← links)
- Efficient Alignment Free Sequence Comparison with Bounded Mismatches (Q2814576) (← links)
- Longest common substring made fully dynamic (Q5075739) (← links)
- Faster algorithms for 1-mappability of a sequence (Q5919433) (← links)
- Range shortest unique substring queries (Q6536259) (← links)