Longest bordered and periodic subsequences (Q6161459): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2023.106398 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2023.106398 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4364361310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing longest (common) Lyndon subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rollercoasters and Caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rollercoasters: Long Sequences without Short Runs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subsequence automata with default transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic String Alignment. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Longest Common Palindromic Subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and practical bit-vector algorithm for the longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest common rollercoasters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and longest rollercoasters / 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: Algorithms for the Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hardness result and new algorithm for the longest common palindromic subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5140779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest common subsequence in sublinear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absent subsequences in words / rank
 
Normal rank
Property / cites work
 
Property / cites work: String Processing and Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal common subsequence algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Increasing and Decreasing Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-local string comparison: algorithmic techniques and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Square Subsequence Problem Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest run subsequence problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2023.106398 / rank
 
Normal rank

Latest revision as of 20:01, 30 December 2024

scientific article; zbMATH DE number 7691957
Language Label Description Also known as
English
Longest bordered and periodic subsequences
scientific article; zbMATH DE number 7691957

    Statements

    Longest bordered and periodic subsequences (English)
    0 references
    0 references
    0 references
    0 references
    5 June 2023
    0 references
    design of algorithms
    0 references
    computational complexity
    0 references
    dynamic programming
    0 references
    subsequences
    0 references
    periodicity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers