Enhanced string factoring from alphabet orderings (Q1711413): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2808133657 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1806.05942 / 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: PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR 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: Reconstructing a string from its Lyndon arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizing words over an ordered alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix array and Lyndon factorization of a text / rank
 
Normal rank

Latest revision as of 22:33, 17 July 2024

scientific article
Language Label Description Also known as
English
Enhanced string factoring from alphabet orderings
scientific article

    Statements

    Enhanced string factoring from alphabet orderings (English)
    0 references
    0 references
    0 references
    18 January 2019
    0 references
    0 references
    alphabet ordering
    0 references
    combinatorial problems
    0 references
    design of algorithms
    0 references
    greedy algorithm
    0 references
    Lyndon factorization
    0 references
    0 references
    0 references