Rearrangement of Noisy Genomes
暂无分享,去创建一个
[1] Pavel A. Pevzner,et al. To cut…or not to cut (applications of comparative physical maps in molecular evolution) , 1996, SODA '96.
[2] Pavel A. Pevzner,et al. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.
[3] Marek Karpinski,et al. Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems , 1999, J. Comput. Syst. Sci..
[4] Glenn Tesler,et al. Efficient algorithms for multichromosomal genome rearrangements , 2002, J. Comput. Syst. Sci..
[5] Alberto Caprara,et al. Sorting by reversals is difficult , 1997, RECOMB '97.
[6] David Sankoff,et al. Reversals of Fortune , 2005, Comparative Genomics.
[7] Richard Friedberg,et al. Efficient sorting of genomic permutations by translocation, inversion and block interchange , 2005, Bioinform..
[8] David Sankoff,et al. Exact and Approximation Algorithms for the Inversion Distance Between Two Chromosomes , 1993, CPM.