Gene Identification: Classical and Computational Intelligence Approaches

IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews

Volumn 38, Issue 1, 2008, Pages 55-68

  Bandyopadhyay, Sanghamitra ^a   Maulik, Ujjwal ^b   Roy, D ^c  

^a INDIAN STATISTICAL INSTITUTE   (India)

^b JADAVPUR UNIVERSITY   (India)

^c UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Bioinformatics; case based reasoning; decision tree; gene finding; genetic algorithms (GAs); neural networks

Indexed keywords

EID: 85008025286     PISSN: 10946977     EISSN: 15582442     Source Type: Journal    
DOI: 10.1109/TSMCC.2007.906066     Document Type: Article

References (115)

1. P. Baldi and S. Brunak, Bioinformatics: The Machine Learning Approach. Cambridge, MA: MIT Press, 1998.
2. A. M. Campbell and L. J. Heyer, Discovering Genomics, Proteomics & Bioinformatics. Singapore: Pearson Education, 2004.
3. (2007). [Online]. Available: http://www.ornl.gov/sci/techresources/Human_ Genome/project/progress.shtml
4. L. D. Stein, “Human genome: End of the beginning,” Nature, vol. 431, pp. 915–916, 2004.
5. E. V. Koonin and M. Y. Galperin, Sequence-Evolution-Function: Computational Approaches in Comparative Genomics. Boston, MA: Kluwer Academic. 2002.
6. M. Q. Zhang, “Computational prediction of eukaryotic protein-coding genes,” Nat. Rev. Genet., vol. 3, pp. 698–710, 2002.
7. G. D. Stormo, “Gene-finding approaches for eukaryotes,” Genome Res., vol. 10, no. 4, pp. 394–397, 2000.
8. J. M. Claverie, “Computational methods for the identification of genes in vertebrate genomic sequences,” Hum. Mol. Gene., vol. 6, pp. 1735–1744, 1997.
9. M. Burset and R. Guigo, “Evaluation of gene structure prediction programs,” Genomics, vol. 34, pp. 353–367, 1996.
10. M. S. Gelfand, “Prediction of function in DNA sequence analysis,” J. Comput. Biol., vol. 2, no. 1, pp. 87–115, 1995.
11. D. Haussler, Computational Genefinding, vol. 23, no. 1, pp. 12–15, 1998. Available: http://www.cse.ucsc.edu/~haussler/grpaper.pdf. A short version of this paper appeared in Trends in Biochemical Sci., Suppl. Guide to Bioinformatics.
12. C. Mathe, M.-F. Sagot, T. Schiex, and P. Rouze, “Current methods of gene prediction, their strengths and weaknesses,” Nucleic Acids Res., vol. 30, no. 19, pp. 4103–4117, 2002.
13. W. Li (2007). A bibliography on computational gene finding. [Online]. Available: http://www.nslij-genetics.org/gene/
14. M. S. Gelfand, FANS-REF: Functional analysis of nucleotide sequences reference data bank. [Online]. Available: http://www-hto.usc.edu/software/procrustes/fans_ref/.
15. B. Rost, “PHD: Predicting one-dimensional protein structure by profile based neural networks,” Methods Enzymol., vol. 266, pp. 525–539, 1996.
16. J. C. Setubal and J. Meidanis, Introduction to Computational Molecular Biology. Boston, MA: PWS, 1996.
17. N. C. Jones and P. A. Pevzner, An Introduction to Bioinformatics Algorithms. San Diego, MA: MIT Press, 2004.
18. T. F. Smith and M. S. Waterman, “Identification of common molecular subsequences,” J. Mol. Biol., vol. 147, pp. 195–197, 1981.
19. W. R. Pearson and D. J. Lipman, “Improved tools for biological sequence comparison,” Proc. Natl. Acad. Sci. USA, vol. 85, pp. 2444–2448, 1988.
20. S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman, “Basic local alignment search tool,” J. Mol. Biol., vol. 215, pp. 403–410, 1990.
21. J. W. Fickett, “ORFs and genes: How strong a connection?” J. Comput. Biol, vol. 2, no. 1, pp. 117–123, 1995.
22. I. B. Rogozin and L. Milanesi, “Analysis of donor splice signals in different organisms,” J. Mol. Evol., vol. 45, pp. 50–59, 1997.
23. J. Kleffe, K. Hermann, W. Vahrson, B. Witting, and V. Brendel, “Logitlinear models for the prediction of splice sites in plant pre-mRNA sequences,” Nucleic Acids Res., vol. 24, no. 23, pp. 4709–4718, 1996.
24. M. Q. Zhang and T. G. Marr, “A weight array method for splicing signal analysis,” Comput. Appl. Biosci., vol. 9, pp. 499–509, 1993.
25. S. L. Salzberg, “A method for identifying splice sites and translational start sites in eukaryotic mRNA,” Comput. Appl. Biosci., vol. 13, pp. 365–376, 1997.
26. J. Henderson, S. Salzberg, and K. H. Fasman, “Finding genes in DNA with a hidden Markov model,” J. Comput. Biol., vol. 4, pp. 127–141, 1997.
27. S. Salzberg, A. Delcher, K. H. Fasman, and J. Henderson, “A decision tree system for finding genes in DNA,” J. Comput. Biol, vol. 5, no. 4, pp. 667–680, 1998.
28. C. Burge and S. Karlin, “Prediction of complete gene structures in human genomic DNA,” J. Mol. Biol., vol. 268, pp. 78–94, 1997.
29. M. S. Gelfand, A. A. Mironov, and P. A. Pevzner, “Gene recognition via spliced sequence alignment,” Proc. Natl Acad. Sci. USA, vol. 93, no. 17, pp. 9061–9066, 1996.
30. M. A. Roytberg, T. V. Astakhova, and M. S. Gelfand, “Combinatorial approaches to gene recognition,” Comput. Chem., vol. 21, pp. 229–235, 1997.
31. C. Grasso, B. Modrek, Y. Xing, and C. Lee, “Genome-wide detection of alternative splicing in expressed sequences using partial order multiple
32. sequence alignment graphs,” in Proc. Pacific Symp. Biocomput., 2004, pp. 29–41.
33. R. Guigo, “Assembling genes from predicted exons in linear time with dynamic programming,” J. Comput. Biol., vol. 5, pp. 681–702, 1998.
34. A. Viterbi, “Error bounds for convolutional codes and an asymptotically optimal decoding algorithm,” IEEE Trans. Inf. Theory, vol. IT-13, no. 2, pp. 260–269, Apr. 1967.
35. R. E. Bellman, Dynamic Programming. Princeton, NJ: Princeton Univ. Press, 1957.
36. R. Guigo, S. Knudsen, N. Drake, and T. Smith, “Prediction of gene structure,” J. Mol. Biol., vol. 226, pp. 141–157, 1992.
37. L. Milanesi, N. A. Kolchanov, I. B. Rogozin, I. V. Ischenko, A. E. Kel, Y. L. Orlov, M. P. Ponomarenko, and P. Vezzoni, “GenView: A computing tool for protein-coding regions prediction in nucleotide sequences,” in Proc. 2nd Int. Conf. Bioinformatics, Supercomput. Complex Genome Anal., H. A. Lim, J. W. Fickett, C. R. Cantor, and R. J. Robbins, Eds. Singapore, 1993, pp. 573–588.
38. Y. Xu, R. J. Mural, and E. C. Uberbaker, “Constructing gene models from accurately predicted exons: An application of dynamic programming,” Comput. Appl. Biosci., vol. 10, pp. 613–623, 1994.
39. A. A. Salamov and V. V. Solovyev, “Ab initio gene finding in Drosophila genomic DNA,” Genome Res., vol. 10, no. 4, pp. 516–522, 2000.
40. J. S. Chuang and D. Roth, “Gene recognition based on DAG shortest paths,” Bioinformatics, vol. l, pp. 1-9,2001.
41. I. Korf, P. Flicek, D. Duan, and M. R. Brent, “Integrating genomic homology into gene structure prediction,” Bioinformatics, vol. 17, no. 1, pp. 140-148,2001.
42. A. E. Tenney, R. H. Brown, C. Vaske, J. K. Lodge, T. L. Doering, and M. R. Brent, “Gene prediction and verification in a compact genome with numerous small introns,” Genome Res., vol. 14, pp. 2330–2335, 2004. [Online]. Available: http://genes. cs.wustl.edu/.
43. R.-F. Yeh, L. P. Lim, and C. B. Burge, “Computational inference of homologous gene structures in the human genome,” Genome Res., vol. 11, no. 5, pp. 803-816,2001.
44. T. Schiex, A. Moisan, L. Duret, and P. Rouze, “EuGene: An eukaryotic gene finder that combines several sources of evidence,” in Lecture Notes in Computational Science, vol. 2066, New York: Springer-Verlag, 2000.
45. J. E. Allen, M. Pertea, and S. L. Salzberg, “Computational gene prediction using multiple sources of evidence,” Genome Res., vol. 14, pp. 142–148, 2004.
46. T. Koski, Hidden Markov Models for Bioinformatics. New York: Kluwer Academic, 2002.
47. P. Bucher, K. Karplus, N. Moeri, and K. Hoffman, “A flexible motif search technique based on generalized profiles,” Comput. Chem., vol. 20, no. 1, pp. 3–24, 1996.
48. E. L. L. Sonnhammer, S. R. Eddy, E. Birney, A. Bateman, and R. Durbin, “PFAM: Multiple sequence alignments and HMM-profiles of protein domains,” Nucleic Acids Res., vol. 26, no. 1, pp. 320–322, 1998.
49. V. D. Francesco, P. J. Munson, and J. Gamier, “FORESST: Fold recognition from secondary structure predictions of proteins,” Bioinformatics, vol. 15, no. 2, pp. 131–140, 1999.
50. G. Pollastri, P. Baldi, A. Vullo, and P. Frasconi, “Prediction of protein topologies using GIOHMMs and GRNNs,” in Advances in Neural Information Processing Systems, vol. 15, Cambridge, MA: MIT Press, 2003.
51. K. Karplus, R. Karchin, J. Draper, J. Casper, Y. Mandel-Gutfreund, M. Diekhans, and R. Hughey, “Combining local-structure, foldrecognition, and new fold methods for protein structure prediction,” Proteins. vol. 53. no. 6. pp. 491–496. 2003.
52. S. Cawley, A. Wirth, and T. Speed, “Phat—A gene finding program for Plasmodium falciparum,” Mol. Biochem. Parasitol, vol. 118, no. 2, pp. 167-174, 2001.
53. J. A. Bilmes, A Gentle Tutorial of the EM Algorithm and Its Application to Parameter Estimation for Gaussian Mixture and Hidden Markov Models, Tech. Rep. No. ICSI-TR-97-021, Int. Comput. Sci. Inst. Berkeley CA, USA, 1998.
54. L. A. Rabiner, “A tutorial on hidden markov models and selected applications in speech recognition,” in Proc. IEEE, vol. 77, no. 2, pp. 257–286, Feb. 1989.
55. X. Li, M. Parizeau, and R. Plamondon, “Training hidden Markov models with multiple observations-a combinatorial method,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 22, no. 4, pp. 371–377, Apr. 2000.
56. M. A. Trick, “A tutorial on dynamic programming,” Mini V, 1997, [Online]. Available: http://mat.gsia.cmu.edu/classes/dynamic/dynamic.html
57. E. Snyder and G. Stormo, “Identification of protein coding regions in genomic DNA,” J. Mol. Biol., vol. 248, pp. 1–18, 1995.
58. M. S. Gelfand and M. A. Roytberg, “Prediction of the exon-intron structure by a dynamic programming approach,” Biosystems, vol. 30, pp. 173—182,1993.
59. M. S. Gelfand, T. V. Astakhova, and M. A. Roytberg, “An algorithm for highly specific recognition of protein-coding regions,” Genome Inf., vol. 7, pp. 82–87, 1996.
60. M. S. Gelfand, L. I. Podolsky, T. V. Astakhova, and M. A. Roytberg, “Recognition of genes in human DNA sequences,” J. Comput. Biol., vol. 3, no. 2, pp. 223–234, 1996.
61. Y. Xu, J. R. Einstein, M. Shah, and E. C. Uberbacher, “An improved system for exon recognition and gene modeling in human DNA sequences,” in Proc. Int. Conf. Intell. Syst. Mol. Biol., 1994, pp. 376–383.
62. R. E. Neapolitan, Learning Bayesian Networks. Upper Saddle River, NJ: Prentice-Hall, 2003.
63. D. Heckerman, D. Geiger, and D. Chickering, “Learning Bayesian networks: The combination of knowledge and statistical data,” Mach. Learn., vol. 20, pp. 197–243, 1995.
64. V. Pavlovic, A. Garg, and S. Kasif, “A Bayesian framework for combining gene predictions,” Bioinformatics, vol. 18, no. 1, pp. 19–27, 2002.
65. J. Kolodner, Case-Based Reasoning. San Francisco, CA: Morgan Kaufmann, 1993.
66. I. Watson, Applying Case-Based Reasoning: Techniques for Enterprise Systems. San Francisco, CA: Morgan Kaufman, 1997.
67. C. G. Overton and J. Haas, “Case-based reasoning driven gene annotation,” in Computational Methods in Molecular Biology, S. Salzberg, D. Searls, and S. Kasif, Eds. Amsterdam, The Netherlands: Elsevier, 1998, pp. 65–86.
68. E. Costello and D. C. Wilson, “A case-based approach to gene finding,” in Proc. Workshop CBR Health Sci. ICCBR’03, pp. 19–28.
69. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and S. Clifford, Introduction to Algorithms, 2nd ed. Cambridge, MA: MIT Press, 2001.
70. A. Ram and A. Francis, “Multi-plan retrieval and adaptation in an experience-based agent,” in Case-Based Reasoning: Experiences, Lessons, and Future Directions, D. Leake, Ed. CA, AAAI Press, Menlo Park, CA, 1996.
71. C. J. Stoeckert, Jr., F. Salas, B. Brunak, and G. C. Overton, “EpoDB: A prototype database for the analysis of genes expressed during vertebrate erythropoiesis,” Nucleic Acids Res., vol. 27, no. 1, pp. 200–203, 1999.
72. (1999). [Online]. Available: http://www.cbil.upenn.edu/EpoDB/
73. I. Jurisica and J. I. Glasgow, “Applications of case-based reasoning in molecular biology,” AIMag., vol. 25, no. 1, pp. 85–96, 2004.
74. S. Haykin, Neural Networks: A Comprehensive Foundation. Singapore: Pearson Education, 2002.
75. E. C. Uberbacher, Y. Xu, and R. J. Mural, “Discovering and understanding genes in human DNA sequence using GRAIL,” Methods Enzymol, vol. 266, pp. 259–281, 1996.
76. J. W. Fickett and C.-S. Tung, “Assessment of protein coding measures,” Nucleic Acids Res., vol. 20, pp. 6441–6450, 1992.
77. G. B. Fogel, K. Chellapilla, and D. W. Corne, “Identification of coding regions in DNA sequences using evolved neural networks,” in Evolutionary Computation in Bioinformatics, G. B. Fogel and D. W. Come, Eds. San Fransisco, CA: Morgan Kaufmann, 2002, pp. 195–218.
78. S. M. Hebsgaard, P. G. Korning, N. Tolstrup, J. Engelbrecht, P. Rouze, and S. Brunak, “Splice site prediction in Arabidopsis thaliana pre mRNA by combining local and global sequence information,” Nucleic Acids Res., vol. 24, no. 17, pp. 3439–3452, 1996.
79. N. Tolstrup, P. Rouze, and S. Brunak, “A branch point consensus from Arabidopsis found by non-circular analysis allows for better prediction of acceptor sites,” Nucleic Acids Res., vol. 25, no. 15, pp. 3159–3163, 1997.
80. M. G. Reese, “Application of a time-delay neural network to promoter annotation in the Drosophila melanogaster genome,” Comput. Chem., vol. 26, no. 1, pp. 51-56, 2001.
81. R. Ranawana and V. Palade, “A neural network based multi-classifier system for gene identification in DNA sequences,” Neural Comput. Appl., vol. 14, no. 2, pp. 122–131, 2005.
82. A. Sherriff and J. Ott, “Applications of neural networks for gene finding,” Adv. Genet., vol. 42, pp. 287–297, 2001.
83. V. B. Bajic and S. Hong Seah, “Dragon gene start finder: An advanced system for finding approximate locations of the start of gene transcriptional units,” Genome Res., vol. 13, pp. 1923-1929,2003.
84. V. B. Bajic and S. Hong Seah, “Dragon gene start finder identifies approximate locations of the 5’ ends of genes,” Nucleic Acids Res., vol. 31, no. 13, pp. 3560-3563,2003.
85. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression Trees. Belmont, CA: Wadsworth Int., 1984.
86. J. R. Quinlan, C4.5: Programs for Machine Learning. Los Altos, CA: Morgan Kaufmann, 1993.
87. D. Heath, S. Kasif, and S. Salzberg, “Induction of oblique decision trees,” in Proc. 13th Intl. Joint Conf. Artif. Intell., 1993, pp. 1002–1007.
88. S. K. Murthy, S. Kasif, and S. Salzberg, “A system for the induction of oblique decision trees,” J. Artif. Intell. Res., vol. 2, pp. 1–33, 1994.
89. S. L. Salzberg, “Locating protein coding regions in human DNA using a decision tree algorithm,” J. Comput. Biol., vol. 2, no. 3, pp. 473–485, 1995.
90. S. L. Salzberg, M. Pertea, A. L. Delcher, M. J. Gardner, and H. Tettelin, “Interpolated Markov models for eukaryotic gene finding,” Genomics, vol. 59, pp. 24–31, 1999.
91. J. H. Holland, Adaptation in Natural and Artificial System. Ann Arbor, MI: Univ. Michigan Press, 1975.
92. M. Mitchell, An Introduction to Genetic Algorithms. Cambridge, MA: MIT Press, 1998.
93. J. Gunnels, P. Cull, and J. L. Holloway, “Genetic algorithms and simulated annealing for gene mapping,” in Proc. 1st IEEE Conf. Evol. Comp, Piscataway, NJ: IEEE Press, 1994, pp. 385–390.
94. E. H. Aarts, H. M. Korst, and P. J. van Laarhoven, “Simulated annealing,” in Local Search in Combinatorial Optimization, E. H. Aarts and J. K. Lenstra, Eds. Hoboken, NJ: Wiley, 1997, pp. 121–136.
95. A. Kel, A. Ptitsyn, V. Babenko, S. Meier-Ewert, and H. Lehrach, “A genetic algorithm for designing gene family-specific oligonucleotide sets used for hybridization: The G protein-coupled receptor protein superfamily,” Bioinformatics, vol. 14, no. 3, pp. 259–270, 1998.
96. V. G. Levitsky and A. V. Katokhin, “Recognition of eukaryotic promoters using a genetic algorithm based on iterative discriminant analysis,” In Silico Biol., vol. 3, no. 1/2, pp. 81–87, 2003.
97. E. E. Snyder and G. D. Stormo, “Identifying genes in genomic DNA sequences,” in Nucleic Acid and Protein Sequence Analysis: A Practical Approach, M. J. Bishop and C. J. Rawlings, Eds. Oxford, U.K.: Oxford Univ. Press, 1995, pp. 209–224.
98. (2007). [Online]. Available: http://genome.imim.es/datasets/genomics96/ #SEQS
99. M. Q. Zhang, “Using MZEF to find internal coding exons,” in Current Protocols in Bioinformatics, A. D. Baxevanis and D. B. Davison, Eds. Hoboken, NJ: Wiley, 2003, pp. 1–18.
100. W. H. Majoros, M. Pertea, C. Antonescu, and S. L. Salzberg, “GlimmerM, exonomy, and unveil: Three ab initio eukaryotic genefinders,” Nucleic Acids Res., vol. 31, no. 13, pp. 3601–3604, 2003.
101. C. Wilson, L. Hilyer, and P. Green. (1995). Genefinder Documentation, [Online]. Available: http://weeds.mgh.harvard.edu/doc/ genefinder.doc.html
102. J. Besemer and M. Borodovsky, “GeneMark: Web software for gene finding in prokaryotes, eukaryotes and viruses,” Nucleic Acids Res. (Web server issue), vol. 33, pp. W451-W454, 2005.
103. M. G. Reese, D. Kulp, H. Tammana, and D. Haussler, “Genie-gene finding in Drosophila melanogaster,” Genome Res., vol. 10, no. 4, pp. 391—393, 2000.
104. X. Huang, M. Adams, H. Zhou, and A. Kerlavage, “A tool for analyzing and annotating genomic sequences,” Genomics, vol. 46, pp. 37-45, 1997.
105. A. A. Mironov, J. W. Fickett, and M. S. Gelfand, “Frequent alternative splicing of human genes,” Genome Res., vol. 9, no. 12, pp. 1288–1293, 1999.
106. R. Sorek, R. Shamir, and G. Ast, “How prevalent is functional alternative splicing in the human genome?” Trends Genet., vol. 20, no. 2, pp. 68–71, 2004.
107. V. Veeramachaneni, W. Makalowski, M. Galdzicki, R. Sood, and I. Makalowska, “Mammalian overlapping genes: The comparative perspective,” Genome Res., vol. 14, pp. 280–286, 2004.
108. P. Yua, D. Maa, and M. Xua, “Nested genes in the human genome,” Genomics, vol. 86, pp. 414–422, 2005.
109. S. G. Gregory et al., “The DNA sequence and biological annotation of human chromosome 1,” Nature, vol. 441, pp. 315–321, 2006.
110. D. J. Leader, G. P. Clark, J. Watters, A. F. Beven, P. J. Shaw, and J. W. Brown, “Clusters of multiple different small nucleolar RNA genes in plants are expressed as and processed from polycistronic pre-snoRNAs,” EMBO J., vol. 16, pp. 5742–5751, 1997.
111. T. Blumenthal, “Gene clusters and polycistronic transcription in eukaryotes,” Bioessays, vol. 20, pp. 480-487, 1998.
112. A. A. Mironov, P. S. Novichkov, and M. S. Gelfand, “Pro-Frame: Similarity-based gene recognition in eukaryotic DNA sequences with errors,” Bioinformatics, vol. 17, pp. 13-15,2001.
113. C. Mathe, A. Peresetsky, P. Dehais, M. Van Montagu, and P. Rouze, “Classification of Arabidopsis thaliana gene sequences: Clustering of coding sequences into two groups according to codon usage improves gene prediction,” J. Mol. Biol., vol. 285, pp. 1977–1991, 1999.
114. S. Bandyopadhyay, “An efficient technique for superfamily classification of amino acid sequences: Feature extraction, fuzzy clustering and prototype selection,” Fuzzy Sets Syst., vol. 152, pp. 5–16, 2005.
115. T. A. Thanaraj, “A clean data set of EST-confirmed splice sites from Homo sapiens and standards for clean up procedures,” Nucleic Acids Res., vol. 27, no. 13, pp. 2627–2637, 1999.