Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure (Q3637103): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure (English)
0 references
7 July 2009
0 references