Reverse engineering of compact suffix trees and links: a novel algorithm (Q405568)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reverse engineering of compact suffix trees and links: a novel algorithm |
scientific article; zbMATH DE number 6340537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reverse engineering of compact suffix trees and links: a novel algorithm |
scientific article; zbMATH DE number 6340537 |
Statements
Reverse engineering of compact suffix trees and links: a novel algorithm (English)
0 references
5 September 2014
0 references
text indexing
0 references
suffix tree
0 references
characterisation
0 references
recognition
0 references
graph
0 references
Eulerian tour
0 references
permutation
0 references
connectivity
0 references
0.8613916635513306
0 references
0.7994781732559204
0 references
0.7955483198165894
0 references
0.7759180665016174
0 references
0.7759180665016174
0 references
