A polynomial time solvable formulation of multiple sequence alignment
From MaRDI portal
Recommendations
Cited in
(9)- Efficient methods for multiple sequence alignment with guaranteed error bounds
- A polyhedral approach to sequence alignment problems
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
- Adaptation of the method of musical composition for solving the multiple sequence alignment problem
- A New Dynamic Programming Algorithm for Multiple Sequence Alignment
- Near optimal multiple alignment within a band in polynomial time
- Near optimal multiple alignment within a band in polynomial time
- A heuristic algorithm for multiple sequence alignment based on blocks
- New formulations of the multiple sequence alignment problem
This page was built for publication: A polynomial time solvable formulation of multiple sequence alignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5706861)