DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS (Q3526537)
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: DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS |
scientific article; zbMATH DE number 5346924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS |
scientific article; zbMATH DE number 5346924 |
Statements
DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS (English)
0 references
25 September 2008
0 references
DNA computing
0 references
minimal nondeterministic finite automata
0 references
0 references
0.9806079
0 references
0.9806079
0 references
0 references
0 references
0.90334153
0 references
0.8859812
0 references
0 references
0.8772569
0 references
0 references
0.87378514
0 references
