Multiple sequence alignment as a facility-location problem
From MaRDI portal
Learning and adaptive systems in artificial intelligence (68T05) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Recommendations
- Alignment between two multiple alignments
- Near optimal multiple alignment within a band in polynomial time
- An approximation algorithm for alignment of multiple sequences using motif discovery
- Approximation algorithms for multiple sequence alignment
- Multiple Alignment, Communication Cost, and Graph Matching
Cited in
(12)- Partially local multi-way alignments
- Parametric multiple sequence alignment and phylogeny construction
- Algorithms and Computation
- A Lagrangian relaxation approach for the multiple sequence alignment problem
- New formulations of the multiple sequence alignment problem
- Complexity of biological sequence alignment
- Optimal global alignment of signals by maximization of Pearson correlation
- Hardness and approximation of multiple sequence alignment with column score
- Research in Computational Molecular Biology
- Alignment between two multiple alignments
- Near optimal multiple alignment within a band in polynomial time
- Mathematical programming in computational biology: an annotated bibliography
This page was built for publication: Multiple sequence alignment as a facility-location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890444)
