3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.CC2016
Approximation hardness of Shortest Common Superstring variants
Y. William Yu
The shortest common superstring (SCS) problem has been studied at great length because of its connections to the de novo assembly problem in computational genomics. The base proble…
q-bio.PE2012★ 3 cited
Fast Algorithms for Reconciliation under Hybridization and Incomplete Lineage Sorting
Yun Yu, Luay Nakhleh
Reconciling a gene tree with a species tree is an important task that reveals much about the evolution of genes, genomes, and species, as well as about the molecular function of ge…