Efficient methods for multiple sequence alignment with guaranteed error bounds (Q1203038): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q38573713 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees, Stars, and Multiple Biological Sequence Alignment / 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: A fast algorithm for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Network Design Problem Heuristics / rank
 
Normal rank

Latest revision as of 14:30, 17 May 2024

scientific article
Language Label Description Also known as
English
Efficient methods for multiple sequence alignment with guaranteed error bounds
scientific article

    Statements

    Efficient methods for multiple sequence alignment with guaranteed error bounds (English)
    0 references
    0 references
    0 references
    11 February 1993
    0 references
    0 references
    multiple string alignment
    0 references
    strings of DNA
    0 references
    biological sequences
    0 references
    RNA
    0 references
    amino acids
    0 references
    randomized method
    0 references
    0 references