Computing the graph-based parallel complexity of gene assembly (Q974100)
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: Computing the graph-based parallel complexity of gene assembly |
scientific article; zbMATH DE number 5712815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the graph-based parallel complexity of gene assembly |
scientific article; zbMATH DE number 5712815 |
Statements
Computing the graph-based parallel complexity of gene assembly (English)
0 references
27 May 2010
0 references
gene assembly
0 references
parallelism
0 references
signed graphs
0 references
parallel complexity
0 references
algorithmics
0 references
0 references
0.9348756074905396
0 references
0.924117922782898
0 references
0.8990399837493896
0 references
0.7945300340652466
0 references
0.7787300944328308
0 references
