Automata, Languages and Programming
From MaRDI portal
Publication:5716752
Recommendations
Cited in
(13)- Testing whether a set of code words satisfies a given set of constraints
- Designing q-unique DNA sequences with integer linear programs and Euler tours in de Bruijn graphs
- The Closest Pair Problem under the Hamming Metric
- Deterministic polynomial-time algorithms for designing short DNA words
- DNA Sequence Design by Dynamic Neighborhood Searches
- Deterministic polynomial-time algorithms for designing short DNA words
- scientific article; zbMATH DE number 1568800 (Why is no real title available?)
- Edit metric codes with combinatorial DNA constraints
- On the computational complexity of designing DNA randomizations in a combinatorial protein experiment
- A global heuristically search algorithm for DNA encoding
- Flexible Word Design and Graph Labeling
- scientific article; zbMATH DE number 1953221 (Why is no real title available?)
- Randomized fast design of short DNA words
This page was built for publication: Automata, Languages and Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716752)