A linear partitioning algorithm for hybrid Lyndons using \(V\)-order (Q390899): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2012.02.001 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080616298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodic musical sequences and Lyndon words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of words satisfying the ``rhythmic oddity property'' (after Simha Arom's works) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Burrows-Wheeler transformation / 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: Q4014292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3089218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyndon-like and V-order factorizations of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic Algorithms for Factoring Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of Unique Maximal Factorization Families (UMFFs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel RAM algorithms for factorizing words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizing words over an ordered alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for computing the canonical form of a circular string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134850 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2012.02.001 / rank
 
Normal rank

Latest revision as of 16:12, 9 December 2024

scientific article
Language Label Description Also known as
English
A linear partitioning algorithm for hybrid Lyndons using \(V\)-order
scientific article

    Statements

    A linear partitioning algorithm for hybrid Lyndons using \(V\)-order (English)
    0 references
    0 references
    0 references
    0 references
    9 January 2014
    0 references
    alphabet
    0 references
    circ-UMFF
    0 references
    lexicographic order
    0 references
    total order
    0 references
    unique maximal factorization family (UMFF)
    0 references
    \(V\)-order
    0 references
    \(V\)-word
    0 references
    partitioning algorithm
    0 references
    concatenation
    0 references
    linear-time RAM algorithms
    0 references
    string comparison
    0 references
    hybrid Lyndon words
    0 references
    factorization algorithms
    0 references

    Identifiers