Exploring biological interaction networks with tailored weighted quasi-bicliques

BMC Bioinformatics

Volumn 13, Issue SUPPL.10, 2012, Pages

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

^a Iowa State University   (United States)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c MAX PLANCK INSTITUTE FOR MOLECULAR GENETICS   (Germany)

^d UNIVERSITY OF LUXEMBOURG   (Luxembourg)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL COMPLEXITY; BIOLOGICAL INTERACTIONS; BIOLOGICAL NETWORKS; DNA-PROTEIN INTERACTION; EXTRACTING FEATURES; FUNCTIONAL CHARACTERIZATION; FUNCTIONAL MODULES; REGULATORY MECHANISM;

COMPLEX NETWORKS; PARALLEL PROCESSING SYSTEMS;

COMPUTER SIMULATION;

ALGORITHM; ARTICLE; BIOLOGY; COMPUTER SIMULATION; DATA MINING; GENE REGULATORY NETWORK; METABOLISM; METHODOLOGY; SYSTEMS BIOLOGY; THEORETICAL MODEL;

ALGORITHMS; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; DATA MINING; GENE REGULATORY NETWORKS; METABOLIC NETWORKS AND PATHWAYS; MODELS, THEORETICAL; SYSTEMS BIOLOGY;

EID: 84877122525     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-13-S10-S16     Document Type: Article

References (19)

1. Waksman G. Proteomics and Protein-Protein Interactions Biology, Chemistry, Bioinformatics, and Drug Design 2005, Springer Verlag.
2. Goh K, Cusick M, Valle D, Childs B, Vidal M, Barabási A. The human disease network. PNAS 2007, 104(21):8685. 10.1073/pnas.0701361104, 1885563, 17502601.
3. Liu X, Li J, Wang L. Modeling protein interacting groups by quasi-bicliques: complexity, algorithm, and application. IEEE TCBB 2010, 7(2):354-364.
4. 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 2009, 2(4):255-273.
5. Liu H, Liu J, Wang L. Searching maximum quasi-bicliques from protein-protein interaction network. JBSE 2008, 1:200-203.
6. Ding C, Zhang Y, Li T, Holbrook S. Biclustering protein complex interactions with a biclique finding algorithm. ICDM 2006, 178-187.
7. Li H, Li J, Wong L. Discovering motif pairs at interaction sites from protein sequences on a proteome-wide scale. Bioinformatics 2006, 22(8):989-996. 10.1093/bioinformatics/btl020, 16446278.
8. Dietrich B. Some of my favorite integer programming applications at IBM. Annals of Operations Research 2007, 149:75-80.
9. 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 2010, 327(5964):425-431. 10.1126/science.1180823, 20093466.
10. Peeters R. The Maximum edge biclique problem is NP-complete. Discrete Appl Math 2003, 131(3):651-654.
11. Alexe G, Alexe S, Crama Y, Foldes S, Hammer PL, Simeone B. Consensus algorithms for the generation of all maximal bicliques. Discrete Appl Math 2004, 145:11-21.
12. Geva G, Sharan R. Identification of protein complexes from co-immunoprecipitation data. Bioinformatics 2011, 27:111-117. 10.1093/bioinformatics/btq652, 3008648, 21115439.
13. Yan C, Burleigh JG, Eulenstein O. Identifying optimal incomplete phylogenetic data sets from sequence databases. Mol Phylogenet Evol 2005, 35(3):528-535. 10.1016/j.ympev.2005.02.008, 15878123.
14. Wang L. Near optimal solutions for maximum quasi-bicliques. COCOON 2010 2010, 6196:409-418. LNCS.
15. Chang WC, Vakati S, Krause R, Eulenstein O. Mining biological interaction networks using weighted quasi-bicliques. ISBRA 2011 2011, 6674:428-439. LNCS.
16. Gurobi Optimization Inc Gurobi Optimizer 4.5. 2011, Gurobi Optimization Inc.
17. Engel S, Balakrishnan R, Binkley G, Christie K, Costanzo M, Dwight S, Fisk D, Hirschman J, Hitz B, Hong E, et al. Saccharomyces genome database provides mutant phenotype data. Nucleic acids research 2010, 38(suppl 1):D433-D436. 2808950, 19906697.
18. Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-Completeness 1979, New York: W. H. Freeman.
19. Kellerer H, Pferschy U, Pisinger D. Knapsack Problems 2004, Springer.