The following pages link to (Q4414683):
Displaying 13 items.
- Deterministic polynomial-time algorithms for designing short DNA words (Q391100) (← links)
- Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm (Q1040788) (← links)
- Linear constructions for DNA codes (Q1779298) (← links)
- DNA codes over finite local Frobenius non-chain rings of length 4 (Q2032725) (← links)
- On conflict free DNA codes (Q2040342) (← links)
- Construction of cyclic codes over \(\mathrm{GF}(4)\) for DNA computing (Q2455456) (← links)
- TTT plots: a perl program to create time-to-target plots (Q2468777) (← links)
- Randomized fast design of short DNA words (Q2930269) (← links)
- Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences (Q3618688) (← links)
- (Q4762318) (← links)
- (Q5398532) (← links)
- (Q5867521) (← links)
- Watson-Crick palindromes in DNA computing (Q5962061) (← links)