Linear-size suffix tries (Q294967): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PATRICIA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2317728333 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q61677829 / 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: Average sizes of suffix trees and DAWGs / 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: Reducing space for index implementation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Position heaps: a simple and dynamic text indexing data structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Position Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the all pairs suffix-prefix problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of compact directed acyclic word graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of position heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / 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: Fully compressed suffix trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:51, 12 July 2024

scientific article
Language Label Description Also known as
English
Linear-size suffix tries
scientific article

    Statements

    Linear-size suffix tries (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    factor and suffix automata
    0 references
    pattern matching
    0 references
    suffix tree
    0 references
    text indexing
    0 references
    0 references
    0 references