MCMC genome rearrangement

Bioinformatics

Volumn 19, Issue SUPPL. 2, 2003, Pages

  Miklós, István ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; CHROMOSOME INVERSION; CONFERENCE PAPER; DNA TRANSPOSITION; DROSOPHILA; EVOLUTION; GENE DELETION; GENE MUTATION; GENE REARRANGEMENT; GENOME; HUMAN; MITOCHONDRION; MONTE CARLO METHOD; NONHUMAN; PRIORITY JOURNAL; PROBABILITY; STOCHASTIC MODEL;

EID: 0344362588     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btg1070     Document Type: Conference Paper

References (20)

1. Bader, D.A., Moret, B.M.E. and Yan, M. (2001) A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J. Comp. Biol., 8(5), 483-491.
2. Bafna, V. and Pevzner, P.A. (1998) Sorting by transpositions. SIAM J. Disc. Math., 11(2), 224-240.
3. Berman, P., Hannenhalli, S. and Karpinski, M. (2002) 1.375-Approximation algorithm for sorting by reversals. In Proceedings of ESA2002. pp. 200-210.
4. Bergeron, A. (2001) A very elementary presentation of the Hannenhalli-Pevzner theory. In Proceedings of CPM2001. pp. 106-117.
5. Blanchette, M., Kunisawa, T. and Sankoff, D. (1996) Parametric genome rearrangement. Gene, 172, GC11-GC17.
6. Eriksen, N. (2001) (1+ε)-approximation of sorting by reversals and transpositions. In Proceedings of WABI2001, LNCS. 2149, pp. 227-237.
7. Geman, S. and Geman, D. (1984) Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6, 721-741.
8. Gu, Q-P., Peng, S. and Sudborough, J.H. (1999) A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theor. Comp. Sci., 210(2), 327-339.
9. Hannenhalli, S. (1996) Polynomial algorithm for computing translocation distance between genomes. 168-185.
10. Hannenhalli, S. and Pevzner, P.A. (1999) Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM, 46(1), 1-27.
11. Hastings, W.K. (1970) Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57(1), 97-109.
12. Kaplan, H., Shamir, R. and Tarjan, R. (1999) A faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Comput., 29(3), 880-892.
13. Kececioglu, J.D. and Sankoff, D. (1995) Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica, 13(1/2), 180-210.
14. Larget, B., Simon, D.L. and Kadane, J.B. (2002) Bayesian phylogenetic inference from animal mitochondrial genome arrangements. J. Roy. Stat. Soc. B, 64(4), 681-695.
15. Liu, J.S. (2001) Monte Carlo Strategies in Scientific Computing. Springer Series in Statistics, New York.
16. Palmer, J.D. and Herbon, L.A. (1988) Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence. J. Mol. Evol., 28, 87-97.
17. Pevzner, P. (2000) Computational Molecular Biology. MIT Press, Cambridge.
18. Sankoff, D. and Blanchette, M. (1999) Probability models for genome rearrangements and linear invariants for phylogenetic inference. In Proceedings of the 3rd International Conference on Computational Molecular Biology (RECOMB99). pp. 302-309.
19. Setubal, J. and Meidanis, J. (1997) Introduction to Computational Molecular Biology. PWS Publishing, Boston.
20. Siepel, A. (2002) An algorithm to find all sorting reversals. In Proceedings of RECOMB2002. pp. 281-290.