Engineering a compressed suffix tree implementation (Q5406217): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
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.1145/1498698.1594228 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2146346985 / rank | |||
Normal rank |
Latest revision as of 00:30, 20 March 2024
scientific article; zbMATH DE number 6276671
Language | Label | Description | Also known as |
---|---|---|---|
English | Engineering a compressed suffix tree implementation |
scientific article; zbMATH DE number 6276671 |
Statements
Engineering a compressed suffix tree implementation (English)
0 references
1 April 2014
0 references
algorithm engineering
0 references
Burrows-Wheeler transform
0 references
balanced parentheses
0 references
biological sequence analysis
0 references
LCP values
0 references
lowest common ancestor
0 references
text compression
0 references
text indexing
0 references
wavelet tree
0 references