On the repeat-annotated phylogenetic tree reconstruction problem

Journal of Computational Biology

Volumn 13, Issue 8, 2006, Pages 1397-1418

  Swidan, Firas ^a,b   Ziv Ukelson, Michal ^a   Pinter, Ron Y ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Janelia Farm Research Campus ^*  (United States)

Author keywords

Genome rearrangements; Phylogenetic inference; Repmaps; Set tries

Indexed keywords

ALGORITHM; ARTICLE; BACTERIAL GENOME; BIOLOGICAL MODEL; BIOLOGY; GENETIC RECOMBINATION; GENETICS; METHODOLOGY; NUCLEOTIDE REPEAT; PHYLOGENY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; GENOME, BACTERIAL; MODELS, BIOLOGICAL; PHYLOGENY; RECOMBINATION, GENETIC; REPETITIVE SEQUENCES, NUCLEIC ACID;

EID: 39049177460     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2006.13.1397     Document Type: Article

References (53)

1. Achaz, G., Boyer, F., Rocha, E.P.C., et al. 2004. Extracting approximate repeats from large DNA sequences (unpublished).
2. Achaz, G., Coissac, E., Netter, P., et al. 2003. Associations between inverted repeats and the structural evolution of bacterial genomes. Genetics 164, 1279-1289.
3. 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. Comput. Biol. 8, 483-491.
4. Bafna, V., and Pevzner, P.A. 1996. Genome rearrangements and sorting by reversals. SIAM J. Comput. 25, 272-289.
5. Bafna, V., and Pevzner, P.A. 1998. Sorting by transpositions. SIAM J. Discrete Math. 11, 224-240.
6. Bender, M., Ge, D., He, S., et al. 2004. Improved bounds on sorting with length-weighted reversals. Proc. 15th ACM-SIAM Symp. Discrete Algorithms 912-921.
7. Bergeron, A. 2005. A very elementary presentation of the Hannenhalli-Pevzner theory. Discrete Appl. Math. 146, 134-145.
8. Bergeron, A., Heber, S., and Stoye, J. 2002. Common intervals and sorting by reversals: a marriage of necessity. Bioinformatics 18, S54-S63.
9. Bergeron, A., Mixtacki, J., and Stoye, J. 2004. Reversal distance without hurdles and fortresses. 15th Ann. Symp. Combin. Pattern Matching (CPM) 388-399.
10. Bergeron, A., Mixtacki, J., and Stoye, J. 2005. On sorting by translocations. 9th Ann. Int. Conf. Research in Computational Molecular Biology (RECOMB) 615-629.
11. Berman, P., and Hannenhali, S. 1996. Fast sorting by reversals. Proc. 7th Symp. Combin. Pattern Matching (CPM) 168-185.
12. Bourque, G., and Pevzner, P.A. 2002. Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Res. 12, 26-36.
13. Bourque, G., Zdobnov, E.M., Bork, P., et al. 2005. Comparative architectures of mammalian and chicken genomes reveal highly variable rates of genomic rearrangements across different lineages. Genome Res. 15, 98-110.
14. Brocchieri, L. 2001. Phylogenetic inferences from molecular sequences: review and critique. Theoret. Popul. Biol. 59, 27-40.
15. Bzymek, M., and Lovett, S.T. 2001. Instability of repetitive DNA sequences: the role of replication in multiple mechanisms. Proc. Natl. Acad. Sci. USA 98, 8319-8325.
16. Caprara, A. 1999. Formulations and hardness of multiple sorting by reversals. Proc 3th Ann. Int. Conf. Comput. Mol. Biol. 84-93.
17. Chen, T., and Skiena, S. 1996. Sorting with fixed-length reversals. Discrete Appl. Math. 71, 79-95.
18. Christie, D.A., and Irving, R.W. 2001. Sorting strings by reversals and by transpositions. SIAM J. Discrete Math. 14, 193-206.
19. da Silva, A.C.R., Ferro, J.A., Reinach, F.C., et al. 2002. Comparison of the genomes of two Xanthomonas pathogens with differing host specificities. Nature 417, 459-463.
20. Galil, Z., and Italiano, G. F. 1991. Data structures and algorithms for disjoint set union problems. ACM Comput. Surv. 23, 319-344.
21. Gonnet, G. 1983. Handbook of Algorithms and Data Structures. Addison-Wesley, Massachusetts.
22. Gu, Q.-P., Peng, S., and Sudborough, I. 1999. A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theoret. Comput. Sci. 210, 327-339.
23. Hannenhalli, S., and Pevzner, P.A. 1999. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46, 1-27.
24. Hartman, T. 2003. A simpler 1.5-approximation algorithm for sorting by transpositions. Proc. 14th Ann. Symp. Combin. Pattern Matching (CPM) 156-169.
25. Hartman, T., and Sharan, R. 2004. A 1.5-approximation algorithm for sorting by transpositions and transreversals. Proc. 4th Workshop Algorithms Bioinformatics 50-61.
26. Hughes, D. 2000. Evaluating genome dynamics: the constraints on rearrangements within bacterial genomes. Genome Biol. 1, reviews0006.1-0006.8.
27. Kaplan, H., Shamir, R., and Tarjan, R.E. 1997. Faster and simpler algorithm for sorting signed permutations by reversals. Proc. 8th Ann. Symp. Discrete Algorithms 344-351.
28. Kececioglu, J., and Sankoff, D. 1993. Exact and approximation algorithms for the inversion distance between two permutations. Lect. Notes Comput. Sci. 684, 87-105.
29. Kececioglu, J., and Sankoff, D. 1994. Efficient bounds for oriented chromosome inversion distance. Lect. Notes Comput. Sci. 807, 307-325.
30. Kowalczykowski, S.C., Dixon, D.A., Eggleston, A.K., et al. 1994. Biochemistry of homologous recombination in Escherichia coli. Microbiol. Rev. 58, 401-465.
31. Lusetti, S.L., and Cox, M.M. 2002. The bacterial RecA protein and the recombinational DNA repair of stalled replication forks. Ann. Rev. Biochem. 71, 71-100.
32. Mahillon, J., and Chandler, M. 1998. Insertion sequences. Microbiol. Mol. Biol. Rev. 62, 725-774.
33. Martin, W., Rujan, T., Richly, E., et al. 2002. Evolutionary analysis of arabidopsis, cyanobacterial, and chloroplast genomes reveals plastid phylogeny and thousands of cyanobacterial genes in the nucleus. Proc. Natl. Acad. Sci. USA 99, 12246-12251.
34. Moret, B., Wang, L., Warnow, T., et al. 2001. New approaches for reconstructing phylogenies from gene order data. Proc. 9th Int. Conf. Intell. Syst. Mol. Biol. 165-173.
35. Parkhill, J., Sebaihia, M., Preston, A., et al. 2003. Comparative analysis of the genome sequences of Bordetella pertussis, Bordetella parapertussis and Bordetella bronchiseptica. Nat. Genet. 35, 32-40.
36. Peng, Q., Pevzner, P.A., and Tesler, G. 2006. The fragile breakage versus random breakage models of chromosome evolution. PLoS Computational Biology 2, e14.
37. Pevzner, P.A., and Tesler, G. 2003. Genome rearrangements in mammalian evolution: lessons from human and mouse genomes. Genome Res. 13, 37-45.
38. Qian, W., Jia, Y., Ren, S.-X., et al. 2005. Comparative and functional genomic analyses of the pathogenicity of phytopathogen Xanthomonas campestris pv. campestris. Genome Res. 15, 757-767.
39. Rocha, E.P.C. 2003a. An appraisal of the potential for illegitimate recombination in bacterial genomes and its consequences: from duplications to genome reduction. Genome Res. 13, 1123-1132.
40. Rocha, E.P.C. 2003b. DNA repeats lead to the accelerated loos of gene order in bacteria. Trends Genet. 19, 600-603.
41. Rocha, E.P.C. 2004. Order and disorder in bacterial genomes. Curr. Opin. Microbiol. 7, 519-537.
42. Rocha, E.P.C., Danchin, A., and Viari, A. 1999. Functional and evolutionary roles of long repeats in prokaryotes. Res. Microbiol. 150, 725-733.
43. Rothstein, R., Michel, B., and Gangloff, S. 2000. Replication fork pausing and recombination or "gimme a break." Genes Dev. 14, 1-10.
44. Sankoff, D. 2003. Rearrangements and chromosomal evolution. Curr. Opin. Genet. Dev. 13, 583-587.
45. Sankoff, D., and Blanchette, M. 1998. Multiple genome rearrangement and breakpoint phylogeny. J. Comput. Biol. 5, 555-570.
46. Sankoff, D., and Trinh, P. 2005. Chromosomal breakpoint reuse in genome sequence rearrangement. J. Comput. Biol. 12, 812-821.
47. Smith, G.R. 1989. Homologous recombination in prokaryotes: enzymes and controlling sites. Genome 31, 520-527.
48. Swidan, F., Bender, M.A., Ge, D., et al. 2004. Sorting by length-weighted reversals: dealing with signs and circularity. Lect. Notes Comput. Sci. 3109, 32-46.
49. Swidan, F., Rocha, E.P.C., Shmoish, M., et al. 2006. An integrative method for accurate comparative genome mapping. PLoS Comput. Biol. 2, e75.
50. Tannier, E., and Sagot, M.-F. 2004. Sorting by reversals in subquadratic time. Lect. Notes Comput. Sci. 3109, 1-13.
51. Trinh, P., McLysaght, A., and Sankoff, D. 2004. Genomic features in the breakpoint regions between syntenic blocks. Bioinformatics 20, i318-i325.
52. Watterson, G.A., Ewens, W.J., Hall, T.E., et al. 1982. The chromosome inversion problem. J. Theoret. Biol. 99, 1-7.
53. Wolf, Y., Rogozin, I., Grishin, N., et al. 2001. Genome trees constructed using five different approaches suggest new major bacterial clades. BMC Evol. Biol. 1, 1-8.