{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:46:51Z","timestamp":1770994011163,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10878-024-01186-y","type":"journal-article","created":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T18:02:22Z","timestamp":1720029742000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved kernelization and fixed-parameter algorithms for bicluster editing"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5305-7372","authenticated-orcid":false,"given":"Manuel","family":"Lafond","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"issue":"5","key":"1186_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 (2012) Improved approximation algorithms for bipartite correlation clustering. SIAM J Comput 41(5):1110\u20131121","journal-title":"SIAM J Comput"},{"issue":"7","key":"1186_CR2","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1101\/gr.243212.118","volume":"29","author":"AM Altenhoff","year":"2019","unstructured":"Altenhoff AM, Levy J, Zarowiecki M, Tomiczek B, Vesztrocy AW, Dalquen DA, M\u00fcller S, Telford MJ, Glover NM, Dylus D et al (2019) Oma standalone: orthology inference among public and custom genomes and transcriptomes. Genome Res 29(7):1152\u20131163","journal-title":"Genome Res"},{"key":"1186_CR3","unstructured":"Amit N (2004) The bicluster graph editing problem. Ph.D. thesis, Tel Aviv University"},{"issue":"1\u20133","key":"1186_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 (2004) Correlation clustering. Mach Learn 56(1\u20133):89\u2013113","journal-title":"Mach Learn"},{"issue":"6","key":"1186_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.066102","volume":"76","author":"MJ Barber","year":"2007","unstructured":"Barber MJ (2007) Modularity and community detection in bipartite networks. Phys Rev E 76(6):066102","journal-title":"Phys Rev E"},{"key":"1186_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 (2012) A golden ratio parameterized algorithm for cluster editing. J Discrete Algorithm 16:79\u201389","journal-title":"J Discrete Algorithm"},{"key":"1186_CR7","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/s00453-011-9595-1","volume":"64","author":"Y Cao","year":"2012","unstructured":"Cao Y, Chen J (2012) Cluster editing: Kernelization based on edge cuts. Algorithmica 64:152\u2013169","journal-title":"Algorithmica"},{"issue":"1","key":"1186_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.jcss.2011.04.001","volume":"78","author":"J Chen","year":"2012","unstructured":"Chen J, Meng J (2012) A 2k kernel for the cluster editing problem. J Comput Syst Sci 78(1):211\u2013220","journal-title":"J Comput Syst Sci"},{"key":"1186_CR9","unstructured":"Cheng Y, Church GM (2000) Biclustering of expression data. In: Ismb, vol 8, pp 93\u2013103"},{"key":"1186_CR10","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 GF, Lucidio dos Anjos FC, Ochi LS, Protti F (2012) Hybrid metaheuristic for bicluster editing problem. Electron Notes Discrete Math 39:35\u201342","journal-title":"Electron Notes Discrete Math"},{"issue":"2","key":"1186_CR11","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 GF, J\u00fanior TLB, Cabral LA, Ochi LS, Protti F (2017) New heuristics for the bicluster editing problem. Ann Oper Res 258(2):781\u2013814","journal-title":"Ann Oper Res"},{"issue":"4","key":"1186_CR12","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1007\/s00453-022-01062-3","volume":"85","author":"R Dondi","year":"2023","unstructured":"Dondi R, Lafond M (2023) On the tractability of covering a graph with 2-clubs. Algorithmica 85(4):992\u20131028","journal-title":"Algorithmica"},{"key":"1186_CR13","unstructured":"Drange PG, Reidl F, S\u00e1nchez\u00a0Villaamil F, Sikdar S (215) Fast biclustering by dual parameterization. In: 10th International symposium on parameterized and exact computation (IPEC 2015), vol\u00a043, pp 402\u2013413"},{"key":"1186_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact exponential algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin FV, Kratsch D (2010) Exact exponential algorithms. Springer, Berlin"},{"key":"1186_CR15","doi-asserted-by":"crossref","unstructured":"Gnatyshak D, Ignatov DI, Semenov A, Poelmans J (2012) Gaining insight in social networks with biclustering and triclustering. In: Proceedings of perspectives in business informatics research: 11th international conference, BIR 2012, Nizhny Novgorod, Russia, September 24\u201326. Springer, pp 162\u2013171","DOI":"10.1007\/978-3-642-33281-4_13"},{"issue":"4","key":"1186_CR16","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 (2004) Automated generation of search tree algorithms for hard graph modification problems. Algorithmica 39(4):321\u2013347","journal-title":"Algorithmica"},{"key":"1186_CR17","doi-asserted-by":"crossref","unstructured":"Gramm J, Guo J, H\u00fcffner F, Niedermeier R (2003) Graph-modeled data clustering: fixed-parameter algorithms for clique generation. In: Italian conference on algorithms and complexity, pp 108\u2013119. Springer","DOI":"10.1007\/3-540-44849-7_17"},{"key":"1186_CR18","doi-asserted-by":"crossref","unstructured":"Guo J, H\u00fcffner F, Komusiewicz C, Zhang Y (2008) Improved algorithms for bicluster editing. In: International conference on theory and applications of models of computation. Springer, pp 445\u2013456","DOI":"10.1007\/978-3-540-79228-4_39"},{"key":"1186_CR19","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 (2015) On structural parameterizations for the 2-club problem. Discret Appl Math 185:79\u201392","journal-title":"Discret Appl Math"},{"issue":"1","key":"1186_CR20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.016107","volume":"83","author":"B Karrer","year":"2011","unstructured":"Karrer B, Newman ME (2011) Stochastic blockmodels and community structure in networks. Phys Rev E 83(1):016107","journal-title":"Phys Rev E"},{"issue":"15","key":"1186_CR21","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 (2012) Cluster editing with locally bounded modifications. Discret Appl Math 160(15):2259\u20132270","journal-title":"Discret Appl Math"},{"key":"1186_CR22","doi-asserted-by":"crossref","unstructured":"Lafond M (2020) Even better fixed-parameter algorithms for bicluster editing. In: Proceedings of computing and combinatorics: 26th international conference, COCOON 2020, Atlanta, GA, USA, August 29\u201331. Springer, pp 578\u2013590","DOI":"10.1007\/978-3-030-58150-3_47"},{"issue":"13","key":"1186_CR23","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 (2018) Accurate prediction of orthologs in the presence of divergence after duplication. Bioinformatics 34(13):i366\u2013i375","journal-title":"Bioinformatics"},{"key":"1186_CR24","doi-asserted-by":"crossref","unstructured":"Liu H, Zhang P, Zhu D (2012) On editing graphs into 2-club clusters. In: Frontiers in algorithmics and algorithmic aspects in information and management, pp 235\u2013246. Springer","DOI":"10.1007\/978-3-642-29700-7_22"},{"issue":"1","key":"1186_CR25","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"SC Madeira","year":"2004","unstructured":"Madeira SC, Oliveira AL (2004) Biclustering algorithms for biological data analysis: a survey. IEEE\/ACM Trans Comput Biol Bioinf 1(1):24\u201345","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"issue":"2","key":"1186_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113","journal-title":"Phys Rev E"},{"issue":"3","key":"1186_CR27","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/j.ejor.2016.05.010","volume":"254","author":"RG Pinheiro","year":"2016","unstructured":"Pinheiro RG, Martins IC, Protti F, Ochi LS, Simonetti LG, Subramanian A (2016) On solving manufacturing cell formation via bicluster editing. Eur J Oper Res 254(3):769\u2013779","journal-title":"Eur J Oper Res"},{"key":"1186_CR28","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.jbi.2015.06.028","volume":"57","author":"B Pontes","year":"2015","unstructured":"Pontes B, Gir\u00e1ldez R, Aguilar-Ruiz JS (2015) Biclustering on expression data: a review. J Biomed Inform 57:163\u2013180","journal-title":"J Biomed Inform"},{"key":"1186_CR29","doi-asserted-by":"crossref","unstructured":"Protti F, da\u00a0Silva MD, Szwarcfiter JL (2006) Applying modular decomposition to parameterized bicluster editing. In: International workshop on parameterized and exact computation. Springer, pp 1\u201312","DOI":"10.1007\/11847250_1"},{"issue":"4","key":"1186_CR30","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118\u20131123","journal-title":"Proc Natl Acad Sci"},{"key":"1186_CR31","doi-asserted-by":"crossref","unstructured":"Sun P, Guo J, Baumbach J (2013) Biclue-exact and heuristic algorithms for weighted bi-cluster editing of biomedical data. In: BMC proceedings, vol\u00a07, p\u00a0S9. Springer","DOI":"10.1186\/1753-6561-7-S7-S9"},{"key":"1186_CR32","doi-asserted-by":"crossref","unstructured":"Sun P, Guo J, Baumbach J (2014) Complexity of dense bicluster editing problems. In: International computing and combinatorics conference, pp 154\u2013165. Springer","DOI":"10.1007\/978-3-319-08783-2_14"},{"issue":"1\u201320","key":"1186_CR33","first-page":"122","volume":"9","author":"A Tanay","year":"2005","unstructured":"Tanay A, Sharan R, Shamir R (2005) Biclustering algorithms: a survey. Handbook Comput Mole Biol 9(1\u201320):122\u2013124","journal-title":"Handbook Comput Mole Biol"},{"key":"1186_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106095","volume":"168","author":"D Tsur","year":"2021","unstructured":"Tsur D (2021) Faster parameterized algorithm for bicluster editing. Inf Process Lett 168:106095","journal-title":"Inf Process Lett"},{"key":"1186_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.113796","volume":"953","author":"D Tsur","year":"2023","unstructured":"Tsur D (2023) Faster parameterized algorithms for bicluster editing and flip consensus tree. Theoret Comput Sci 953:113796","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"1186_CR36","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 DP (2009) Deterministic pivoting algorithms for constrained ranking and clustering problems. Math Oper Res 34(3):594\u2013620","journal-title":"Math Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01186-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01186-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01186-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T14:42:07Z","timestamp":1721659327000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01186-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1186"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01186-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"24 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"90"}}