Association algorithm to mine the rules that govern enzyme definition and to classify protein sequences
<p<Abstract</p< <p<Background</p< <p<The number of sequences compiled in many genome projects is growing exponentially, but most of them have not been characterized experimentally. An automatic annotation scheme must be in an urgent need to reduce the gap between the amount of new sequences produced and reliable functional annotation. This work proposes rules for automatically classifying the fungus genes. The approach involves elucidating the enzyme classifying rule that is hidden in UniProt protein knowledgebase and then applying it for classification. The association algorithm, <it<Apriori</it<, is utilized to mine the relationship between the enzyme class and significant InterPro entries. The candidate rules are evaluated for their classificatory capacity.</p< <p<Results</p< <p<There were five datasets collected from the Swiss-Prot for establishing the annotation rules. These were treated as the training sets. The TrEMBL entries were treated as the testing set. A correct enzyme classification rate of 70% was obtained for the prokaryote datasets and a similar rate of about 80% was obtained for the eukaryote datasets. The fungus training dataset which lacks an enzyme class description was also used to evaluate the fungus candidate rules. A total of 88 out of 5085 test entries were matched with the fungus rule set. These were otherwise poorly annotated using their functional descriptions.</p< <p<Conclusion</p< <p<The feasibility of using the method presented here to classify enzyme classes based on the enzyme domain rules is evident. The rules may be also employed by the protein annotators in manual annotation or implemented in an automatic annotation flowchart.</p<.
| Medienart: |
E-Artikel |
|---|
| Erscheinungsjahr: |
2006 |
|---|---|
| Erschienen: |
2006 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:7 |
|---|---|
| Enthalten in: |
BMC Bioinformatics - 7(2006), 1, p 304 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Yuan Gwo-Fang [VerfasserIn] |
|---|
| Links: |
doi.org [kostenfrei] |
|---|
| Themen: |
Biology (General) |
|---|
| doi: |
10.1186/1471-2105-7-304 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
DOAJ067561500 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | DOAJ067561500 | ||
| 003 | DE-627 | ||
| 005 | 20230503074042.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 230228s2006 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1186/1471-2105-7-304 |2 doi | |
| 035 | |a (DE-627)DOAJ067561500 | ||
| 035 | |a (DE-599)DOAJdb32c5ecd34d4ec3b02202fd1c4560cc | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 050 | 0 | |a R858-859.7 | |
| 050 | 0 | |a QH301-705.5 | |
| 100 | 0 | |a Yuan Gwo-Fang |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Association algorithm to mine the rules that govern enzyme definition and to classify protein sequences |
| 264 | 1 | |c 2006 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a <p<Abstract</p< <p<Background</p< <p<The number of sequences compiled in many genome projects is growing exponentially, but most of them have not been characterized experimentally. An automatic annotation scheme must be in an urgent need to reduce the gap between the amount of new sequences produced and reliable functional annotation. This work proposes rules for automatically classifying the fungus genes. The approach involves elucidating the enzyme classifying rule that is hidden in UniProt protein knowledgebase and then applying it for classification. The association algorithm, <it<Apriori</it<, is utilized to mine the relationship between the enzyme class and significant InterPro entries. The candidate rules are evaluated for their classificatory capacity.</p< <p<Results</p< <p<There were five datasets collected from the Swiss-Prot for establishing the annotation rules. These were treated as the training sets. The TrEMBL entries were treated as the testing set. A correct enzyme classification rate of 70% was obtained for the prokaryote datasets and a similar rate of about 80% was obtained for the eukaryote datasets. The fungus training dataset which lacks an enzyme class description was also used to evaluate the fungus candidate rules. A total of 88 out of 5085 test entries were matched with the fungus rule set. These were otherwise poorly annotated using their functional descriptions.</p< <p<Conclusion</p< <p<The feasibility of using the method presented here to classify enzyme classes based on the enzyme domain rules is evident. The rules may be also employed by the protein annotators in manual annotation or implemented in an automatic annotation flowchart.</p< | ||
| 653 | 0 | |a Computer applications to medicine. Medical informatics | |
| 653 | 0 | |a Biology (General) | |
| 700 | 0 | |a Chen Chien-Chi |e verfasserin |4 aut | |
| 700 | 0 | |a Chiu Shih-Hau |e verfasserin |4 aut | |
| 700 | 0 | |a Lin Thy-Hou |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i In |t BMC Bioinformatics |d BMC, 2003 |g 7(2006), 1, p 304 |w (DE-627)DOAJ000133108 |x 14712105 |7 nnns |
| 773 | 1 | 8 | |g volume:7 |g year:2006 |g number:1, p 304 |
| 856 | 4 | 0 | |u https://doi.org/10.1186/1471-2105-7-304 |z kostenfrei |
| 856 | 4 | 0 | |u https://doaj.org/article/db32c5ecd34d4ec3b02202fd1c4560cc |z kostenfrei |
| 856 | 4 | 0 | |u http://www.biomedcentral.com/1471-2105/7/304 |z kostenfrei |
| 856 | 4 | 2 | |u https://doaj.org/toc/1471-2105 |y Journal toc |z kostenfrei |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_DOAJ | ||
| 912 | |a SSG-OLC-PHA | ||
| 951 | |a AR | ||
| 952 | |d 7 |j 2006 |e 1, p 304 | ||