Discovering the dynamics of microbial genomes.
暂无分享,去创建一个
[1] Bernard M. E. Moret,et al. An Empirical Comparison of Phylogenetic Methods on Chloroplast Gene Order Data in Campanulaceae , 2000 .
[2] H. Ochman,et al. Amelioration of Bacterial Genomes: Rates of Change and Exchange , 1997, Journal of Molecular Evolution.
[3] Manfred K. Warmuth,et al. NxN Puzzle and Related Relocation Problem , 1990, J. Symb. Comput..
[4] K. Crandall,et al. Phylogeny Estimation and Hypothesis Testing Using Maximum Likelihood , 1997 .
[5] D. Sankoff,et al. Parametric genome rearrangement. , 1996, Gene.
[6] David Sankoff,et al. Chloroplast Gene Order and the Divergence of Plants and Algae, from the Normalized Number of Induced Breakpoints , 2000 .
[7] Pavel A. Pevzner,et al. Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals , 1999, J. ACM.
[8] D. Sankoff,et al. Gene order comparisons for phylogenetic inference: evolution of the mitochondrial genome. , 1992, Proceedings of the National Academy of Sciences of the United States of America.
[9] T. Jukes. CHAPTER 24 – Evolution of Protein Molecules , 1969 .
[10] D. Sankoff,et al. Gene Order Breakpoint Evidence in Animal Mitochondrial Phylogeny , 1999, Journal of Molecular Evolution.
[11] N. Saitou,et al. The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.
[12] Alberto Caprara,et al. Sorting Permutations by Reversals and Eulerian Cycle Decompositions , 1999, SIAM J. Discret. Math..
[13] E Pennisi,et al. Genome Data Shake Tree of Life , 1998, Science.
[14] Alberto Caprara,et al. Formulations and hardness of multiple sorting by reversals , 1999, RECOMB.