The following pages link to (Q5110893):
Displaying 6 items.
- Maximal and minimal representations of gapped and non-gapped motifs of a string (Q732024) (← links)
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- On the solution bound of two-sided scaffold filling (Q2034400) (← links)
- A new approximation algorithm for contig-based genomic scaffold filling (Q2220846) (← links)
- Comparing incomplete sequences via longest common subsequence (Q2333802) (← links)
- Fixed-parameter algorithms for scaffold filling (Q2513609) (← links)
