The following pages link to DNA Computing (Q5494352):
Displaying 4 items.
- Computing maximal Kleene closures that are embeddable in a given subword-closed language (Q256709) (← links)
- Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language (Q3092337) (← links)
- Hairpin Structures in DNA Words (Q3618686) (← links)
- Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences (Q3618688) (← links)
