Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure (Q3637103): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-02441-2_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1746392762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217631 / 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: On updating suffix tree labels / 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: Compression of individual sequences via variable-rate coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: File structures using hashing functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank

Latest revision as of 17:56, 1 July 2024

scientific article
Language Label Description Also known as
English
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
scientific article

    Statements

    Identifiers