The following pages link to DNA Computing (Q5494358):
Displayed 13 items.
- On del-robust primitive words (Q277635) (← links)
- An algorithmic toolbox for periodic partial words (Q477348) (← links)
- Unavoidable sets of partial words (Q733729) (← links)
- Testing primitivity on partial words (Q868383) (← links)
- Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728) (← links)
- Overlap-freeness in infinite partial words (Q1006076) (← links)
- Testing avoidability on sets of partial words is hard (Q1006080) (← links)
- Relational codes of words (Q2465641) (← links)
- Freeness of partial words (Q2465643) (← links)
- Defect theorems with compatibility relations. (Q2480767) (← links)
- Compatibility relations on codes and free monoids (Q3526416) (← links)
- The theorem of Fine and Wilf for relational periods (Q3625689) (← links)
- Watson-Crick Partial Words (Q5055986) (← links)