{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:48:13Z","timestamp":1770994093866,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030581497","type":"print"},{"value":"9783030581503","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_47","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"578-590","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Even Better Fixed-Parameter Algorithms for Bicluster Editing"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Lafond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"issue":"5","key":"47_CR1","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1137\/110848712","volume":"41","author":"N Ailon","year":"2012","unstructured":"Ailon, N., Avigdor-Elgrabli, N., Liberty, E., Van Zuylen, A.: Improved approximation algorithms for bipartite correlation clustering. SIAM J. Comput. 41(5), 1110\u20131121 (2012)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"47_CR2","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1101\/gr.243212.118","volume":"29","author":"AM Altenhoff","year":"2019","unstructured":"Altenhoff, A.M., et al.: Oma standalone: orthology inference among public and custom genomes and transcriptomes. Genome Res. 29(7), 1152\u20131163 (2019)","journal-title":"Genome Res."},{"key":"47_CR3","unstructured":"Amit, N.: The bicluster graph editing problem. Ph.D. thesis, Tel Aviv University (2004)"},{"issue":"1\u20133","key":"47_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1\u20133), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"issue":"6","key":"47_CR5","doi-asserted-by":"publisher","first-page":"066102","DOI":"10.1103\/PhysRevE.76.066102","volume":"76","author":"MJ Barber","year":"2007","unstructured":"Barber, M.J.: Modularity and community detection in bipartite networks. Phys. Rev. E 76(6), 066102 (2007)","journal-title":"Phys. Rev. E"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jda.2012.04.005","volume":"16","author":"S B\u00f6cker","year":"2012","unstructured":"B\u00f6cker, S.: A golden ratio parameterized algorithm for cluster editing. J. Discret. Algorithms 16, 79\u201389 (2012)","journal-title":"J. Discret. Algorithms"},{"key":"47_CR7","unstructured":"Cheng, Y., Church, G.M.: Biclustering of expression data. In: ISMB, vol. 8, pp. 93\u2013103 (2000)"},{"key":"47_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-030-25027-0_17","volume-title":"Fundamentals of Computation Theory","author":"R Dondi","year":"2019","unstructured":"Dondi, R., Lafond, M.: On the tractability of covering a graph with 2-clubs. In: Gasieniec, L.A., Jansson, J., Levcopoulos, C. (eds.) FCT 2019. LNCS, vol. 11651, pp. 243\u2013257. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25027-0_17"},{"key":"47_CR9","unstructured":"Drange, P.G., Reidl, F., Villaamil, F.S., Sikdar, S.: Fast biclustering by dual parameterization. arXiv preprint arXiv:1507.08158 (2015)"},{"key":"47_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-44849-7_17","volume-title":"Algorithms and Complexity","author":"J Gramm","year":"2003","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-modeled data clustering: fixed-parameter algorithms for clique generation. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol. 2653, pp. 108\u2013119. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44849-7_17"},{"issue":"4","key":"47_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00453-004-1090-5","volume":"39","author":"J Gramm","year":"2004","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica 39(4), 321\u2013347 (2004)","journal-title":"Algorithmica"},{"key":"47_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-540-79228-4_39","volume-title":"Theory and Applications of Models of Computation","author":"J Guo","year":"2008","unstructured":"Guo, J., H\u00fcffner, F., Komusiewicz, C., Zhang, Y.: Improved algorithms for bicluster editing. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 445\u2013456. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79228-4_39"},{"key":"47_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.dam.2014.11.026","volume":"185","author":"S Hartung","year":"2015","unstructured":"Hartung, S., Komusiewicz, C., Nichterlein, A., Such\u1ef3, O.: On structural parameterizations for the 2-club problem. Discret. Appl. Math. 185, 79\u201392 (2015)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"47_CR14","doi-asserted-by":"publisher","first-page":"016107","DOI":"10.1103\/PhysRevE.83.016107","volume":"83","author":"B Karrer","year":"2011","unstructured":"Karrer, B., Newman, M.E.: Stochastic blockmodels and community structure in networks. Phys. Rev. E 83(1), 016107 (2011)","journal-title":"Phys. Rev. E"},{"issue":"15","key":"47_CR15","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1016\/j.dam.2012.05.019","volume":"160","author":"C Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Uhlmann, J.: Cluster editing with locally bounded modifications. Discret. Appl. Math. 160(15), 2259\u20132270 (2012)","journal-title":"Discret. Appl. Math."},{"issue":"13","key":"47_CR16","doi-asserted-by":"publisher","first-page":"i366","DOI":"10.1093\/bioinformatics\/bty242","volume":"34","author":"M Lafond","year":"2018","unstructured":"Lafond, M., Meghdari Miardan, M., Sankoff, D.: Accurate prediction of orthologs in the presence of divergence after duplication. Bioinformatics 34(13), i366\u2013i375 (2018)","journal-title":"Bioinformatics"},{"key":"47_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-29700-7_22","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"H Liu","year":"2012","unstructured":"Liu, H., Zhang, P., Zhu, D.: On editing graphs into 2-club clusters. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM\/FAW -2012. LNCS, vol. 7285, pp. 235\u2013246. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29700-7_22"},{"issue":"1","key":"47_CR18","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"SC Madeira","year":"2004","unstructured":"Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis: a survey. IEEE\/ACM Trans. Comput. Biol. Bioinform. 1(1), 24\u201345 (2004)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"2","key":"47_CR19","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"47_CR20","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/j.ejor.2016.05.010","volume":"254","author":"RG Pinheiro","year":"2016","unstructured":"Pinheiro, R.G., Martins, I.C., Protti, F., Ochi, L.S., Simonetti, L.G., Subramanian, A.: On solving manufacturing cell formation via bicluster editing. Eur. J. Oper. Res. 254(3), 769\u2013779 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"47_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11847250_1","volume-title":"Parameterized and Exact Computation","author":"F Protti","year":"2006","unstructured":"Protti, F., da Silva, M.D., Szwarcfiter, J.L.: Applying modular decomposition to parameterized bicluster editing. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 1\u201312. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11847250_1"},{"issue":"4","key":"47_CR22","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proc. Nat. Acad. Sci. 105(4), 1118\u20131123 (2008)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"47_CR23","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.endm.2012.10.006","volume":"39","author":"GF de Sousa Filho","year":"2012","unstructured":"de Sousa Filho, G.F., Lucidio dos Anjos, F.C., Ochi, L.S., Protti, F.: Hybrid metaheuristic for bicluster editing problem. Electron. Notes Discret. Math. 39, 35\u201342 (2012)","journal-title":"Electron. Notes Discret. Math."},{"issue":"2","key":"47_CR24","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s10479-016-2261-x","volume":"258","author":"GF de Sousa Filho","year":"2017","unstructured":"de Sousa Filho, G.F., J\u00fanior, T.L.B., Cabral, L.A., Ochi, L.S., Protti, F.: New heuristics for the bicluster editing problem. Ann. Oper. Res. 258(2), 781\u2013814 (2017)","journal-title":"Ann. Oper. Res."},{"key":"47_CR25","doi-asserted-by":"publisher","first-page":"S9","DOI":"10.1186\/1753-6561-7-S7-S9","volume":"7","author":"P Sun","year":"2013","unstructured":"Sun, P., Guo, J., Baumbach, J.: Biclue-exact and heuristic algorithms for weighted bi-cluster editing of biomedical data. BMC Proc. 7, S9 (2013). https:\/\/doi.org\/10.1186\/1753-6561-7-S7-S9","journal-title":"BMC Proc."},{"key":"47_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-319-08783-2_14","volume-title":"Computing and Combinatorics","author":"P Sun","year":"2014","unstructured":"Sun, P., Guo, J., Baumbach, J.: Complexity of dense bicluster editing problems. In: Cai, Z., Zelikovsky, A., Bourgeois, A. (eds.) COCOON 2014. LNCS, vol. 8591, pp. 154\u2013165. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08783-2_14"},{"key":"47_CR27","doi-asserted-by":"crossref","unstructured":"Tanay, A., Sharan, R., Shamir, R.: Biclustering algorithms: a survey. In: Handbook of Computational Molecular Biology, vol. 9, no. 1\u201320, pp. 122\u2013124 (2005)","DOI":"10.1201\/9781420036275.ch26"},{"issue":"3","key":"47_CR28","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1287\/moor.1090.0385","volume":"34","author":"A Van Zuylen","year":"2009","unstructured":"Van Zuylen, A., Williamson, D.P.: Deterministic pivoting algorithms for constrained ranking and clustering problems. Math. Oper. Res. 34(3), 594\u2013620 (2009)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:43:00Z","timestamp":1619242980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}