Practical lower and upper bounds for the shortest linear superstring (Q5140730)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7286691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Practical lower and upper bounds for the shortest linear superstring |
scientific article; zbMATH DE number 7286691 |
Statements
16 December 2020
0 references
greedy
0 references
approximation
0 references
overlap
0 references
concat-cycles
0 references
cyclic cover
0 references
linear time
0 references
text compression
0 references
Practical lower and upper bounds for the Shortest Linear Superstring (English)
0 references
0.8609164357185364
0 references
0.8594025373458862
0 references
0.853784441947937
0 references
0.8535779118537903
0 references
0.8528361320495605
0 references
