On computing all suboptimal alignments (Q1291563): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching / 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: Efficient Parallel Algorithms for String Editing and Related Problems / 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: Linear-space algorithms that build local alignments from fragments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear space algorithm for computing maximal common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized homology searches of the gene and protein sequence data banks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate matching of regular expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm to find all solutions in a neighborhood of the optimum / rank
 
Normal rank

Latest revision as of 20:31, 28 May 2024

scientific article
Language Label Description Also known as
English
On computing all suboptimal alignments
scientific article

    Statements

    On computing all suboptimal alignments (English)
    0 references
    0 references
    20 September 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    divide-and-conquer
    0 references
    linear-space algorithm
    0 references
    sequence comparison
    0 references
    suboptimal alignments
    0 references
    minimal directed acyclic graph
    0 references