{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T22:56:57Z","timestamp":1754261817937,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100019782","name":"North South University","doi-asserted-by":"publisher","award":["CTRG-20\/SEPS\/19"],"award-info":[{"award-number":["CTRG-20\/SEPS\/19"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100019782","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,25]]},"DOI":"10.1145\/3637528.3672066","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T04:54:55Z","timestamp":1724561695000},"page":"2479-2490","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Fast Exact Algorithm to Enumerate Maximal Pseudo-cliques in Large Sparse Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2049-3178","authenticated-orcid":false,"given":"Ahsanur","family":"Rahman","sequence":"first","affiliation":[{"name":"North South University, Dhaka, Bangladesh"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4915-2169","authenticated-orcid":false,"given":"Kalyan","family":"Roy","sequence":"additional","affiliation":[{"name":"North South University, Dhaka, Bangladesh"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0883-8812","authenticated-orcid":false,"given":"Ramiza","family":"Maliha","sequence":"additional","affiliation":[{"name":"North South University, Dhaka, Bangladesh"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1780-6046","authenticated-orcid":false,"given":"Townim Faisal","family":"Chowdhury","sequence":"additional","affiliation":[{"name":"Australian Institute for Machine Learning, University of Adelaide, Adelaide, Australia"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"key":"e_1_3_2_2_1_1","series-title":"Lecture Notes in Computer Science","volume-title":"Massive quasi-clique detection","author":"Abello James","unstructured":"James Abello, Mauricio G.C. Resende, and Sandra Sudarsky. 2002. Massive quasi-clique detection. In Lecture Notes in Computer Science, Vol. 2286. Springer, 598--612."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Mohammad Arifuzzaman Maki Maeda Aya Itoh Kensaku Nishikata Chiharu Takita Rintaro Saito Takeshi Ara Kenji Nakahigashi Hsuan-Cheng Huang Aki Hirai et al. 2006. Large-scale identification of protein--protein interaction of Escherichia coli K-12. Genome research 16 5 (2006) 686--691.","DOI":"10.1101\/gr.4527806"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00026-N"},{"key":"e_1_3_2_2_4_1","volume-title":"Emergence of scaling in random networks. Science","author":"Barab\u00e1si Albert L\u00e1szl\u00f3","year":"1999","unstructured":"Albert L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. Science (1999)."},{"key":"e_1_3_2_2_5_1","volume-title":"CoRR cs.DS\/0310049","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. CoRR cs.DS\/0310049 (2003)."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICAIS.2009.39"},{"key":"e_1_3_2_2_7_1","series-title":"Lecture Notes in Computer Science","volume-title":"Pushing tougher constraints in frequent pattern mining","author":"Bonchi Francesco","unstructured":"Francesco Bonchi and Claudio Lucchese. 2005. Pushing tougher constraints in frequent pattern mining. In Lecture Notes in Computer Science. Springer, 114--124."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0132-x"},{"key":"e_1_3_2_2_9_1","series-title":"Lecture Notes in Computer Science","volume-title":"On effectively finding maximal quasi-cliques in graphs","author":"Brunato Mauro","unstructured":"Mauro Brunato, Holger H. Hoos, and Roberto Battiti. 2008. On effectively finding maximal quasi-cliques in graphs. In Lecture Notes in Computer Science, Vol. 5313 LNCS. 41--55."},{"key":"e_1_3_2_2_10_1","volume-title":"Better bitmap performance with roaring bitmaps. Software: practice and experience 46, 5","author":"Chambi Samy","year":"2016","unstructured":"Samy Chambi, Daniel Lemire, Owen Kaser, and Robert Godin. 2016. Better bitmap performance with roaring bitmaps. Software: practice and experience 46, 5 (2016), 709--719."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17455"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.271"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbaa288"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jgeb.2017.10.010"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Steve Harenberg Gonzalo Bello L. Gjeltema Stephen Ranshous Jitendra Harlalka Ramona Seay Kanchana Padmanabhan and Nagiza Samatova. 2014. Community detection in large-scale networks: A survey and empirical evaluation. 426--439 pages.","DOI":"10.1002\/wics.1319"},{"volume-title":"Proceedings of the 26th International Conference on World Wide Web. IW3C2, 441--449","author":"Jain Shweta","key":"e_1_3_2_2_17_1","unstructured":"Shweta Jain and C. Seshadhri. 2017. A Fast and Provable Method for Estimating Clique Counts Using Tur\u00e1n's Theorem. In Proceedings of the 26th International Conference on World Wide Web. IW3C2, 441--449."},{"key":"e_1_3_2_2_18_1","volume-title":"Proceedings of The Web Conference 2020 (WWW '20). 1966","author":"Jain Shweta","year":"1976","unstructured":"Shweta Jain and C. Seshadhri. 2020. Provably and Efficiently Approximating Near-cliques using the Tur\u00e1n Shadow: PEANUTS. In Proceedings of The Web Conference 2020 (WWW '20). 1966--1976."},{"key":"e_1_3_2_2_19_1","volume-title":"Aur\u00e9lien Naldi, Christopher J Mungall, Jeffrey M Yunes, Olga Botvinnik, Mark Weigel, et al.","author":"Klopfenstein DV","year":"2018","unstructured":"DV Klopfenstein, Liangsheng Zhang, Brent S Pedersen, Fidel Ram\u00edrez, Alex Warwick Vesztrocy, Aur\u00e9lien Naldi, Christopher J Mungall, Jeffrey M Yunes, Olga Botvinnik, Mark Weigel, et al. 2018. GOATOOLS: A Python library for Gene Ontology analyses. Scientific reports 8, 1 (2018), 10872."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.04.029"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20086-6_7"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.15252\/msb.20209503"},{"volume-title":"A Survey of Algorithms for Dense Subgraph Discovery","author":"Lee Victor E.","key":"e_1_3_2_2_23_1","unstructured":"Victor E. Lee, Ning Ruan, Ruoming Jin, and Charu Aggarwal. 2010. A Survey of Algorithms for Dense Subgraph Discovery. Springer, 303--336."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45151-X"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.schres.2018.05.015"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq514"},{"key":"e_1_3_2_2_27_1","volume-title":"GAGE: generally applicable gene set enrichment for pathway analysis. BMC bioinformatics 10","author":"Luo Weijun","year":"2009","unstructured":"Weijun Luo, Michael S Friedman, Kerby Shedden, Kurt D Hankenson, and Peter J Woolf. 2009. GAGE: generally applicable gene set enrichment for pathway analysis. BMC bioinformatics 10 (2009), 1--17."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2017.0037"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-012-1242-y"},{"key":"e_1_3_2_2_30_1","volume-title":"LP-based dual bounds for the maximum quasi-clique problem. Discrete Applied Mathematics","author":"Marinelli Fabrizio","year":"2020","unstructured":"Fabrizio Marinelli, Andrea Pizzuti, and Fabrizio Rossi. 2020. LP-based dual bounds for the maximum quasi-clique problem. Discrete Applied Mathematics (2020)."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783385"},{"key":"e_1_3_2_2_33_1","volume-title":"Detecting overlapping protein complexes in protein-protein interaction networks. Nature Methods","author":"Nepusz Tam\u00e1s","year":"2012","unstructured":"Tam\u00e1s Nepusz, Haiyuan Yu, and Alberto Paccanaro. 2012. Detecting overlapping protein complexes in protein-protein interaction networks. Nature Methods (2012)."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21791"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.07.019"},{"key":"e_1_3_2_2_36_1","volume-title":"Proceedings - International Conference on Data Engineering","author":"Pei Jian","year":"2001","unstructured":"Jian Pei, Jiawei Han, and Laks V.S. Lakshmanan. 2001. Mining frequent itemsets with convertible constraints. Proceedings - International Conference on Data Engineering (2001), 433--442,."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783299"},{"volume-title":"Proceedings of the 2016 SIAM International Conference on Data Mining. SIAM, 504--512","author":"Rahman Ahsanur","key":"e_1_3_2_2_38_1","unstructured":"Ahsanur Rahman, Steve T. K. Jan, Hyunju Kim, B. Aditya Prakash, and T. M. Murali. 2016. Unstable Communities in Network Ensembles. In Proceedings of the 2016 SIAM International Conference on Data Mining. SIAM, 504--512."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Seesandra V Rajagopala Patricia Sikorski Ashwani Kumar Roberto Mosca James Vlasblom Roland Arnold Jonathan Franca-Koh Suman B Pakala Sadhna Phanse Arnaud Ceol et al. 2014. The binary protein-protein interaction landscape of Escherichia coli. Nature biotechnology 32 3 (2014) 285--290.","DOI":"10.1038\/nbt.2831"},{"volume-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. 4292 -- 4293","author":"Ryan","key":"e_1_3_2_2_40_1","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. 2015. The network data repository with interactive graph analytics and visualization. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. 4292 -- 4293."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622352"},{"key":"e_1_3_2_2_42_1","volume-title":"Vassilios Ioannidis, and R\u00e9my Bruggmann.","author":"Simillion Cedric","year":"2017","unstructured":"Cedric Simillion, Robin Liechti, Heidi EL Lischer, Vassilios Ioannidis, and R\u00e9my Bruggmann. 2017. Avoiding the pitfalls of gene set enrichment analysis with SetRank. BMC bioinformatics 18, 1 (2017), 1--14."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw488"},{"volume-title":"Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 104--112","author":"Tsourakakis Charalampos E.","key":"e_1_3_2_2_44_1","unstructured":"Charalampos E. Tsourakakis, Francesco Bonchi, Aristides Gionis, Francesco Gullo, and Maria A. Tsiarli. 2013. Denser than the densest subgraph: Extracting optimal quasi-cliques with quality guarantees. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 104--112."},{"key":"e_1_3_2_2_45_1","first-page":"3","article-title":"An efficient algorithm for solving pseudo clique enumeration problem","volume":"56","author":"Uno Takeaki","year":"2010","unstructured":"Takeaki Uno. 2010. An efficient algorithm for solving pseudo clique enumeration problem. Algorithmica (New York) 56, 1 (2010), 3--16.","journal-title":"Algorithmica (New York)"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9804-y"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1970"},{"key":"e_1_3_2_2_48_1","volume-title":"Complex networks: small-world, scale-free and beyond","author":"Wang Xiao Fan","year":"2003","unstructured":"Xiao Fan Wang and Guanrong Chen. 2003. Complex networks: small-world, scale-free and beyond. IEEE circuits and systems magazine 3, 1 (2003), 6--20."},{"key":"e_1_3_2_2_49_1","volume-title":"Collective dynamics of ?smallworld'networks. nature 393, 6684","author":"Watts Duncan J","year":"1998","unstructured":"Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of ?smallworld'networks. nature 393, 6684 (1998), 440--442."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ygeno.2020.06.017"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3617331"},{"key":"e_1_3_2_2_52_1","volume-title":"GOEAST: a web-based software toolkit for Gene Ontology enrichment analysis. Nucleic acids research 36, suppl_2","author":"Zheng Qi","year":"2008","unstructured":"Qi Zheng and Xiu-Jie Wang. 2008. GOEAST: a web-based software toolkit for Gene Ontology enrichment analysis. Nucleic acids research 36, suppl_2 (2008), W358--W363."}],"event":{"name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Barcelona Spain","acronym":"KDD '24"},"container-title":["Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3672066","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3672066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:23Z","timestamp":1750291463000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3672066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":51,"alternative-id":["10.1145\/3637528.3672066","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3672066","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}