Pattern Recognition in Bioinformatics: An Introduction

  • J. C. Rajapakse
  • L. Wong
  • R. Acharya
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4146)

Abstract

The information stored in DNA, a chain of four nucleotides (A, T, G, and C), is first converted to mRNA through the process of transcription and then converted to the functional form of life, proteins, through the process of translation. Only about 5% of the genome contains useful patterns of nucleotides, or genes, that code for proteins. The initiation of translation or transcription process is determined by the presence of specific patterns of DNA or RNA, or motifs. Research on detecting specific patterns of DNA sequences such as genes, protein coding regions, promoters, etc., leads to uncover functional aspects of cells. Comparative genomics focus on comparisons across the genomes to find conserved patterns over the evolution, which possess some functional significance. Construction of evolutionary trees is useful to know how genome and proteome are evolved over all species by ways of a complete library of motifs and genes.

References

  1. 1.
    Eskin, E., Pevzner, P.A.: Finding composite regulatory patterns in DNA sequences. Bioinformatics 18, S354–S363 (2002)Google Scholar
  2. 2.
    Nguyen, M.N., Rajapakse, J.C.: Two-stage support vector regression approach for predicting accessible surface areas of amino acids. PROTIENS: Structure, Function, and Bioinformatics 63, 542–550 (2005)CrossRefGoogle Scholar
  3. 3.
    Zou, M., Conzen, S.D.: A new dynamic Bayesian network (DBN) approach for identifying gene regulatory networks from time course microarray data. Bioinformatics 21, 71–79 (2005)CrossRefGoogle Scholar
  4. 4.
    Li, H., Jiang, T.: A class of edit kernels for SVMs to predict translation initiation sites in eukaryotic mRNAs. Journal of Computational Biology 12(6), 702–718 (2005)CrossRefGoogle Scholar
  5. 5.
    Guo-Liang, L., Tze-Yun, L.: Feature selection for the prediction of translation initiation sites. Genomics Proteomics Bioinformatic 3(2), 73–83 (2005)Google Scholar
  6. 6.
    Majoros, W.H., Pertea, M., Salzberg, S.L.: Efficient implementation of a generalized pair hidden Markov model for comparative gene finding. Bioinformatics 21(9), 1782–1788 (2005)CrossRefGoogle Scholar
  7. 7.
    Schones, D.E., Sumazin, P., Zhang, M.Q.: Similarity of position frequency matrices for transcription factor binding sites. Bioinformatics 21, 307–313 (2005)CrossRefGoogle Scholar
  8. 8.
    Te-Ming, C., Chung-Chin, L., Wen-Hsiung, L.: Prediction of splice sites with dependency graphs and their expanded bayesian networks. Bioinformatics 21, 471–482 (2005)Google Scholar
  9. 9.
    Dror, G., Sorek, R., Shamir, R.: Accurate identification of alternatively spliced exons using support vector machine. Bioinformatics 21, 897–901 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • J. C. Rajapakse
    • 1
    • 4
    • 5
  • L. Wong
    • 2
  • R. Acharya
    • 3
  1. 1.BioInformatics Research CenterNanyang Technological UniversitySingapore
  2. 2.National University of SingaporeSingapore
  3. 3.Computer Science and EngineeringThe Penn State UniversityUSA
  4. 4.Singapore-MIT AllianceSingapore
  5. 5.Biological Engineering DivisionMassachusetts Institute of TechnologyUSA

Personalised recommendations