Lagrangian approaches for a class of matching problems in computational biology (Q929184): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: RAPTOR / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063310820 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: q-bio/0609001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximation of protein threading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protein Threading: From Mathematical Models to Parallel Implementations / rank
 
Normal rank

Latest revision as of 11:54, 28 June 2024

scientific article
Language Label Description Also known as
English
Lagrangian approaches for a class of matching problems in computational biology
scientific article

    Statements

    Lagrangian approaches for a class of matching problems in computational biology (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 June 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    protein threading
    0 references
    graph matching
    0 references
    Lagrangian relaxation
    0 references
    cost splitting
    0 references
    network optimization
    0 references
    0 references
    0 references
    0 references