Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2014.051214
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 5 Issue 12, 2014.
Abstract: Protein fold recognition plays an important role in computational protein analysis since it can determine protein function whose structure is unknown. In this paper, a Classified Sequential Pattern mining technique for Protein Fold Recognition (CSPF) is proposed. CSPF technique consists of two main phases: the sequential mining pattern phase and the fold recognition phase. In the sequential mining pattern phase, Mix & Test algorithm is developed based on Grammatical Inference, which is used as a training phase. Mix & Test algorithm minimizes I/O costs by one database scan, discovers subsequence combinations directly from sequences in memory without searching the whole sequence file, has no database projection, handles gaps, and works with variant length sequences without having to align them. In addition, a parallelized version of Mix & Test algorithm is applied to speed up Mix & Test algorithm performance. In the fold recognition phase, unknown protein folds are predicted via a proposed testing function. To test the performance, 36 SCOP protein folds are used, where the accuracy rate is 75.84% for training data and 59.7% for testing data.
Taysir Hassan A. Soliman, Ahmed Sharaf Eldin, Marwa M. Ghareeb and Mohammed E. Marie, “A Grammatical Inference Sequential Mining Algorithm for Protein Fold Recognition” International Journal of Advanced Computer Science and Applications(IJACSA), 5(12), 2014. http://dx.doi.org/10.14569/IJACSA.2014.051214