Two fast constructions of compact representations of binary words with given set of periods (Q507396): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Collage system: A unifying framework for compressed pattern matching. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of periods in strings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periods and binary words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periods in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank

Latest revision as of 08:54, 13 July 2024

scientific article
Language Label Description Also known as
English
Two fast constructions of compact representations of binary words with given set of periods
scientific article

    Statements

    Two fast constructions of compact representations of binary words with given set of periods (English)
    0 references
    6 February 2017
    0 references
    periodicity
    0 references
    collage system
    0 references
    algorithm
    0 references
    borders
    0 references
    0 references

    Identifiers