On suffix extensions in suffix trees (Q714837): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61609442, #quickstatements; #temporary_batch_1712261475387
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved dynamic dictionary matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal off-line detection of repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest automaton recognizing the subwords of a text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete inverted files for efficient text retrieval and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near real-time suffix tree construction via the fringe marked ancestor problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On suffix extensions in suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range Non-overlapping Indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transducers and repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Aho Corasick automaton in linear time for integer alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sorting-complexity of suffix tree construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness Theorems for Periodic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding and representing all the tandem repeats in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear work suffix array construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing suffix arrays in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space efficient linear time construction of suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix Arrays: A New Method for On-Line String Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A four-stage algorithm for updating a Burrows-Wheeler transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic extended suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining order in a generalized linked list / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast incremental planarity testing / rank
 
Normal rank

Latest revision as of 17:56, 5 July 2024

scientific article
Language Label Description Also known as
English
On suffix extensions in suffix trees
scientific article

    Statements

    On suffix extensions in suffix trees (English)
    0 references
    0 references
    0 references
    11 October 2012
    0 references
    suffix trees
    0 references
    string algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references