A parsimony approach to genome-wide ortholog assignment

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

Volumn 3909 LNBI, Issue , 2006, Pages 578-594

  Fu, Zheng ^a   Chen, Xin ^b   Vacic, Vladimir ^a   Nan, Peng ^c   Zhong, Yang ^a   Jiang, Tao ^a,d  

^a University of California Riverside   (United States)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c SHANGHAI CENTER FOR BIOINFORMATION TECHNOLOGY   (China)

^d TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL APPROACH; GENE DUPLICATION; ORTHOLOGOUS GENES; SIMULATED DATA;

BIODIVERSITY; COMPUTATIONAL COMPLEXITY; EVOLUTIONARY ALGORITHMS; MOLECULAR BIOLOGY; NUCLEIC ACID SEQUENCES; THROUGHPUT;

GENES;

EID: 33745794001     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11732990_47     Document Type: Conference Paper

References (26)

1. S. Altschul et al. Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Research, vol. 25, no. 17, pp 3389-3402, 1997.
2. A. Bairoch et al. The Universal Protein Resource (UniProt). Nuc. Acids Res. 33:D154-D159, 2005.
3. S.B. Cannon and N.D. Young. OrthoParaMap: distinguishing orthologs from paralogs by integrating comparative genome data and gene phylogenies. BMC Bioinformatics 4(1):35, 2003.
4. X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong, S. Lonardi, and T. Jiang. Computing the assignment of orthologous genes via genome rearrangement. In Proc. 3rd Asia Pacific Bioinformatics Conf. (APBC'05), pp. 363-378, 2005.
5. X. Chen, J. Zheng, Z. Fu, P. Nan, Y. Zhong, S. Lonardi, and T. Jiang The assignment of orthologous genes via genome rearrangement. IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 2, no. 4, pp. 302-315, 2005.
6. W.M. Fitch. Distinguishing homologous from analogous proteins. Syst. Zool. 19: 99-113, 1970.
7. S. Hannenhalli and P. Pevzner. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Proc. 27th Ann. ACM Symp. Theory of Comput. (STOC'95), pp. 178-189, 1995.
8. S. Hannenhalli, P. Pevzner. Transforming men into mice (polynomial algorithm for genomic distance problem). Proc. IEEE 36th Symp. Found, of Comp. Sci., 581-592, 1995.
9. D. Karolchik, K.M. Roskin, M. Schwartz, C.W. Sugnet, D.J. Thomas, R.J. Weber, D. Haussler and W.J. Kent. The UCSC Genome Browser Database. Nucleic Acids Res., vol. 31, no. 1, pp. 51-54, 2003.
10. E. Koonin. Orthologs, paralogs, and evolutionary genomics. Annu. Rev. Genet., 2005.
11. Y. Lee et al. Cross-referencing eukaryotic genomes: TIGR orthologous gene alignments (TOGA). Genome Res., vol. 12, pp. 493-502, 2002.
12. L. Li, C. Stoeckert, D. Roos. OrthoMCL: identification of ortholog groups for eukaryotic genomes. Genome Res., vol. 13, pp. 2178-2189, 2003.
13. M. Marron, K. Swenson, and B. Moret. Genomic distances under deletions and insertions. Theoretic Computer Science, vol. 325, no. 3, pp. 347-360, 2004.
14. N. El-Mabrouk. Reconstructing an ancestral genome using minimum segments duplications and reversals. Journal of Computer and System Sciences, vol. 65, pp. 442-464, 2002.
15. M. Ozery-Flato and Ron Shamir. Two notes on genome rearragnements. Journal of Bioinformatics and Computational Biology, Vol. 1, No. 1, pp. 71-94, 2003.
16. M. Remm, C. Storm, and E. Sonnhammer. Automatic clustering of orthologs and in-paralogs from pairwise species comparisons. J. Mol. Biol. 314, 1041-1052, 2001.
17. D. Sankoff. Genome rearrangement with gene families. Bioinformatics 15(11):909-917, 1999.
18. K. Swenson, M. Marron, J. Earnest-DeYoung, and B. Moret. Approximating the true evolutionary distance between two genomes. Proc. 7th SIA Workshop on Algorithm Engineering & Experiments, pp. 121-125, 2005.
19. K. Swenson, N. Pattengale, and B. Moret. A framework for orthology assignment from gene rearrangement data. Proc. 3rd RECOMB Workshop on Comparative Genomics, Dublin, Ireland, LNCS 3678, pp. 153-166, 2005.
20. C. Storm and E. Sonnhammer. Automated ortholog inference from phylogenetic trees and calculation of orthology reliability. Bioinformatics, vol. 18, no. 1, 2002.
21. R.L. Tatusov, M.Y. Galperin, D.A. Natale, and E. Koonin. The COG database: A tool for genome-scale analysis of protein functions and evolution. Nucleic Acids Res. 28:33-36, 2000.
22. G. Tesler. Efficient algorithms for multichromosomal genome rearrangements. Journal of Computer and System Sciences, vol. 65, no. 3, pp. 587-609, 2002.
23. R.L. Tatusov, E. Koonin, and D.J. Lipman. A genomic perspective on protein families. Science, vol. 278, pp. 631-637, 1997.
24. H.M. Wain, E.A. Bruford, R.C. Lovering, M.J. Lush, M.W. Wright and S. Povey. Guidelines for human gene nomenclature. Genomics 79(4), 464-470, 2002.
25. Y.P. Yuan, O. Eulenstein, M. Vingron, and P. Bork. Towards detection of orthologues in sequence databases. Bioinformatics, vol. 14, no. 3, pp. 285-289, 1998.
26. X. Zheng et al. Using shared genomic synteny and shared protein functions to enhance the identification of orthologous gene pairs. Bioinformatics 21(6):703-710, 2005.