Efficiently computing runs on a trie (Q820550): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3184027729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The “Runs” Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing runs on a trie / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient counting of square substrings in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Number of Squares in a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: String powers in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximal number of cubic runs in a word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting powers and periods in a word from its runs structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest common extensions in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The suffix tree of a tree and minimizing sequential transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The level ancestor problem simplified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank

Latest revision as of 17:40, 26 July 2024

scientific article
Language Label Description Also known as
English
Efficiently computing runs on a trie
scientific article

    Statements

    Efficiently computing runs on a trie (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 September 2021
    0 references
    0 references
    maximal repetitions
    0 references
    Lyndon words
    0 references
    trie
    0 references
    0 references