On finding bicliques in bipartite graphs: A novel algorithm and its application to the integration of diverse biological data types

BMC Bioinformatics

Volumn 15, Issue 1, 2014, Pages

  Zhang, Yun ^a   Phillips, Charles A ^b   Rogers, Gary L ^b   Baker, Erich J ^c   Chesler, Elissa J ^d   Langston, Michael A ^b  

^a DUPONT COMPANY   (United States)

^b University of Tennessee   (United States)

^c Baylor University   (United States)

^d JACKSON LABORATORY   (United States)

Author keywords

Biclique; Biclustering; Bioinformatics databases; Bipartite graphs; Graph algorithms

Indexed keywords

ALGORITHMS; BIOINFORMATICS; EXPERIMENTS; GENES; GRAPH THEORY;

BI-CLUSTERING; BICLIQUE; BIOINFORMATICS DATABASE; BIPARTITE GRAPHS; GRAPH ALGORITHMS;

ITERATIVE METHODS;

ALGORITHM; ANIMAL; ARTICLE; COMPUTER GRAPHICS; COMPUTER PROGRAM; GENOMICS; HUMAN; METHODOLOGY; MOUSE; RAT;

ALGORITHMS; ANIMALS; COMPUTER GRAPHICS; GENOMICS; HUMANS; MICE; RATS; SOFTWARE;

EID: 84901610961     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-15-110     Document Type: Article

References (35)

