Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate genes

Journal of Computational Biology

Volumn 15, Issue 8, 2008, Pages 1093-1115

  Angibaud, Sébastien ^a   Fertin, Guillaume ^a   Rusu, Irena ^a   Thévenin, Annelyse ^b   Vialette, Stéphane ^c  

^a UNIVERSITÉ DE NANTES   (France)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c UNIVERSITÉ PARIS EST   (France)

Author keywords

0 1 Linear programming; Exemplar matching intermediate models; Genome rearrangements; Number of adjacencies; Number of breakpoints

Indexed keywords

ALGORITHM; BIOLOGY; COMPUTER PROGRAM; CONFERENCE PAPER; DNA STRAND BREAKAGE; GENE DUPLICATION; GENOME; LINEAR SYSTEM; MATHEMATICAL COMPUTING; MATHEMATICAL MODEL; NUCLEOTIDE SEQUENCE; PRIORITY JOURNAL;

GAMMAPROTEOBACTERIA;

EID: 52449126703     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2008.0061     Document Type: Conference Paper

References (24)

1. Angibaud, S., Fertin, G., and Rusu, I. 2008. On the approximability of comparing genomes with duplicates. Lect. Notes Comput. Sci. 4921, 34-45.
2. Angibaud, S., Fertin, G., Rusu, I., et al. 2007a. A pseudo-boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes. Lect. Notes Bioinform. 4751, 16-29.
3. Angibaud, S., Fertin, G., Rusu, I., et al. 2007b. A general framework for computing rearrangement distances between genomes with duplicates. J. Comput. Biol. 14, 379-393.
4. Bergeron, A., and Stoye, J. 2003. On the similarity of sets of permutations and its applications to genome comparison. Lect. Notes Comput. Sci. 2697, 68-79.
5. Blin, G., Chauve, C., and Fertin, G. 2004. The breakpoint distance for signed sequences. Proc. 1st Alg. Comput. Methods CompBioNets 3-16.
6. Blin, G., Chauve, C., and Fertin, G. 2005. Genes order and phylogenetic reconstruction: application to γ-proteobacteria. Lect. Notes Bioinform. 3678, 11-20.
7. Blin, G., Chauve, C., Fertin, G., et al. 2007. Comparing genomes with duplications: a computational complexity point of view. ACM/IEEE Trans. Comput. Biol. Bioinform. 4, 523-534.
8. Blin, G. and Rizzi, R. 2005. Conserved intervals distance computation between non-trivial genomes. Lect. Notes Comput. Sci. 3595, 22-31.
9. Bourque, G., Yacef, Y., and El-Mabrouk, N. 2005. Maximizing synteny blocks to identify ancestral homologs. Lect. Notes Bioinform. 3678, 21-35.
10. Bryant, D. 2000. The complexity of calculating exemplar distances, 207-212. In: Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families. Kluwer, Amsterdam.
11. Chen, X., Zheng, J., Fu, Z., et al. 2005. Assignment of orthologous genes via genome rearrangement. IEEE/ACM Trans. Comput. Biol. Bioinform. 2, 302-315.
12. Chen, Z., Fowler, R., Fu, B., et al. 2006a. Lower bounds on the approximation of the exemplar conserved interval distance problem of genomes. Lect. Notes Comput. Sci. 4112, 245-254.
13. Chen, Z., Fu, B., Xu, J., et al. 2007. Non-breaking similarity of genomes with gene repetitions. Lect. Notes Comput. Sci. 4580, 119-130.
14. Chen, Z., Fu, B., and Zhu, B. 2006b. The approximability of the exemplar breakpoint distance problem. Lect. Notes Comput. Sci. 4041, 291-302.
15. Hannenhalli, S., and Pevzner, P.A. 1999. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46, 1-27.
16. Lerat, E., Daubin, V., and Moran, N. 2003. From gene tree to organismal phylogeny in prokaryotes: the case of γ-proteobacteria. PLoS Biol. 1, 101-109.
17. Lerat, E., Daubin, V., Ochman, H., et al. 2005. Evolutionary origins of genomic repertoires in bacteria. PLoS Biol. 3.
18. Marron, M., Swenson, K., and Moret, B. 2004. Genomic distances under deletions and insertions. Theoret. Comput. Sci. 325, 347-360.
19. Sankoff, D. 1999. Genome rearrangement with gene families. Bioinformatics 15, 909-917.
20. Sankoff, D., and Haque, L. 2005. Power boosts for cluster tests. Lect. Notes Bioinform. 3678, 11-20.
21. Schrijver, A. 1998. Theory of Linear and Integer Programming. Wiley, New York.
22. Thach, N.C. 2005. Algorithms for calculating exemplar distances [Honours Year Project Report]. National University of Singapore, Singapore.
23. Uno, T., and Yagiura, M. 2000. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26, 290-309.
24. Watterson, G.A., Ewens, W.J., Hall, T.E., et al. 1982. The chromosome inversion problem. J. Theoret. Biol. 99, 1-7.