Inferring positional homologs with common intervals of sequences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4205 LNBI, Issue , 2006, Pages 24-38

  Blin, Guillaume ^a   Chateau, Annie ^b   Chauve, Cedric ^b,c   Gingras, Yannick ^b  

^a UNIVERSITÉ PARIS EST   (France)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^c SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; NUCLEIC ACID SEQUENCES; PATTERN MATCHING; PROBLEM SOLVING;

GENE MATCHING; GENOMES COMPARISONS; HOMOLOGS; INTERVALS OF SEQUENCES;

GENETIC ENGINEERING;

EID: 33750303924     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11864127_3     Document Type: Conference Paper

References (24)

1. A. Bairoch et al., The Universal Protein Resource (UniProt). Nucleic Acids Res. 33:0154-0159, 2005.
2. E. Belda, A. Moya, F. J. Silva. Genome rearrangement distances and gene order phylogeny in γ-proteobacteria. Mol. Biol. Evol., 22(6):1456-1467, 2005.
3. G. Blin, C. Chauve, and G. Fertin. The breakpoints distance for signed sequences. In CompBioNets 2004: Algorithms & computational methods for biochemical and evolutionary networks, vol. 3 of Texts in Algorithmics, p. 3-16. King's Coll. Pub., London, 2004.
4. G. Blin, R. Rizzi. Conserved interval distance computation between non-trivial genomes. In Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, LNCS 3595:22-31. Springer, Berlin, 2005.
5. G. Blin, C. Chauve, G. Fertin. Gene order and phylogenetic reconstruction: application to γ-proteobacteria. In Comparative Genomics, RECOMB 2005 International Workshop, RCG 2005, Dublin, Ireland, September 18-20, 2005, Proceedings, LNCS/LNBI, 3678:11-20. Springer, Berlin, 2005.
6. G. Bourque, Y. Yacef, N. El-Mabrouk. Maximizing synteny blocks to identify ancestral homologs. In Comparative Genomics, RECOMB 2005 International Workshop, RCG 2005, Dublin, Ireland, September 18-20, 2005, Proceedings, LNCS/LNBI, 3678:21-34. Springer, Berlin, 2005.
7. D. Bryant. The complexity of calculating exemplar distances. In Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, p. 207-212. Kluwer Acad. Press., Dordrecht, 2000.
8. I. J. Burgetz, S. Shariff, A. Pang, E. R. M. Tillier. Positional homology in bacterial genomes. Evolutionary Bioinformatics Online, 2:42-55, 2006.
9. K. P. Byrne, K, H, Wolfe. The Yeast Gene Order Browser: combining curated homology and syntenic context reveals gene fate in polyploid species. Genome Res., 15(10):1456-1461, 2005.
10. S. B. Cannon, A. Kozik, B. Chan, R. Michelmore, N. D. Young. DiagHunter and GenoPix2D: programs for genomic comparisons, large-scale homology discovery and visualization. Genome Biology 4:R68, 2003.
11. C. Chauve, G. Fertin, R. Rizzi, S. Vialette. Genomes containing duplicates are hard to compare. In Computational Science - IOCS 2006, 6th International Conference, Reading, UK, May 28-31, 2006, Proceedings, Part IL, LNCS, 3992:783-790. Springer, Berlin, 2006.
12. X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong, S. Lonardi, T. Jiang. Assignment of orthologous genes via genome rearrangement. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2(4):302-315, 2005.
13. C. Chauve, Y. Diekmann, S. Hebber, J. Mixtacki, S. Rahmann, J. Stoye. On Common Intervals with Errors Report 2006-02, Technische Fakultät der Universität Bielefeld, Abteilung Informationstechnik. 2006.
14. Z. Fu, X. Chen, V. Vacic, P. Nan, Y. Zhong, J. Tang. A parsimony approach to genome-wide ortholog assignment. In Research in Computational Molecular Biology, 10th Annual International Conference, RECOMB 2006, Venice, Italy, April 2-5, 2006, Proceedings, LNCS/LNBI, 3909:578-594. Springer, Berlin, 2006.
15. J. I. Glass et al., Essential genes of a minimal bacterium. Proc. Natl. Acad. Sci. USA, 103(2):425-430, 2006.
16. A. Goldstein, P. Kolman, J. Zheng. Minimum common string partition problem: hardness and approximations. In Algorithms and Computation, 15th International Symposium, ISAAC 2004, HongKong, China, December 20-22, 2004, Proceedings, LNCS, 3341:473-484. Springer, Berlin, 2004.
17. B. J. Haas, A. L. Dechler, J. R. Wortman, S. L. Salzberg. DAGchainer: a tool for mining segmental genome duplication and synteny. Bioinformatics, 20(18):3643-3646, 2004.
18. X. He, M.H. Goldwasser. Identifying conserved gene clusters in the presence of homology families. J. Comput. Biol., 12(6):638-656, 2005.
19. R. Hoberman, D. Durand. The incompatible desiderata of gene cluster properties. In Comparative Genomics, RECOMB 2005 International Workshop, RCG 2005, Dublin, Ireland, September 18-20, 2005, Proceedings, LNCS/LNBI, 3678:73-87. Springer, Berlin, 2005.
20. E. Lerat, V. Daubin, N. A. Moran. From gene trees to organismal phylogeny in prokaryotes: the case of the γ7-Proteobacteria. PLoS Biol., 1(1):E19, 2003.
21. D. Sankoff. Genome rearrangement with gene families. Bioinformatics, 15(11):909-917, 1999.
22. T. Schmidt, J. Stoye. Quadratic time algorithms for finding common intervals in two and more sequences. In Combinatorial Pattern Matching, 15th Annual Symposium, CPU 2004, Istanbul, Turkey, July 5-7, 2004, Proceedings, LNCS, 3109:97-108. Springer, Berlin, 2004.
23. K. M. Swenson, M. Marron, J. V Earnest-DeYoung, B. M. E. Moret. Approximating the true evolutionary distance between two genomes. In Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO), p. 121-129. SIAM Press, New York, 2005.
24. K. M. Swenson, N. D. Pattengale, B. M. E. Moret. A framework for orthology assignment from gene rearrangement data. In Comparative Genomics, RECOMB 2005 International Workshop, RCG 2005, Dublin, Ireland, September 18-20, 2005, Proceedings, LNCS/LNBI, 3678:11-20. Springer, Berlin, 2005.