Biclustering protein complex interactions with a biclique finding algorithm

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 178-187

  Ding, Chris ^a   Zhang, Ya ^b   Li, Tao ^c   Holbrook, Stephen R ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b UNIVERSITY OF KANSAS   (United States)

^c FLORIDA INTERNATIONAL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BICLUSTERING PROTEIN COMPLEX INTERACTIONS; COMPUTE BICLIQUES; MOTZKIN-STRAUS FORMALISM; TEXT MINING; WEB CLICKSTREAM MINING; WIEN DATA ENTRIES; YEAST PROTEIN COMPLEX INTERACTION;

BIOINFORMATICS; CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; PROTEINS; YEAST;

DATA MINING;

EID: 48649103470     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.27     Document Type: Conference Paper

References (26)

1. G. Alexe, S. Alexe, Y. Crama, S. Foldes, P. Hammer, and B. Simeone. Consensus algorithms for the generation of all maximal bicliques. Discrete Applied Mathematics, 145:11-21, 2004.
2. G. D. Bader and C. W. V. Hogue. Analyzing yeast proteinprotein interaction data obtained from different sources. Nature Biotechnology, 20:991-997, 2002.
3. A. Bateman, L. Coin, R. Durbin, et al. The Pfam protein families database. Nucleic Acids Res. (Database Issue), 33:D138-D141, 2004.
4. M. Bellare, M. Goldreich, and M. Sudan. Free bits, peps and non-approximability -towards tight results. Proc. IEEE Symp. on Foundations of Computer Science, pages 422-431, 1995.
5. L Bomze, M. Budinich, P. Pardalos, and M. Pelillo. The maximum clique problem. In D.-Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial Optimization, volume 4. Kluwer Academic Publishers, Boston, MA, 1999.
6. C. Bron and J. Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Communications of the ACM, 16:575-577, 1973.
7. C. Ding, X. He, R. Meraz, and S. Holbrook. A unified representation for multi-protein complex data for modeling protein interaction networks. Proteins: Structure, Function, and Bioinformatics, 57:99-108, 2004.
8. D. Eppstein. Arboricity and bipartite subgraph listing algorithms. Information Processing Letters, 51:207-211, 1994.
9. U. Feige, S. Goldwasser, L. Lov'asz, M. Safra, and M. Szegedy. Approximating clique is almost np-complete. Proc. IEEE Symp. on Foundations of Computer Science, pages 2-12, 1991.
10. M. Garey and D. Johnson. Computers and Intractability: A guide to the theory of NP Completeness. Freeman, 1979.
11. A.-C. Gavin, M. Bosche, R. Krause, et al. Functional organization of the yeast proteome by systematic analysis of protein complexes. Nature, 415:141-147, 2002.
12. L. Gibbons, D. Hearn, P. Pardalos, and M. Ramana. Continuous characterizations of the maximum clique problem. Mathematics of Operations Research, 22:754-768, 1997.
13. U. Guidener, M. Munsterkotter, G. Kastenmuller, et al. Cygd: the comprehensive yeast genome database. Nucleic Acids Res. (Database Issue), 33:D364-D368, 2005.
14. 1_ε. Acta Mathematica, 182:105-142, 1999.
15. T. Hastie, R. Tibsbirani, and J. Friedman. Elements of Statistical Learning. Springer Verlag, 2001.
16. Y. Ho, A. Gruhler, A. Heilbut, et al. Systematic identification of protein complexes in saccharomyces cerevisiae by mass spectrometry. Nature, 415:180-193, 2002.
17. T. Ito, T. Chiba, R. Ozawa, M. Yoshida, M. Hattori, and Y. Sakaki. A comprehensive two hybrid analysis to explore the yeast protein interactome. Proc. Natl. Acad. Sci., 98(8):4569-4574, 2001.
18. J. Li, H. Li, D. Soh, and L. Wong. A correspondence between maximal complete bipartite subgraphs and closed patterns. 9th European Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD), Porto, Portugal, October 2005, pages 146-156, 2005.
19. S. C. Madeira and A. L. Oliveira. Biclustering algorithms for biological data analysis: A survey. IEEE/ACM. Trans. on Computational Biology and Bioinformatics, 1:25 - 45, 2004.
20. K. Makino and T. Uno. New algorithms for enumerating all maximal cliques. Proc Scandinavian Workshop on Algorithm Theory, pages 260-272, 2004.
21. T. Motzkin and E. Straus. Maxima for graphs and a new proof of a theorem of turan. Canad J. Math., 17:533-540, 1965.
22. M. Pelillo. Relaxation labeling networks for the maximum clique problem. Journal of Artificial Neural Networks, 2(4):313-328, 1995.
23. R. Tibshirani. Regression shrinkage and selection via the LASSO. J. Royal Statist. Soc B., 58:267-288, 1996.
24. P. Uetz., L. Cagney, G. Mansfield, et al. A comprehensive analysis of protein-protein interactions in saccharomyces cerevisiae. Nature, 403(6770):623-627, 2000.
25. Y. Zhang, J.-M. Chandonia, C. Ding, and S. Holbrook. Comparative mapping of sequence-based and structure-based protein. BMC Bioinformatics, page 77, 2005.
26. Y. Zhang, H. Zha, C. Chu, and X. Ji. Protein interaction inference as a max-sat problem. Proc. of IEEE CVPR 2005 Workshop on Computer Vision Methods for Bioinformatics, 2005.