New formulations of the multiple sequence alignment problem (Q628651): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining test problems via Internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separable concave minimization via partial outer approximation and branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained 0-1 quadratic programming: basic approaches and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact vs. exponential-size LP relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Quadratic Programming Models in Computational Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to sequence alignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous approch for globally solving linearly constrained quadratic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm for partially separable non-convex global minimization: Linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for local alignment search / rank
 
Normal rank
Property / cites work
 
Property / cites work: On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for indefinite quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137900 / rank
 
Normal rank

Latest revision as of 21:25, 3 July 2024

scientific article
Language Label Description Also known as
English
New formulations of the multiple sequence alignment problem
scientific article

    Statements

    New formulations of the multiple sequence alignment problem (English)
    0 references
    0 references
    0 references
    14 March 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    linear constrained 0-1 quadratic programming
    0 references
    maximum weight trace
    0 references
    DC programming
    0 references
    0 references
    0 references
    0 references