You are here: MIMS > EPrints
MIMS EPrints

2012.68: Maximising the Size of Non-Redundant Protein Datasets Using Graph Theory

2012.68: Simon C. Bull, Mark R. Muldoon and Andrew J. Doig (2012) Maximising the Size of Non-Redundant Protein Datasets Using Graph Theory.

There is a more recent version of this eprint available. Click here to view it.

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
3596 Kb


Analysis of protein data sets often requires prior removal of redundancy, so that data is not biased by having multiple copies of similar proteins. This is usually achieved by pairwise comparison of sequences, followed by purging so that no two pairs have similarities above a chosen threshold. From a starting set, such as the PDB or a genome, one should remove as few sequences as possible, to give the largest possible non-redundant set for subsequent analysis. Protein redundancy can be represented as a graph, with proteins as nodes connected by undirected edges, if they have a pairwise similarity above the chosen threshold. The problem is then equivalent to finding the maximum independent set (MIS), where as few nodes are removed as possible to remove all edges. We tested seven MIS algorithms, three of which are new. We applied the methods to the PDB, subsets of the PDB, various genomes and the BHOLSIB benchmark datasets. For PDB subsets of up to 1000 proteins, we could compare to the exact MIS, found by the Cliquer algorithm.

The best algorithm was the new method, Leaf. This works by adding clique members that have no edges to nodes outside the clique to the MIS, starting with the smallest cliques. For PDB subsets of up to 1000 members, it usually finds the MIS and is fast enough to apply to data sets of tens of thousands of proteins. It gives sets that are around 10% larger than the commonly used PISCES algorithm, that are of identical quality. We therefore suggest that Leaf should be the method of choice for generating non-redundant protein data sets, though it is ineffective on dense graphs, such as the BHOLSIB benchmarks. The Leaf algorithm and sets from genomes and the PDB are available at:

Item Type:MIMS Preprint
Additional Information:

The PDF linked above includes the article and all its supplements

Uncontrolled Keywords:graph theory, maximum independent set, bioinformatics, protein sequence data
Subjects:MSC 2000 > 68 Computer science
MSC 2000 > 92 Biology and other natural sciences
MIMS number:2012.68
Deposited By:Dr Mark Muldoon
Deposited On:07 July 2012

Available Versions of this Item

Download Statistics: last 4 weeks
Repository Staff Only: edit this item