Genome rearrangement in mitochondria and its computational biology

Lecture Notes in Bioinformatics (Subseries of Lecture Notes in Computer Science)

Volumn 3388, Issue , 2005, Pages 85-96

  Miklós, István ^a   Hein, Jotun ^b  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CELLS; MATHEMATICAL MODELS; MOLECULAR BIOLOGY; MONTE CARLO METHODS; PROBLEM SOLVING; STOCHASTIC CONTROL SYSTEMS; ALGORITHMS; COMPUTER SIMULATION; GENES; MARKOV PROCESSES; MICROORGANISMS;

MITOCHONDRIAL GENOMES; MUTATIONS REARRANGING GENES;

GENES; GENETIC ENGINEERING;

GENOME REARRANGEMENT; MITOCHONDRIA; STOCHASTIC MODELING;

EID: 26444445736     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32290-0_7     Document Type: Conference Paper

References (28)

1. Sturtevant, A.H., Novitski, E.: The homologies of chromosome elements in the genus Drosophila. Genetics 26 (1941) 517-541
2. Palmer, J.D., Herbon, L.A.: Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence. J. Mol. Evol. 28 (1988) 87-97
3. Bader, D.A., Moret, B.M.E., Yan, M.: A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J. Comp. Biol. 8(5) (2001) 483-491
4. Bergeron, A.: A very elementary presentation of the Hannenhalli-Pevzner theory. In: Proceedings of CPM2001 (2001) 106-117
5. Hannenhalli, S., Pevzner, P.A.: Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals. Journal of ACM 46(1) (1999) 1-27
6. Kaplan, H., Shamir, R., Tarjan, R.: A faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Comput. 29(3) (1999) 880-892
7. Siepel, A.: An algorithm to find all sorting reversals. In: Proceedings of RECOMB2002 (2002) 281-290
8. Hannenhalli, S.: Polynomial algorithm for computing translocation distance between genomes. In: Proceedings of CPM1996 (1996) 168-185
9. Bafna, V., Pevzner, A.: Sorting by transpositions. SIAM J. Disc. Math. 11(2) (1998) 224-240
10. Berman, P., Hannenhalli, S., Karpinski, M.: 1.375-Approximation Algorithm for Sorting by Reversals. In: Proceedings of ESA2002 (2002) 200-210
11. Eriksen, N.: (1+ε)-approximation of sorting by reversals and transpositions. In: Proceedings of WABI2001, LNCS 2149 (2001) 227-237
12. Gu, Q-P., Peng, S., Sudborough, H.I.: A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. Theor. Comp. Sci. 210(2) (1999) 327-339
13. Kececioglu, J.D., Sankoff, D.: Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement. Algorithmica 13(1/2) (1995) 180-210
14. Blanchette, M., Kunisawa, T., Sankoff, D: Parametric genome rearrangement. Gene 172 (1996) GC11-GC17
15. Felsenstein, J.: Inferring phylogenies. Sinauer Associates (2003)
16. Hein, J., Wiuf, C., Knudsen, B., Moller, M.B., Wibling, G.: Statistical alignment: Computational properties, homology testing and goodness-of-fit. J. Mol. Biol. 203 (2000) 265-279
17. Larget, B., Simon, D.L., Kadane, B.J.: Bayesian phylogenetic inference from animal mitochondrial genome arrangements. J. Roy. Stat. Soc. B. 64(4) 681-695
18. York, T.L., Durrett, R., Nielsen, R.: Bayesian estimation of inversions in the history of two chromosomes. J. Comp. Biol. 9 (2002) 808-818
19. Durrett, R., Nielsen, R., York, T.L.: Bayesian estimation of genomic distance. Genetics 166 (2004) 621-629
20. Miklós, I.: MCMC Genome Rearrangement. Bioinformatics 19 (2003) ii130-ii137
21. Miklós, I., Ittzés, P., Hein, J.: ParIS genome rearrangement server. Bioinformatics (2004) advance published, doi:10.1093/bioinformatics/bti060
22. Boore, J.L.: The duplication/random loss model for genome rearrangement exemplified by mitochondrial genomes of deuterostome animals. In: Sankoff, D., Nadau, J.H. (eds.): Comparative Genomics. Computational Biology Series 1 (2000) Kluwer Academic Publishers
23. Miklós, I., Lunter, G.A., Holmes, I.: A 'long indel' model for evolutionary sequence alignment. Mol. Biol. Evol. 21(3) (2004) 529-540
24. Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equations of state calculations by fast computing machines. J. Chem. Phys. 21(6) (1953) 1087-1091
25. Liu, J.S.: Monte Carlo strategies in scientific computing. Springer Series in Statistics, New-York. (2001)
26. Hastings, W.K.: Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57(1) (1970) 97-109
27. von Neumann, J.: Various techniques used in connection with random digits. National Bureau of Standards Applied Mathematics Series 12 (1951) 36-38.
28. Nadau, J.H., Taylor, B.A.: Lengths of chromosome segments conserved since divergence of man and mouse. PNAS 81 (1984) 814-818