Generic placeholder image

Current Bioinformatics


ISSN (Print): 1574-8936
ISSN (Online): 2212-392X

Large Scale Protein Sequence Clustering - Not Solved But Solvable

Author(s): Antje Krause

Volume 1, Issue 2, 2006

Page: [247 - 254] Pages: 8

DOI: 10.2174/157489306777011987

Price: $65


Protein sequence clustering is one of the oldest problems addressed in the field of computational biology. Back in the 60s, when the first protein sequence database was published as printed version, Margaret Dayhoff defined the basic principles of this discipline with only a small number of sequences at hand. With up to a million sequences available in public databases nowadays and several well known methods for automatic grouping of proteins into somehow biologically meaningful families, subfamilies and superfamilies, the problem seems to be satisfactorily solved. Nevertheless, apart from the problem of handling such a huge amount of data, several pitfalls have emerged since Dayhoffs times: databases fill up as fast as genomes are sequenced and a great many of these sequences are fragmental or disappear again when identified as being transcripts of wrongly predicted genes or hypothetical products of pseudogenes. This article first reviews the different approaches developed during the last decades. These insights will then be used to point out possible challenges waiting in the future.

Keywords: Protein sequence, protein domain, protein family, protein sequence clustering, protein sequence database

Rights & Permissions Print Export Cite as
Ā© 2023 Bentham Science Publishers | Privacy Policy