Deterministic Polynomial-Time Algorithms for Designing Short DNA Words (Q3569085): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Ming-Yang Kao / rank | |||
| Property / author | |||
| Property / author: Ming-Yang Kao / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2108251045 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1201.6358 / rank | |||
Normal rank | |||
Latest revision as of 16:34, 19 April 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
