Logarithmic equal-letter runs for BWT of purely morphic words (Q2163991): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Andrea Frosini / rank
Normal rank
 
Property / author
 
Property / author: Simone Rinaldi / rank
Normal rank
 
Property / author
 
Property / author: Marinella Sciortino / rank
Normal rank
 
Property / author
 
Property / author: Andrea Frosini / rank
 
Normal rank
Property / author
 
Property / author: Simone Rinaldi / rank
 
Normal rank
Property / author
 
Property / author: Marinella Sciortino / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4285175725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composite Repetition-Aware Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burrows-Wheeler transform of words defined by morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and special factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal-Time Dictionary-Compressed Indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lempel–Ziv Complexity of Fixed Points of Morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subword complexities of various classes of deterministic developmental languages without interactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5404281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing compressed text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel results on the number of runs of the Burrows-Wheeler-transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: At the roots of dictionary compression: string attractors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burrows-Wheeler transform and run-length enconding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the clustering effect of BWT via RLE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burrows-Wheeler transform and Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stricter reachable repetitiveness measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexité des facteurs des mots infinis engendrés par morphismes itérés / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of periodicity for infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burrows-Wheeler transform and palindromic richness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4746787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Words with simple Burrows-Wheeler transforms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:58, 29 July 2024

scientific article
Language Label Description Also known as
English
Logarithmic equal-letter runs for BWT of purely morphic words
scientific article

    Statements

    Logarithmic equal-letter runs for BWT of purely morphic words (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 August 2022
    0 references
    Burrows-Wheeler transform
    0 references
    equal-letter runs
    0 references
    morphisms
    0 references
    bispecial circular factors
    0 references

    Identifiers