The following pages link to Aspects of Molecular Computing (Q5901842):
Displayed 13 items.
- Languages generated by iterated idempotency (Q868949) (← links)
- Uniformly bounded duplication languages (Q1763482) (← links)
- The tandem duplication distance problem is hard over bounded alphabets (Q2115851) (← links)
- Bound-decreasing duplication system (Q2326408) (← links)
- Duplications and Pseudo-Duplications (Q2945563) (← links)
- Uniformly bounded duplication codes (Q3512596) (← links)
- Duplication in DNA Sequences (Q3533029) (← links)
- Deciding the Confusability of Words under Tandem Repeats in Linear Time (Q4972689) (← links)
- Computing the Tandem Duplication Distance is NP-Hard (Q5020832) (← links)
- Tandem Duplications, Segmental Duplications and Deletions, and Their Applications (Q5042229) (← links)
- On the Prefix–Suffix Duplication Reduction (Q5217116) (← links)
- On Compensation Loops in Genomic Duplications (Q5217120) (← links)
- Watson–Crick Jumping Finite Automata (Q5859652) (← links)