Algorithms for computing abelian periods of words (Q496544): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026696944 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1211.5389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary jumbled string matching for highly run-length compressible texts / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate jumbled pattern matching in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4351065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian Repetitions in Sturmian Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for binary jumbled pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing permutations for binary strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sub-quadratic time and linear space data structures for permutation matching in binary strings / rank
 
Normal rank

Revision as of 18:50, 10 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for computing abelian periods of words
scientific article

    Statements

    Algorithms for computing abelian periods of words (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 September 2015
    0 references
    abelian period
    0 references
    abelian repetition
    0 references
    weak repetition
    0 references
    design of algorithms
    0 references
    text algorithms
    0 references
    combinatorics on words
    0 references

    Identifiers