Pages that link to "Item:Q2977005"
From MaRDI portal
The following pages link to The Capacity of String-Duplication Systems (Q2977005):
Displaying 7 items.
- The tandem duplication distance problem is hard over bounded alphabets (Q2115851) (← links)
- Bound-decreasing duplication system (Q2326408) (← 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 maximum number of non-confusable strings evolving under short tandem duplications (Q6173451) (← links)
- On duplication-free codes for disjoint or equal-length errors (Q6618614) (← links)