Name
Abstract | ||
|---|---|---|
The automatic classification of protein sequences into families is of great help for the functional prediction and annotation of new proteins. In this article, we present a method called Irredundant Class that address the remote homology detection problem. The best performing methods that solve this problem are string kernels, that compute a similarity function between pairs of proteins based on their subsequence composition. We provide evidence that almost all string kernels are based on patterns that are not independent, and therefore the associated similarity scores are obtained using a set of redundant features, overestimating the similarity between the proteins. To specifically address this issue, we introduce the class of irredundant common patterns. Loosely speaking, the set of irredundant common patterns is the smallest class of independent patterns that can describe all common patterns in a pair of sequences. We present a classification method based on the statistics of these patterns, named Irredundant Class. Results on benchmark data show that the Irredundant Class outperforms most of the string kernels previously proposed, and it achieves results as good as the current state-of-the-art method Local Alignment, but using the same pairwise information only once. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1089/cmb.2010.0171 | JOURNAL OF COMPUTATIONAL BIOLOGY |
Keywords | Field | DocType |
combinatorics,genome analysis,protein motifs,sequence analysis,strings | Annotation,Homology (biology),Bioinformatics,Subsequence,Mathematics,Sequence analysis | Journal |
Volume | Issue | ISSN |
18.0 | 12 | 1066-5277 |
Citations | PageRank | References |
15 | 0.61 | 17 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matteo Comin | 1 | 191 | 20.94 |
| Davide Verzotto | 2 | 63 | 3.96 |