A path selection approach to global pairwise sequence alignment using integer linear optimization†
From MaRDI portal
Publication:5449013
Recommendations
- Global pairwise sequence alignment through mixed-integer linear programming: a template-free approach
- An optimization approach to multiple sequence alignment
- Algorithms for path-constrained sequence alignment
- Optimal sequence alignment using affine gap costs
- scientific article; zbMATH DE number 2243390
- A polyhedral approach to sequence alignment problems
- Optimal alignments of longest common subsequences and their path properties
- A bit-parallel, general integer-scoring sequence alignment algorithm
- A New Dynamic Programming Algorithm for Multiple Sequence Alignment
Cites work
Cited in
(1)
This page was built for publication: A path selection approach to global pairwise sequence alignment using integer linear optimization†
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449013)