Associative database of protein sequences

2Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Motivation: We present a new concept that combines data storage and data analysis in genome research, based on an associative network memory. As an illustration, 115,000 conserved regions from over 73,000 published sequences (i.e. from the entire annotated part of the SWISSPROT sequence database) were identified and clustered by a self-organizing network. Similarity and kinship, as well as degree of distance between the conserved protein segments, are visualized as neighborhood relationship on a two-dimensional topographical map. Results: Such a display overcomes the restrictions of linear list processing and allows local and global sequence relationships to be studied visually. Families are memorized as prototype vectors of conserved regions. On a massive parallel machine, clustering and updating of the database take only a few seconds; a rapid analysis of incoming data such as protein sequences as ESTs is carried out on present-day workstations. Availability: Access to the database is available at http://www.bioinf.mdc-berlin.de/unter2.html.

Cite

CITATION STYLE

APA

Hanke, J., Lehmann, G., Bork, P., & Reich, J. G. (1999). Associative database of protein sequences. Bioinformatics, 15(9), 741–748. https://doi.org/10.1093/bioinformatics/15.9.741

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