The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated
暂无分享,去创建一个
[1] Guillaume Fertin,et al. Comparing Genomes with Duplications: A Computational Complexity Point of View , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[2] Guillaume Fertin,et al. A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes , 2007, RECOMB-CG.
[3] Guillaume Fertin,et al. On the Approximability of Comparing Genomes with Duplicates , 2008, J. Graph Algorithms Appl..
[4] Costas S. Iliopoulos,et al. A New Efficient Algorithm for Computing the Longest Common Subsequence , 2007, AAIM.
[5] Noga Alon,et al. Color-coding , 1995, JACM.
[6] Y. C. Tay,et al. Divide-and-conquer approach for the exemplar breakpoint distance , 2005, Bioinform..
[7] D. Bryant. The Complexity of Calculating Exemplar Distances , 2000 .
[8] Bin Fu,et al. The Approximability of the Exemplar Breakpoint Distance Problem , 2006, AAIM.
[9] David Sankoff,et al. Genome rearrangement with gene families , 1999, Bioinform..
[10] D. Sankoff,et al. Comparative Genomics: "Empirical And Analytical Approaches To Gene Order Dynamics, Map Alignment And The Evolution Of Gene Families" , 2000 .