The following pages link to DNA sequence design using templates (Q698884):
Displaying 17 items.
- Computing maximal Kleene closures that are embeddable in a given subword-closed language (Q256709) (← links)
- On the scalability of biocomputing algorithms: the case of the maximum clique problem (Q433111) (← links)
- On codeword design in metric DNA spaces (Q734201) (← links)
- Binary templates for comma-free DNA codes (Q876480) (← links)
- Construction of DNA codes by using algebraic number theory (Q897343) (← links)
- Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm (Q1040788) (← links)
- A method for constructing artificial DNA libraries based on generalized de Bruijn sequences (Q1735684) (← links)
- Linear constructions for DNA codes (Q1779298) (← links)
- On properties of bond-free DNA languages (Q1779300) (← links)
- A multiobjective approach based on the behavior of fireflies to generate reliable DNA sequences for molecular computing (Q2396466) (← links)
- Iterated Hairpin Completions of Non-crossing Words (Q2891380) (← links)
- DNA Codeword Design: Theory and Applications (Q3458191) (← links)
- Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences (Q3618688) (← links)
- (Q4737642) (← links)
- (Q5061526) (← links)
- OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS (Q5462122) (← links)
- BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS (Q5704382) (← links)