On-line construction of position heaps (Q396632): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The smallest automaton recognizing the subwords of a text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: File structures using hashing functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transducers and repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / 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: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representation of Balanced Parentheses and Static Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed representations of sequences and full-text indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank

Revision as of 21:11, 8 July 2024

scientific article
Language Label Description Also known as
English
On-line construction of position heaps
scientific article

    Statements

    On-line construction of position heaps (English)
    0 references
    0 references
    13 August 2014
    0 references
    string algorithms
    0 references
    data structures
    0 references
    text index
    0 references
    position heap
    0 references

    Identifiers