Approximating the Expected Number of Inversions Given the Number of Breakpoints
暂无分享,去创建一个
[1] Pavel A. Pevzner,et al. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.
[2] David Sankoff,et al. Probability models for genome rearrangement and linear invariants for phylogenetic inference , 1999, RECOMB.
[3] Li-San Wang,et al. Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes , 2001, WABI.
[5] D. Sankoff,et al. Parametric genome rearrangement. , 1996, Gene.
[6] Alberto Caprara,et al. Experimental and Statistical Analysis of Sorting by Reversals , 2000 .
[7] Niklas Eriksen. (1+epsilon)-Approximation of Sorting by Reversals and Transpositions , 2001, WABI.
[8] Michael Doob,et al. Spectra of graphs , 1980 .
[9] Pavel A. Pevzner,et al. Computational molecular biology : an algorithmic approach , 2000 .
[10] David A. Bader,et al. A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study , 2001, WADS.
[11] Alberto Caprara,et al. Sorting Permutations by Reversals and Eulerian Cycle Decompositions , 1999, SIAM J. Discret. Math..
[12] Niklas Eriksen,et al. (1+epsilon)-Approximation of sorting by reversals and transpositions , 2001, Theor. Comput. Sci..