Paths and Cycles in Breakpoint Graph of Random Multichromosomal Genomes
暂无分享,去创建一个
[1] W. Ewens,et al. The chromosome inversion problem , 1982 .
[2] Richard Friedberg,et al. Efficient sorting of genomic permutations by translocation, inversion and block interchange , 2005, Bioinform..
[3] R. Young,et al. 75.9 Euler’s Constant , 1991, The Mathematical Gazette.
[4] David Sankoff,et al. Edit Distances for Genome Comparisons Based on Non-Local Operations , 1992, CPM.
[5] David Sankoff,et al. The Distribution of Genomic Distance between Random Genomes , 2006, J. Comput. Biol..
[6] David Sankoff,et al. Efficient Bounds for Oriented Chromosome Inversion Distance , 1994, CPM.
[7] David Sankoff,et al. The Signal in the Genomes , 2006, PLoS Comput. Biol..
[8] Axel Hultman,et al. Estimating the expected reversal distance after a fixed number of reversals , 2004, Adv. Appl. Math..
[9] Glenn Tesler,et al. Efficient algorithms for multichromosomal genome rearrangements , 2002, J. Comput. Syst. Sci..
[10] Nicholas C. Wormald,et al. Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs , 2001, J. Comb. Theory, Ser. B.
[11] David Sankoff,et al. Stability of Rearrangement Measures in the Comparison of Genome Sequences , 2006, J. Comput. Biol..