Bioinformatics, Vol 14, 783-788, Copyright © 1998 by Oxford University Press
X Guan and L Du
MOTIVATION: As sequence databases grow rapidly, results from sequence
comparison searches using fast search methods such as BLAST and FASTA tend
to be long and difficult to digest. RESULTS: In this paper, we present a
new method to extract domain information from sequence comparison searches
by clustering the resulting alignments according to their similarity to the
query sequence. Efficient tree structures and algorithms are used to
organize the alignment data such that structurally conserved elements can
be easily identified. The hierarchical nature of the data structures used
and the flexible X- Window-based interface provide an efficient and
intuitive means to explore the alignment data at different levels so that
the common domains, as well as distantly related features, can be explored.
AVAILABILITY: The clustering program is available by anonymous ftp at:
ftp.embl-ebi.ac.uk under directory /pub/software/unix, file:
clustering.tar.Z.
ARTICLES
Domain identification by clustering sequence alignments
Glaxo Wellcome Research and Development, Five Moore Drive, Research Triangle Park, NC 27709, USA. xg42498@glaxowellcome.com
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
O. V. Galzitskaya and B. S. Melnik Prediction of protein domain boundaries from sequence alone Protein Sci., April 1, 2003; 12(4): 696 - 701. [Abstract] [Full Text] [PDF] |
||||
