Mining biological interaction networks using weighted quasi-bicliques

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6674 LNBI, Issue , 2011, Pages 428-439

  Chang, Wen Chieh ^a   Vakati, Sudheer ^a   Krause, Roland ^b,c   Eulenstein, Oliver ^a  

^a Iowa State University   (United States)

^b MAX PLANCK INSTITUTE FOR MOLECULAR GENETICS   (Germany)

^c FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL INTERACTIONS; BIOLOGICAL NETWORKS; BIPARTITE GRAPHS; DNA-PROTEIN INTERACTION; EMPIRICAL DATA; EXTRACTING FEATURES; FUNCTIONAL CHARACTERIZATION; NP-HARD; RECALL RATE; REGULATORY MECHANISM;

BIOINFORMATICS; GENES;

COMPUTER SIMULATION;

EID: 79955846756     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21260-4_40     Document Type: Conference Paper

References (16)

1. Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discrete Appl. Math. 145(1), 11-21 (2004)
2. Costanzo, M., Baryshnikova, A., Bellay, J., Kim, Y., Spear, E., Sevier, C., Ding, H., Koh, J., Toufighi, K., Mostafavi, S., et al.: The genetic landscape of a cell. Science 327(5964), 425 (2010)
3. Dietrich, B.: Some of my favorite integer programming applications at IBM. Annals of Operations Research 149(1), 75-80 (2007)
4. Ding, C., Zhang, Y., Li, T., Holbrook, S.: Biclustering Protein Complex Interactions with a Biclique Finding Algorithm. In: ICDM, pp. 178-187 (2006)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W H Freeman, New York (1979)
6. Goh, K., Cusick, M., Valle, D., Childs, B., Vidal, M., Barabási, A.: The human disease network. PNAS 104(21), 8685 (2007)
7. Gurobi Optimization Inc.: Gurobi Optimizer 3.0 (2010)
8. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)
9. Li, H., Li, J., Wong, L.: Discovering motif pairs at interaction sites from protein sequences on a proteome-wide scale. Bioinformatics 22(8), 989 (2006)
10. Liu, H., Liu, J., Wang, L.: Searching maximum quasi-bicliques from protein-protein interaction network. JBSE 1, 200-203 (2008)
11. Liu, X., Li, J., Wang, L.: Modeling protein interacting groups by quasi-bicliques: Complexity, algorithm, and application. IEEE TCBB 7(2), 354-364 (2010)
12. Peeters, R.: The maximum edge biclique problem is NP-complete. Discrete Appl. Math. 131(3), 651-654 (2003)
13. Sim, K., Li, J., Gopalkrishnan, V.: Mining maximal quasi-bicliques: Novel algorithm and applications in the stock market and protein networks. Analysis and Data Mining 2(4), 255-273 (2009)
14. Waksman, G.: Proteomics and Protein-Protein Interactions Biology, Chemistry, Bioinformatics, and Drug Design. Springer, Heidelberg (2005)
15. Wang, L.: Near Optimal Solutions for Maximum Quasi-bicliques. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 409-418. Springer, Heidelberg (2010)
16. Yan, C., Burleigh, J.G., Eulenstein, O.: Identifying optimal incomplete phylogenetic data sets from sequence databases. Mol. Phylogenet. Evol. 35(3), 528-535 (2005)