Pages that link to "Item:Q4566608"
From MaRDI portal
The following pages link to Duplication Distance to the Root for Binary Sequences (Q4566608):
Displaying 5 items.
- The tandem duplication distance problem is hard over bounded alphabets (Q2115851) (← links)
- Computing the Tandem Duplication Distance is NP-Hard (Q5020832) (← links)
- Tandem Duplications, Segmental Duplications and Deletions, and Their Applications (Q5042229) (← links)
- (Q5301985) (← links)
- The Tandem Duplication Distance Is NP-Hard (Q5874286) (← links)