A Parallel Algorithm for Solving the Reversal Median Problem
暂无分享,去创建一个
[1] Matthias Bernt,et al. Genome Rearrangement Based on Reversals that Preserve Conserved Intervals , 2006, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[2] Jens Stoye,et al. On the Similarity of Sets of Permutations and Its Applications to Genome Comparison , 2006, J. Comput. Biol..
[3] Cedric Chauve,et al. Conservation of Combinatorial Structures in Evolution Scenarios , 2004, Comparative Genomics.
[4] Mathieu Raffinot,et al. Gene teams: a new formalization of gene clusters for comparative genomics , 2003, Comput. Biol. Chem..
[5] Bernard M. E. Moret,et al. Finding an Optimal Inversion Median: Experimental Results , 2001, WABI.
[6] Alberto Caprara. The Reversal Median Problem , 2003, INFORMS J. Comput..
[7] P. Pevzner,et al. Genome-scale evolution: reconstructing gene orders in the ancestral species. , 2002, Genome research.
[8] Annie Chateau,et al. Reconstructing Ancestral Gene Orders Using Conserved Intervals , 2004, WABI.
[9] Jens Stoye,et al. Finding All Common Intervals of k Permutations , 2001, CPM.
[10] David A. Bader,et al. A New Implmentation and Detailed Study of Breakpoint Analysis , 2000, Pacific Symposium on Biocomputing.
[11] David Sankoff,et al. Short inversions and conserved gene cluster , 2002, Bioinform..