Fast protein classification by using the most significant pairs
| dc.contributor.author | Al-Daoud, Essam | |
| dc.date.accessioned | 2010-11-17T09:14:51Z | |
| dc.date.available | 2010-11-17T09:14:51Z | |
| dc.date.issued | 2010-11-17 | |
| dc.description.abstract | This study introduces a new approach to speed up the protein classification process. The basic idea is rewriting the sequences of each family by using the most significant pairs, where the total number of the pairs that can be appeared in the protein sequences is 400 different pairs. The sequence length could be reduced to 0.86, 0.91 and 0.95 by using the most 100, 200 and 300 significant pairs, respectively. The average time reduction is 0.53 %, 0.33 % and 0.22 % for 100, 200, and 300 pairs, respectively. In the three cases the suggested procedure can be adopted to speed up the testing time. However to get identical classification rate to the previous profile HMM, 300 pairs at least must be used. | en |
| dc.identifier.uri | http://hdl.handle.net/2003/27475 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-15694 | |
| dc.language.iso | en | |
| dc.relation.ispartofseries | EXCLI Journal ; Vol. 9, 2010 | en |
| dc.subject | G-Protein coupled receptor | en |
| dc.subject | hidden Markov | en |
| dc.subject | multi alignment | en |
| dc.subject | significant pairs | en |
| dc.subject.ddc | 610 | |
| dc.title | Fast protein classification by using the most significant pairs | en |
| dc.type | Text | |
| dc.type.publicationtype | article | |
| dcterms.accessRights | open access | |
| eldorado.dnb.zdberstkatid | 2132560-1 |