Dynamic programming algorithms for the mosaic longest common subsequence problem (Q845973): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: Algorithms on Strings, Trees and Sequences / 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: Sparse LCS common substring alignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Common Substring Alignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank
 
Normal rank

Latest revision as of 10:59, 2 July 2024

scientific article
Language Label Description Also known as
English
Dynamic programming algorithms for the mosaic longest common subsequence problem
scientific article

    Statements

    Dynamic programming algorithms for the mosaic longest common subsequence problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    0 references
    bioinformatics
    0 references
    mosaic sequence
    0 references
    design of algorithms
    0 references
    0 references