Bioinformatics, Vol 15, 741-748, Copyright © 1999 by Oxford University Press
J Hanke, G Lehmann, P Bork and JG Reich
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 or ESTs is carried out on
present-day workstations. AVAILABILITY: Access to the database is available
at http://www.bioinf.mdc-berlin.de/unter2.html++ + CONTACT:
(hanke,lehmann,reich)@mdc-berlin.de; bork@embl-heidelberg.de
ARTICLES
Associative database of protein sequences
Max-Delbruck-Center for Molecular Medicine, Department of Bioinformatics, Robert-Rossle-Strasse 10, D-13125 Berlin-Buch, Germany.
![]()
CiteULike
Connotea
Del.icio.us What's this?