Pages that link to "Item:Q391100"
From MaRDI portal
The following pages link to Deterministic polynomial-time algorithms for designing short DNA words (Q391100):
Displaying 6 items.
- Algorithms for testing that sets of DNA words concatenate without secondary structure (Q1426841) (← links)
- Greedy construction of DNA codes and new bounds (Q2002146) (← links)
- Randomized fast design of short DNA words (Q2930269) (← links)
- (Q4762318) (← links)
- Computational and Information Science (Q5491588) (← links)
- Automata, Languages and Programming (Q5716752) (← links)