Deterministic Polynomial-Time Algorithms for Designing Short DNA Words (Q3569085): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 12:49, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deterministic Polynomial-Time Algorithms for Designing Short DNA Words |
scientific article |
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
