Pages that link to "Item:Q4972689"

The following pages link to Deciding the Confusability of Words under Tandem Repeats in Linear Time (Q4972689):

Displayed 2 items.

• The tandem duplication distance problem is hard over bounded alphabets (Q2115851) ‎ (← links)
• On the maximum number of non-confusable strings evolving under short tandem duplications (Q6173451) ‎ (← links)