Abstract
We present an iterative algorithm that uses randomness and statistical techniques to improve existing methods for recognizing protein structural motifs. Our algorithm is particularly effective in situations where large numbers of sufficiently diverse examples of the motif are not known. These are precisely the situations that pose significant difficulties for previously known methods. We have implemented our algorithm and we demonstrate its performance on the coiled coil motif. We test our program LearnCoil on the domain of 3-stranded coiled coils and subclasses of 2-stranded coiled coils. We show empirically that for these motifs, our method overcomes the problem of limited data.
Original language | English (US) |
---|---|
Pages | 37-46 |
Number of pages | 10 |
DOIs | |
State | Published - 1997 |
Externally published | Yes |
Event | Proceedings of the 1997 1st Annual International Conference on Computational Molecular Biology, RECOMB - Santa Fe, NM, USA Duration: Jan 20 1997 → Jan 23 1997 |
Other
Other | Proceedings of the 1997 1st Annual International Conference on Computational Molecular Biology, RECOMB |
---|---|
City | Santa Fe, NM, USA |
Period | 1/20/97 → 1/23/97 |
All Science Journal Classification (ASJC) codes
- General Engineering