DNA sequencing, Eulerian graphs, and the exact perfect matching problem (Q4414481)
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 1953078
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | DNA sequencing, Eulerian graphs, and the exact perfect matching problem |
scientific article; zbMATH DE number 1953078 |
Statements
25 July 2003
0 references
graph theory
0 references
computational complexity
0 references
computational biology
0 references
DNA computing
0 references
DNA sequencing
0 references
0.9586217403411864
0 references
0.8421729803085327
0 references
0.7969496846199036
0 references
0.7911497354507446
0 references
DNA sequencing, Eulerian graphs, and the exact perfect matching problem (English)
0 references
