Greedy algorithms for the shortest common superstring that are asymptotically optimal (Q1386458): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Q703071 / rank | |||
| Property / author | |||
| Property / author: Wojciech Szpankowski / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57401553 / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Alan M. Frieze / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Wojciech Szpankowski / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:09, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greedy algorithms for the shortest common superstring that are asymptotically optimal |
scientific article |
Statements
Greedy algorithms for the shortest common superstring that are asymptotically optimal (English)
0 references
24 May 1998
0 references
shortest common superstring
0 references
