Author:
Chen Zhixiang,Fu Bin,Goebel Randy,Lin Guohui,Tong Weitian,Xu Jinhui,Yang Boting,Zhao Zhiyu,Zhu Binhai
Funder
NSF
NSERC
Alberta Innovates - Technology Futures
Early Achievement Award
NSFC
Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. On the approximability of comparing genomes with duplicates;Angibaud;Graph Algorithms Appl.,2009
2. Conserved interval distance computation between non-trivial genomes;Blin,2005
3. The complexity of calculating exemplar distances;Bryant,2000
4. Comparing genomes with duplications: a computational complexity point of view;Blin;IEEE/ACM Trans. Comput. Biol. Bioinform.,2007
5. Linear FPT reductions and computational lower bounds;Chen,2004
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A New Approximation Algorithm for Genomic Scaffold Filling Based on Contig;2023 IEEE International Conference on E-health Networking, Application & Services (Healthcom);2023-12-15
2. Approaching the One-Sided Exemplar Adjacency Number Problem;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2020-11-01
3. A 2-approximation algorithm for the contig-based genomic scaffold filling problem;Journal of Bioinformatics and Computational Biology;2018-12
4. On Approaching the One-Sided Exemplar Adjacency Number Problem;Bioinformatics Research and Applications;2018
5. Genomic Scaffold Filling: A Progress Report;Frontiers in Algorithmics;2016