메뉴 건너뛰기




Volumn 16, Issue 1, 2006, Pages 19-22

K-local hyperplane distance nearest-neighbor algorithm and protein fold recognition

Author keywords

[No Author keywords available]

Indexed keywords


EID: 33646405841     PISSN: 10546618     EISSN: 15556212     Source Type: Journal    
DOI: 10.1134/S1054661806010068     Document Type: Article
Times cited : (11)

References (8)
  • 3
    • 0035014847 scopus 로고    scopus 로고
    • Multiclass protein fold recognition using support vector machines and neural networks
    • C. H. Q. Ding and I. Dubchak, "Multiclass Protein Fold Recognition Using Support Vector Machines and Neural Networks," Bioinformatics 17 (4), 349-358 (2001).
    • (2001) Bioinformatics , vol.17 , Issue.4 , pp. 349-358
    • Ding, C.H.Q.1    Dubchak, I.2
  • 5
    • 0033977962 scopus 로고    scopus 로고
    • SCOP: A Structural Classification of Proteins database
    • L. Lo Conte, B. Alley, T. J. P. Hubbard, et al., "SCOP: a Structural Classification of Proteins Database," Nucleic Acids Res. 28 (1), 257-259 (2000).
    • (2000) Nucleic Acids Res. , vol.28 , Issue.1 , pp. 257-259
    • Lo Conte, L.1    Alley, B.2    Hubbard, T.J.P.3
  • 8
    • 84898980366 scopus 로고    scopus 로고
    • K-local hyperplane and convex distance nearest-neighbor algorithms
    • Ed. by T. G. Dietterich, S. Becker, and Z. Ghahramani (MIT, Cambridge, MA)
    • P. Vincent and Y. Bengio, "K-Local Hyperplane and Convex Distance Nearest-Neighbor Algorithms," in Advances in Neural Information Processing Systems, Ed. by T. G. Dietterich, S. Becker, and Z. Ghahramani (MIT, Cambridge, MA, 2002), Vol. 14, pp. 985-992.
    • (2002) Advances in Neural Information Processing Systems , vol.14 , pp. 985-992
    • Vincent, P.1    Bengio, Y.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.