A branch-and-cut algorithm for multiple sequence alignment (Q2583133): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LEDA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: T-coffee / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Balibase / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MUMMER / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-005-0659-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2135434753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential function methods for approximately solving linear programming problems: theory and practice. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact vs. exponential-size LP relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact optimization can outperform separation: a case study in structural proteomics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiple Sequence Alignment Problem in Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence comparison with mixed convex and concave costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using separation algorithms to generate mixed integer model reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138930 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:12, 11 June 2024

scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for multiple sequence alignment
scientific article

    Statements

    A branch-and-cut algorithm for multiple sequence alignment (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 January 2006
    0 references
    0 references
    branch-and-cut approach
    0 references
    multiple sequence alignment problem
    0 references
    heuristic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references