Computing longest (common) Lyndon subsequences (Q2169947): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The “Runs” Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Representations of the Symmetric Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowest common ancestors in trees and directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rollercoasters: Long Sequences without Short Runs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free differential calculus. IV: The quotient groups of the lower central series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Longest Common Palindromic Subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic LCA Queries on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizing words over an ordered alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest almost-increasing subsequence / 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: Counting Lyndon factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest commonly positioned increasing subsequences problem / 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: Longest common subsequence in sublinear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutations, matrices, and generalized Young tableaux / 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: Faster algorithms for computing longest common increasing subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Burnside's Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Increasing and Decreasing Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a longest common almost-increasing subsequence of two sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank

Latest revision as of 00:00, 30 July 2024

scientific article
Language Label Description Also known as
English
Computing longest (common) Lyndon subsequences
scientific article

    Statements

    Computing longest (common) Lyndon subsequences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 August 2022
    0 references
    Lyndon word
    0 references
    subsequence
    0 references
    dynamic programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers