Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2012.12.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999879627 / 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: Faster Algorithms for Computing Longest Common Increasing Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of a longest increasing subsequence and application / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest almost-increasing subsequence / 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: A new efficient algorithm for computing the longest common subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / 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: A linear space algorithm for computing a longest common increasing subsequence / 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 22:11, 8 July 2024

scientific article
Language Label Description Also known as
English
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
scientific article

    Statements

    Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2014
    0 references
    algorithms
    0 references
    longest common subsequence
    0 references
    longest increasing subsequence
    0 references
    longest almost increasing subsequence
    0 references

    Identifiers