1. Malgrange Y. Recherche des sous-matrices premières d'une matrice à coefficients binaires. Applications à certains problèmes de graphe. Proceedings of the Deuxième Congrès de l'AFCALTI Paris: Gauthier-Villars; 1962.
2. Berry A, Bordat JP, Sigayret A. A local approach to concept generation. Ann Math Artif Intell 2007, 49(1-4):117-136.
3. Kuznetsov SO, Obiedkov S. Comparing performance of algorithms for generating concept lattices. J Exp Theor Artif Intell 2002, 14:189-216.
4. Kaytoue-Uberall M, Duplessis S, Napoli A. Using formal concept analysis for the extraction of groups of co-expressed genes. Modelling, Computation and Optimization in Information Systems and Management Sciences, Volume 14 of Communications in Computer and Information Science 2008, 439-449. Springer Berlin Heidelberg, Le Thi H, Bouvry P, Pham Dinh T.
5. Kaytoue M, Kuznetsovb SO, Napoli A, Duplessis S. Mining gene expression data with pattern structures in formal concept analysis. Inform Sci 2011, 181:1989-2001.
6. Cheng Y, Church GM. Biclustering of expression data. Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology 2000, 93-103. La Jolla: AAAI Press.
7. Tanay A, Sharan R, Shamir R. Discovering statistically significant biclusters in gene expression data. Bioinformatics 2002, 18:S136-S144. 10.1093/bioinformatics/18.suppl_1.S136, 12169541.
8. Wang H, Wang W, Yang J, Yu PS. Clustering by pattern similarity in large data sets. SIGMOD '02: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data 2002, 394-405. Madison: ACM Press.
9. Sanderson MJ, Driskell AC, Ree RH, Eulenstein O, Langley S. Obtaining maximal concatenated phylogenetic data sets from large sequence databases. Mol Biol Evol 2003, 20(7):1036-1042. 10.1093/molbev/msg115, 12777519.
10. Chesler EJ, Langston MA. Combinatorial genetic regulatory network analysis tools for high throughput transcriptomic data. Report 575, University of Tennessee 2006.
11. Baker EJ, Jay J, Philip V, Zhang Y, Li Z, Kirova R, Langston MA, Chesler EJ. Ontological discovery environment: A system for integrating gene-phenotype associations. Genomics 2009, 94(6):377-387. 10.1016/j.ygeno.2009.08.016, 2783409, 19733230.
12. Kirova R, Langston MA, Peng X, Perkins AD, Chesler EJ. A systems genetic analysis of chronic fatigue syndrome: combinatorial data integration from SNPs to differential diagnosis of disease. Proceedings, International Conference for the Critical Assessment of Microarray Data Analysis (CAMDA06) Durham, North Carolina; June 2006.
13. Mushlin RA, Kershenbaum A, Gallagher ST, Rebbeck TR. A graph-theoretical approach for pattern discovery in epidemiological research. IBM Syst J 2007, 46:135-149.
14. Liu J, Wang W. OP-Cluster: clustering by tendency in high dimensional space. ICDM '03: Proceedings of the Third IEEE International Conference on Data Mining 2003, 187-187. Washington, DC: IEEE Computer Society.
15. Garey MR, Johnson DS. Computers and Intractability 1979, New York: W. H. Freeman.
16. Peeters R. The maximum edge biclique problem is NP-complete. Discrete Appl Math 2003, 131(3):651-654.
17. Eppstein D. Arboricity and bipartite subgraph listing algorithms. Inf Process Lett 1994, 51(4):207-211.
18. Makino K, Uno T. New algorithms for enumerating all maximal cliques. Proceedings, 9th Scandinavian Workshop on Algorithm Theory 2004, 260-272. Humlebaek: Springer.
19. Zaki MJ, Ogihara M. Theoretical foundations of association rules. Proceedings, 3rd SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery 1998, Seattle, Washington: ACM.
20. Li J, Li H, Soh D, Wong L. A correspondence between maximal complete bipartite subgraphs and closed patterns. PKDD 2005, 146-156. Berlin Heidelberg: Springer-Verlag.
21. Zaki MJ, Hsiao C. Charm: An efficient algorithm for closed itemset mining. Proceedings, 2nd SIAM International Conference on Data Mining 2002, 398-416. Arlington, Virginia.
22. Wang J, Pei J, Han J. Closet+: Searching for the best strategies for mining frequent closed itemsets. Proceedings, 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2003, 236-245. Washington, DC.
23. Grahne G, Zhu J. Efficiently using prefix-trees in mining frequent itemsets. Proceedings, FIMI'03: Workshop on Frequent Itemset Mining Implementations 2003, Melbourne, Florida: CEUR-WS.org.
24. Zhu J, Grahne G. Reducing the main memory consumptions of FPmax* and FPclose. Proceedings, FIMI'04: Workshop on Frequent Itemset Mining Implementations Brighton, UK, November 2004.
25. Uno T, Kiyomi M, Arimura H. LCM ver.2: Efficient mining algorithms for frequent/closed/maximal itemsets. Proceedings, FIMI'04: Workshop on Frequent Itemset Mining Implementations 2004, Brighton, UK: CEUR-WS.org.
26. Li J, Liu G, Li H, Wong L. Maximal Biclique subgraphs and closed pattern pairs of the adjacency matrix: a one-to-one correspondence and mining algorithms. IEEE Trans Knowl Data Eng 2007, 19(12):1625-1637.
27. 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.
28. Liu G, Sim K, Li J. Efficient mining of large maximal Bicliques. The 8th International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2006) 2006, 437-448. Krakow, Poland.
29. Bron C, Kerbosch J. Algorithm 457: finding all cliques of an undirected graph. Commun ACM 1973, 16(9):575-577.
30. Tomita E, Tanaka A, Takahashi H. The worst-case time complexity for generating all maximal cliques and computational experiments. Theor Comput Sci 2006, 363:28-42.
31. Johnson DS, Papadimitriou CH. On generating all maximal independent sets. Inform Process Lett 1988, 27(3):119-123.
32. Chesler E, Wang J, Lu L, Qu Y, Manly K, Williams RW. Genetic correlates of gene expression in recombinant inbred strains: a relational model system to explore neurobehavioral phenotypes. Neuroinformatics 2003, 1(4):343-357. 10.1385/NI:1:4:343, 15043220.
33. Kreek M, Nielsen D, LaForge K. Genes associated with addiction: alcoholism, opiate, and cocaine addiction. Neuromolecular Med 2004, 5:85-108. 10.1385/NMM:5:1:085, 15001815.
34. Albertson D, Schmidt C, Kapatos G, Bannon M. Distinctive profiles of gene expression in the human nucleus accumbens associated with cocaine and heroin abuse. Neuropsychopharmacology 2006, 31(10):2304-2312. 2239258, 16710320.
35. Mash D, Ffrench-Mullen J, Adi N, Qin Y, Buck A, Pablo J. Gene expression in human hippocampus from cocaine abusers identifies genes which regulate extracellular matrix remodeling. PLoS ONE 2007, 2(11):e1187. 10.1371/journal.pone.0001187, 2063513, 18000554.