Efficient algorithms for finding a longest common increasing subsequence (Q996830): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Enumerating longest increasing subsequences and patience sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Computing Longest Common Increasing Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm computing string edit distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Increasing and Decreasing Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding range restriction capability to dynamic data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing a longest common increasing subsequence / rank
 
Normal rank

Latest revision as of 12:31, 26 June 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for finding a longest common increasing subsequence
scientific article

    Statements

    Efficient algorithms for finding a longest common increasing subsequence (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 July 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    Design and analysis of algorithms
    0 references
    Longest common increasing subsequence
    0 references
    0 references