Shortest consistent superstrings computable in polynomial time (Q673640)
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: Shortest consistent superstrings computable in polynomial time |
scientific article; zbMATH DE number 985678
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest consistent superstrings computable in polynomial time |
scientific article; zbMATH DE number 985678 |
Statements
Shortest consistent superstrings computable in polynomial time (English)
0 references
28 February 1997
0 references
superstring problem
0 references
DNA sequencing
0 references
0.8665717840194702
0 references
0.8636528849601746
0 references
0.8369447588920593
0 references
0.8337839245796204
0 references
