• DocumentCode
    2641669
  • Title

    Algorithms for splicing junction donor recognition in genomic DNA sequences

  • Author

    Yin, Maisheng ; Wang, Jason T L

  • Author_Institution
    Dept. of Comput. Sci., New Jersey Inst. of Technol., Newark, NJ, USA
  • fYear
    1998
  • fDate
    21-23 May 1998
  • Firstpage
    169
  • Lastpage
    176
  • Abstract
    The consensus sequences at splicing junctions in genomic DNA are required for pre-mRNA breaking and rejoining which must be carried out precisely. Programs currently available for identification or prediction of transcribed sequences from within genomic DNA are far from being powerful enough to elucidate genomic structure completely. In this paper, we develop pattern matching algorithms for 5´ splicing site (donor site) recognition. Using the Motif models we develop, we can extract the degenerate pattern information from the consensus splicing junction sequences. The experimental results show that, our algorithm could correctly recognize 93% of the total donor sites at the right positions in the test DNA group. Furthermore, more than 91% of the donor sites were correctly predicted by our algorithm. These precision rates are higher than the best existing donor classification algorithm
  • Keywords
    DNA; biology computing; molecular biophysics; pattern matching; sensitivity analysis; DNA sequences; donor site recognition; pattern matching; sensitivity analysis; splicing junctions; Bioinformatics; DNA; Data mining; Genomics; Pattern matching; Pattern recognition; Prediction algorithms; Sequences; Splicing; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligence and Systems, 1998. Proceedings., IEEE International Joint Symposia on
  • Conference_Location
    Rockville, MD
  • Print_ISBN
    0-8186-8548-4
  • Type

    conf

  • DOI
    10.1109/IJSIS.1998.685439
  • Filename
    685439