Inferring strings from suffix trees and links on a binary alphabet (Q496548)
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: Inferring strings from suffix trees and links on a binary alphabet |
scientific article; zbMATH DE number 6484131
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inferring strings from suffix trees and links on a binary alphabet |
scientific article; zbMATH DE number 6484131 |
Statements
Inferring strings from suffix trees and links on a binary alphabet (English)
0 references
22 September 2015
0 references
reverse engineering problem
0 references
enumeration problem
0 references
suffix trees
0 references
0 references
0.8613916635513306
0 references
0.8357670903205872
0 references
0.8351426720619202
0 references
0.7766506671905518
0 references
