New formulations of the multiple sequence alignment problem
From MaRDI portal
(Redirected from Publication:628651)
Recommendations
- A polyhedral approach to sequence alignment problems
- Novel evolutionary models and applications to sequence alignment problems
- Research in Computational Molecular Biology
- An approximation algorithm for alignment of multiple sequences using motif discovery
- Multiple sequence alignment as a facility-location problem
Cites work
- scientific article; zbMATH DE number 429516 (Why is no real title available?)
- scientific article; zbMATH DE number 53467 (Why is no real title available?)
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A continuous approch for globally solving linearly constrained quadratic
- A parallel algorithm for partially separable non-convex global minimization: Linear constraints
- A polyhedral approach to sequence alignment problems
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Approximation algorithms for indefinite quadratic programming
- Compact vs. exponential-size LP relaxations
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Efficient algorithms for local alignment search
- Integer quadratic programming models in computational biology
- Obtaining test problems via Internet
- On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
- Separable concave minimization via partial outer approximation and branch and bound
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(9)- scientific article; zbMATH DE number 5171932 (Why is no real title available?)
- DC programming and DCA: thirty years of developments
- The maximum weight trace alignment merging problem
- DC programming and DCA for challenging problems in bioinformatics and computational biology
- A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
- The Multiple Sequence Alignment Problem in Biology
- Novel evolutionary models and applications to sequence alignment problems
- DCA based algorithms for multiple sequence alignment (MSA)
- A Lagrangian relaxation approach for the multiple sequence alignment problem
This page was built for publication: New formulations of the multiple sequence alignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628651)
