IngentaConnect Large Scale Protein Sequence Clustering

Author: Krause, Antje¹

Source: Current Bioinformatics, Volume 1, Number 2, May 2006 , pp. 247-254(8)

Publisher: Bentham Science Publishers

Abstract:

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 Dayhoff's 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

Document Type: Research article

DOI: 10.2174/157489306777011987

Affiliations: 1: Department of Bioinformatics, Technical University of Applied Sciences Wildau, Bahnhofstr., 15745 Wildau, Germany.

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$55.10 plus tax Refund Policy

Large Scale Protein Sequence Clustering - Not Solved But Solvable