The following pages link to DNA Computing (Q5717673):
Displayed 9 items.
- Computing maximal Kleene closures that are embeddable in a given subword-closed language (Q256709) (← links)
- Some properties of involution binary relations (Q493117) (← links)
- Testing DNA code words properties of regular languages (Q896711) (← links)
- On properties of bond-free DNA languages (Q1779300) (← links)
- Hairpin structures defined by DNA trajectories (Q2272214) (← links)
- Iterated Hairpin Completions of Non-crossing Words (Q2891380) (← links)
- Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language (Q3092337) (← links)
- Hairpin Structures in DNA Words (Q3618686) (← links)
- DNA Coding Using the Subword Closure Operation (Q5452702) (← links)