New formulations of the multiple sequence alignment problem
From MaRDI portal
Publication:628651
DOI10.1007/S11590-010-0188-8zbMATH Open1213.90176OpenAlexW1990994915MaRDI QIDQ628651FDOQ628651
Le Thi Hoai An, Thiru S. Arthanari
Publication date: 14 March 2011
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-010-0188-8
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
Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Boolean programming (90C09)
Cites Work
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Obtaining test problems via Internet
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Title not available (Why is that?)
- Approximation algorithms for indefinite quadratic programming
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- A polyhedral approach to sequence alignment problems
- Title not available (Why is that?)
- Integer Quadratic Programming Models in Computational Biology
- Efficient algorithms for local alignment search
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Constrained 0-1 quadratic programming: basic approaches and extensions
- A continuous approch for globally solving linearly constrained quadratic
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
- Compact vs. exponential-size LP relaxations
- A parallel algorithm for partially separable non-convex global minimization: Linear constraints
- Separable concave minimization via partial outer approximation and branch and bound
Cited In (7)
- DC programming and DCA: thirty years of developments
- Novel evolutionary models and applications to sequence alignment problems
- A Lagrangian relaxation approach for the multiple sequence alignment problem
- A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
- Title not available (Why is that?)
- The Multiple Sequence Alignment Problem in Biology
- DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology
Uses Software
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)
