K-local hyperplane distance nearest-neighbor algorithm and protein fold recognition
Two proteins may be structurally similar but not have significant sequence similarity. Protein fold recognition is an approach usually applied in this case. It does not rely on sequence similarity and can be achieved with relevant features extracted from protein sequences. In this paper, we experime...
Gespeichert in:
Veröffentlicht in: | Pattern recognition and image analysis 2006-01, Vol.16 (1), p.19-22 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Two proteins may be structurally similar but not have significant sequence similarity. Protein fold recognition is an approach usually applied in this case. It does not rely on sequence similarity and can be achieved with relevant features extracted from protein sequences. In this paper, we experiment with the K-local hyperplane distance nearest-neighbor algorithm [8] applied to the protein fold recognition and compare it with other methods. Preliminary results obtained on a real-world dataset [3] demonstrate that this algorithm can outperform many other methods tested on the same dataset.[PUBLICATION ABSTRACT] |
---|---|
ISSN: | 1054-6618 1555-6212 |
DOI: | 10.1134/S1054661806010068 |