Algorithms for splicing junction donor recognition in genomic DNA sequences
Document Type
Conference Proceeding
Publication Date
1-1-1998
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 [2]. In this research, we develop pattern matching algorithms for 5' splicing site (donor site) recognition. Using the Motif models we develop, we can mine out the degenerate pattern information from the consensus splicing junction sequences. The experimental results show that, our algorithm can 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 our algorithm predicts are correct. These precision rates are higher than the best existing donor classification algorithm [12]. The research makes a very important progress toward the development of our algorithms for full gene structure detection.
Identifier
0006555630 (Scopus)
ISBN
[078034863X, 9780780348639]
Publication Title
Proceedings IEEE International Joint Symposia on Intelligence and Systems
External Full Text Location
https://doi.org/10.1109/IJSIS.1998.685439
First Page
169
Last Page
176
Recommended Citation
Yin, Maisheng and Wang, J. T.L., "Algorithms for splicing junction donor recognition in genomic DNA sequences" (1998). Faculty Publications. 16445.
https://digitalcommons.njit.edu/fac_pubs/16445
