BADGER
Bayesian Analysis to Describe Genomic Evolution by Rearrangement
Version 1.02 beta, June 11, 2004
Copyright © 2004 by Bret Larget & Don Simon
- Larget, B., D. L. Simon, and J.B. Kadane (2002). On a Bayesian approach to phylogenetic
inference from animal mitochondrial genome arrangements (with discussion). Journal of the Royal
Statistical Society, B 64: 681693.
- Simon, D. L. and B. Larget (2001). Phylogenetic inference from mitochondrial genome arrangement
data. In Alexandrov, V. N., J. Dongarra, B. Juliano, R. Renner, C. Tan (Ed.), Computational Science
- ICCS 2001. Springer-Verlag Lecture Notes in Computer Science, 2074: 1022-1028.
- Bader, D., B. Moret, M. Yan (2001). A Linear-Time Algorithm for
Computing Inversion Distance Between Signed Permutations with an
Experimental Study. J. Comput. Biol. 8, 5: 483-491. 15
- Kaplan, H., R. Shamir, R. Tarjan (1999). A Faster and Simpler
Algorithm for Sorting Signed Permutations by Reversals. SIAM
J. Comput. 29(3): 880-892 (1999)
- Boyer, R., and J. Moore (1991). MJRTY A Fast Majority Vote Algorithm. In
Boyer, R. (Ed.), Automated Reasoning: Essays in Honor of Woody
Bledsoe, Kluwer Publishing, Dordrecht.
Back to the table of contents.
This page was most recently updated on June 29, 2004.
badger@badger.duq.edu