Pages that link to "Item:Q5020832"
From MaRDI portal
The following pages link to Computing the Tandem Duplication Distance is NP-Hard (Q5020832):
Displaying 6 items.
- Permutation-constrained common string partitions with applications (Q2146123) (← links)
- Tandem Duplications, Segmental Duplications and Deletions, and Their Applications (Q5042229) (← links)
- The Tandem Duplication Distance Is NP-Hard (Q5874286) (← links)
- The longest letter-duplicated subsequence and related problems (Q6592112) (← links)
- The longest subsequence-repeated subsequence problem (Q6606208) (← links)
- Permutation-constrained common string partitions with applications (Q6647775) (← links)