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

PLoS ONE

Volumn 8, Issue 2, 2013, Pages

  Bull, Simon C ^a   Muldoon, Mark R ^a   Doig, Andrew J ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

PROTEOME;

ARTICLE; CALCULATION; CLASSIFICATION ALGORITHM; CONTROLLED STUDY; HUMAN; MATHEMATICAL COMPUTING; MATHEMATICAL MODEL; PROTEIN DATABASE; REDUNDANCY ANALYSIS; SEQUENCE ANALYSIS;

ALGORITHMS; DATABASES, PROTEIN; MODELS, MOLECULAR; PROTEINS; SEQUENCE ALIGNMENT;

EID: 84873505889     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0055484     Document Type: Article

References (11)

1. Barton GJ (1996) Protein sequence alignment and database scanning. in: MJE Sternberg (ed.) Protein Structure Prediction. Oxford University Press, Oxford, 1996; 31 pp.
2. Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ, (1990) Basic local alignment search tool. J. Mol. Biol. 215: 403-410.
3. Altschul SF, Madden TL, Scha?ffer AA, Zhang J, Zhang Z, et al. (1997) Gapped BLAST and PSI-BLAST: A new generation of protein database search programs. Nuc. Acids Res. 25: 3389-3402.
4. Liu P, Zeng Z, Qian Z, Feng K, Cai Y (2009) Bioinformatics and Biomedical Engineering 1-3.
5. Wang GL, Dunbrack RL, (2003) PISCES: a protein sequence culling server. Bioinformatics 19: 1589-1591.
6. Hobohm U, Sander C, (1994) Enlarged representative set of protein structures. Prot. Sci. 3: 522-524.
7. Grosso A, Locatelli M, Pullan W, (2008) Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics 14: 587-612.
8. Balaji S, Swaminathan V, Kannan K, (2010) A simple algorithm to optimize maximum independent set. Adv. Modeling Optimization 12: 107-118.
9. Östergård PRJ, (2002) A fast algorithm for the maximum clique problem. Discrete Applied Mathematics 120: 197-207.
10. Niskanen S, Östergård PRJ (2003) Cliquer User's Guide, Version 1.0; Communications Laboratory, Helsinki University of Technology.
11. Thain D, Tannenbaum T, Livny M, (2005) Distributed computing in practice: the Condor experience. Concurrency- Practice and Experience 17: 323-356.