Biclique: an R package for maximal biclique enumeration in bipartite graphs

被引:10
|
作者
Lu, Yuping [1 ]
Phillips, Charles A. [2 ]
Langston, Michael A. [2 ]
机构
[1] Lawrence Berkeley Natl Lab, Berkeley, CA 94720 USA
[2] Univ Tennessee, Dept Elect Engn & Comp Sci, Knoxville, TN 37996 USA
基金
美国国家卫生研究院;
关键词
Biclique; Bipartite graph; Graph algorithms; Maximality; R package;
D O I
10.1186/s13104-020-04955-0
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
ObjectiveBipartite graphs are widely used to model relationships between pairs of heterogeneous data types. Maximal bicliques are foundational structures in such graphs, and their enumeration is an important task in systems biology, epidemiology and many other problem domains. Thus, there is a need for an efficient, general purpose, publicly available tool to enumerate maximal bicliques in bipartite graphs. The statistical programming language R is a logical choice for such a tool, but until now no R package has existed for this purpose. Our objective is to provide such a package, so that the research community can more easily perform this computationally demanding task.ResultsBiclique is an R package that takes as input a bipartite graph and produces a listing of all maximal bicliques in this graph. Input and output formats are straightforward, with examples provided both in this paper and in the package documentation. Biclique employs a state-of-the-art algorithm previously developed for basic research in functional genomics. This package, along with its source code and reference manual, are freely available from the CRAN public repository at https://cran.r-project.org/web/packages/biclique/index.html.
引用
收藏
页数:5
相关论文
共 50 条
  • [1] Biclique: an R package for maximal biclique enumeration in bipartite graphs
    Yuping Lu
    Charles A. Phillips
    Michael A. Langston
    [J]. BMC Research Notes, 13
  • [2] Maximal Balanced Signed Biclique Enumeration in Signed Bipartite Graphs
    Sun, Renjie
    Wu, Yanping
    Chen, Chen
    Wang, Xiaoyang
    Zhang, Wenjie
    Lin, Xuemin
    [J]. 2022 IEEE 38TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2022), 2022, : 1887 - 1899
  • [3] Efficient Maximal Biclique Enumeration on Large Signed Bipartite Graphs
    Wang, Jianhua
    Yang, Jianye
    Gu, Zhaoquan
    Ouyang, Dian
    Tian, Zhihong
    Lin, Xuemin
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (09) : 4618 - 4631
  • [4] Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs
    Chen, Lu
    Liu, Chengfei
    Zhou, Rui
    Xu, Jiajie
    Li, Jianxin
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2022, 15 (08): : 1559 - 1571
  • [5] Efficient Maximal Biclique Enumeration on Large Uncertain Bipartite Graphs
    Wang, Jianhua
    Yang, Jianye
    Ma, Ziyi
    Zhang, Chengyuan
    Yang, Shiyu
    Zhang, Wenjie
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (12) : 12634 - 12648
  • [6] Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
    Eguia, Martiniano
    Soulignac, Francisco J.
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2013, 15 (01): : 55 - 74
  • [7] AMBEA: Aggressive Maximal Biclique Enumeration in Large Bipartite Graph Computing
    Pan, Zhe
    Li, Xu
    He, Shuibing
    Zhang, Xuechen
    Wang, Rui
    Gao, Yunjun
    Chen, Gang
    Sun, Xian-He
    [J]. IEEE Transactions on Computers, 2024, 73 (12) : 2664 - 2677
  • [8] (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs
    Yang, Jianye
    Peng, Yun
    Zhang, Wenjie
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2021, 15 (02): : 141 - 153
  • [9] (p,q)-biclique counting and enumeration for large sparse bipartite graphs
    Yang, Jianye
    Peng, Yun
    Ouyang, Dian
    Zhang, Wenjie
    Lin, Xuemin
    Zhao, Xiang
    [J]. VLDB JOURNAL, 2023, 32 (05): : 1137 - 1161
  • [10] (p,q)-biclique counting and enumeration for large sparse bipartite graphs
    Jianye Yang
    Yun Peng
    Dian Ouyang
    Wenjie Zhang
    Xuemin Lin
    Xiang Zhao
    [J]. The VLDB Journal, 2023, 32 : 1137 - 1161