The shortest common superstring problem: average case analysis for both exact and approximate matching (Q4503372)
From MaRDI portal
scientific article; zbMATH DE number 1503189
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The shortest common superstring problem: average case analysis for both exact and approximate matching |
scientific article; zbMATH DE number 1503189 |
Statements
The shortest common superstring problem: average case analysis for both exact and approximate matching (English)
0 references
7 September 2000
0 references
shortest common superstring problem
0 references
