A linear space algorithm for computing a longest common increasing subsequence (Q845723): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Faster algorithms for computing longest common increasing subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating longest increasing subsequences and patience sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An almost-linear time and linear space algorithm for the longest common subsequence problem / 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: 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: A fast algorithm for computing a longest common increasing subsequence / rank
 
Normal rank

Latest revision as of 10:53, 2 July 2024

scientific article
Language Label Description Also known as
English
A linear space algorithm for computing a longest common increasing subsequence
scientific article

    Statements