Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings (Q2971148): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1609.03668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCS\(k\): a refined similarity measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Common Separable Pattern Among Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for order-preserving pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic LCA Queries on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-preserving indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the longest common subsequence in \(k\)-length substrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inducing the LCP-Array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-preserving matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for consecutive permutation pattern matching / rank
 
Normal rank

Latest revision as of 15:48, 13 July 2024

scientific article
Language Label Description Also known as
English
Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings
scientific article

    Statements

    Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 April 2017
    0 references
    0 references
    longest common subsequence
    0 references
    dynamic programming
    0 references
    order-isomorphism
    0 references
    order-preserving matching
    0 references
    0 references
    0 references