| Autor: |
Sætrom Pål, Hestnes Arne JH, Håndstad Tony |
| Jazyk: |
angličtina |
| Rok vydání: |
2007 |
| Předmět: |
|
| Zdroj: |
BMC Bioinformatics, Vol 8, Iss 1, p 23 (2007) |
| Druh dokumentu: |
article |
| ISSN: |
1471-2105 |
| DOI: |
10.1186/1471-2105-8-23 |
| Popis: |
Abstract Background Protein remote homology detection is a central problem in computational biology. Most recent methods train support vector machines to discriminate between related and unrelated sequences and these studies have introduced several types of kernels. One successful approach is to base a kernel on shared occurrences of discrete sequence motifs. Still, many protein sequences fail to be classified correctly for a lack of a suitable set of motifs for these sequences. Results We introduce the GPkernel, which is a motif kernel based on discrete sequence motifs where the motifs are evolved using genetic programming. All proteins can be grouped according to evolutionary relations and structure, and the method uses this inherent structure to create groups of motifs that discriminate between different families of evolutionary origin. When tested on two SCOP benchmarks, the superfamily and fold recognition problems, the GPkernel gives significantly better results compared to related methods of remote homology detection. Conclusion The GPkernel gives particularly good results on the more difficult fold recognition problem compared to the other methods. This is mainly because the method creates motif sets that describe similarities among subgroups of both the related and unrelated proteins. This rich set of motifs give a better description of the similarities and differences between different folds than do previous motif-based methods. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
