More on the complexity of common superstring and supersequence problems (Q1318686)
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: More on the complexity of common superstring and supersequence problems |
scientific article; zbMATH DE number 540844
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More on the complexity of common superstring and supersequence problems |
scientific article; zbMATH DE number 540844 |
Statements
More on the complexity of common superstring and supersequence problems (English)
0 references
5 April 1994
0 references
permutations of strings
0 references
shortest common superstring problem
0 references
shortest common supersequence problem
0 references
NP-complete
0 references
0.8645034432411194
0 references
0.844343364238739
0 references
0.8381801843643188
0 references
0.8381795883178711
0 references
0.8381795883178711
0 references
