Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time (Q1029706): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56994097, #quickstatements; #temporary_batch_1719441204927
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3439707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A space-efficient algorithm for sequence alignment with inversions and reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse dynamic programming algorithm for alignment with non-overlapping inversions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Common Substring Alignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block edit models for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a cyclic string-to-string correction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local algorithm for DNA sequence alignment with inversions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737692 / rank
 
Normal rank

Latest revision as of 19:22, 1 July 2024

scientific article
Language Label Description Also known as
English
Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time
scientific article

    Statements

    Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time (English)
    0 references
    13 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    dynamic programming
    0 references
    string to string comparison
    0 references
    block operations
    0 references
    scoring schemes
    0 references
    biological sequence alignment
    0 references
    0 references
    0 references