Pages that link to "Item:Q1291563"
From MaRDI portal
The following pages link to On computing all suboptimal alignments (Q1291563):
Displaying 6 items.
- A versatile divide and conquer technique for optimal string alignment (Q294680) (← links)
- Finding a length-constrained maximum-density path in a tree (Q1781798) (← links)
- Enumerating \(K\) best paths in length order in DAGs (Q1926859) (← links)
- General space-efficient sampling algorithm for suboptimal alignment (Q3571691) (← links)
- A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices (Q4441897) (← links)
- Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology (Q4485189) (← links)