Deterministic polynomial-time algorithms for designing short DNA words (Q3569085)
From MaRDI portal
!
WARNING
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 5723190
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministic polynomial-time algorithms for designing short DNA words |
scientific article; zbMATH DE number 5723190 |
Statements
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words (English)
0 references
17 June 2010
0 references
DNA computating
0 references
DNA words design
0 references
coding theory
0 references
expander codes
0 references
Ramanujan graphs
0 references
derandomization
0 references
0.9816676378250122
0 references
0.9042247533798218
0 references
0.8845361471176147
0 references
0.8807889223098755
0 references
