Multiple sequence alignment as a facility-location problem
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25) Discrete location and assignment (90B80) Abstract computational complexity for mathematical programming problems (90C60) Protein sequences, DNA sequences (92D20)
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)- A Lagrangian relaxation approach for the multiple sequence alignment problem
- Mathematical programming in computational biology: an annotated bibliography
- Partially local multi-way alignments
- Hardness and approximation of multiple sequence alignment with column score
- Alignment between two multiple alignments
- Algorithms and Computation
- Complexity of biological sequence alignment
- Research in Computational Molecular Biology
- Near optimal multiple alignment within a band in polynomial time
- New formulations of the multiple sequence alignment problem
- Optimal global alignment of signals by maximization of Pearson correlation
- Parametric multiple sequence alignment and phylogeny construction
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)
