Featureless pattern recognition in an imaginary hilbert space and its application to protein fold classification

15Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The featureless pattern recognition methodology based on measuring some numerical characteristics of similarity between pairs of entities is applied to the problem of protein fold classification. In computational biology, a commonly adopted way of measuring the likelihood that two proteins have the same evolutionary origin is calculating the so-called alignment score between two amino acid sequences that shows properties of inner product rather than those of a similarity measure. Therefore, in solving the problem of determining the membership of a protein given by its amino acid sequence (primary structure) in one of preset fold classes (spatial structure), we treat the set of all feasible amino acid sequences as a subset of isolated points in an imaginary space in which the linear operations and inner product are defined in an arbitrary unknown manner, but without any conjecture on the dimension, i.e. as a Hilbert space. © Springer-Verlag Berlin Heidelberg 2001.

Cite

CITATION STYLE

APA

Mottl, V., Dvoenko, S., Seredin, O., Kulikowski, C., & Muchnik, I. (2001). Featureless pattern recognition in an imaginary hilbert space and its application to protein fold classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2123 LNAI, pp. 322–336). Springer Verlag. https://doi.org/10.1007/3-540-44596-x_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free