New formulations of the multiple sequence alignment problem

DOI10.1007/s11590-010-0188-8zbMath1213.90176OpenAlexW1990994915MaRDI QIDQ628651

Hoai An Le Thi, 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

zbMATH Keywords

DC programmingmaximum weight tracelinear constrained 0-1 quadratic programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Boolean programming (90C09)

Related Items (2)

DC programming and DCA: thirty years of developments ⋮ DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology

Uses Software

• Balibase

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
• Approximation algorithms for indefinite quadratic programming
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• A polyhedral approach to sequence alignment problems
• Compact vs. exponential-size LP relaxations
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Obtaining test problems via Internet
• A parallel algorithm for partially separable non-convex global minimization: Linear constraints
• Separable concave minimization via partial outer approximation and branch and bound
• Constrained 0-1 quadratic programming: basic approaches and extensions
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• A continuous approch for globally solving linearly constrained quadratic
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• 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
• Integer Quadratic Programming Models in Computational Biology
• Efficient algorithms for local alignment search

This page was built for publication: New formulations of the multiple sequence alignment problem