{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T03:46:37Z","timestamp":1774928797536,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,6,28]],"date-time":"2016-06-28T00:00:00Z","timestamp":1467072000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10479-016-2261-x","type":"journal-article","created":{"date-parts":[[2016,6,28]],"date-time":"2016-06-28T00:39:39Z","timestamp":1467074379000},"page":"781-814","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["New heuristics for the Bicluster Editing Problem"],"prefix":"10.1007","volume":"258","author":[{"given":"Gilberto F.","family":"de Sousa Filho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teobaldo L. Bulh\u00f5es","family":"J\u00fanior","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucidio A. F.","family":"Cabral","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz Satoru","family":"Ochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F\u00e1bio","family":"Protti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"issue":"5","key":"2261_CR1","doi-asserted-by":"crossref","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 Journal on Computing, 41(5), 1110\u20131121.","journal-title":"SIAM Journal on Computing"},{"key":"2261_CR2","unstructured":"Amit, N. (2004). The bicluster graph editing problem. Master\u2019s thesis, Tel Aviv University, Tel Aviv-Yafo."},{"key":"2261_CR3","doi-asserted-by":"crossref","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. Machine Learning, 56, 89\u2013113.","journal-title":"Machine Learning"},{"issue":"Database\u2013Issue","key":"2261_CR4","first-page":"991","volume":"41","author":"T Barrett","year":"2013","unstructured":"Barrett, T., Wilhite, S. E., Ledoux, P., Evangelista, C., Kim, I. F., Tomashevsky, M., et al. (2013). NCBI GEO: Archive for functional genomics data sets\u2014update. Nucleic Acids Research, 41(Database\u2013Issue), 991\u2013995.","journal-title":"Nucleic Acids Research"},{"key":"2261_CR5","unstructured":"Bastos, L. O. (2012). New algorithms and theoretical results for the graph partitioning problem via edge editions (in Portuguese). Ph.D. thesis, Fluminense Federal University, Brazil."},{"key":"2261_CR6","doi-asserted-by":"publisher","unstructured":"Ben-Dor, A., Chor, B., Karp, R., & Yakhini, Z. (2002). Discovering local structure in gene expression data: The order-preserving submatrix problem. In: Proceedings of the sixth annual international conference on computational biology, New York, NY: ACM RECOMB\u201902, pp. 49\u201357. doi:\n                        10.1145\/565196.565203\n                        \n                    .","DOI":"10.1145\/565196.565203"},{"issue":"3 Pt 1","key":"2261_CR7","doi-asserted-by":"crossref","first-page":"031902","DOI":"10.1103\/PhysRevE.67.031902","volume":"67","author":"S Bergmann","year":"2003","unstructured":"Bergmann, S., Ihmels, J., & Barkai, N. (2003). Iterative signature algorithm for the analysis of large-scale gene expression data. Physical Review E, 67(3 Pt 1), 031902.","journal-title":"Physical Review E"},{"key":"2261_CR8","doi-asserted-by":"publisher","unstructured":"Bozda\u011f, D., Parvin, J. D., & Catalyurek, U. V. (2009). A biclustering method to discover co-regulated genes using diverse gene expression datasets. In: Proceedings of the 1st international conference on bioinformatics and computational biology, BICoB\u201909 (pp. 151\u2013163). Berlin, Heidelberg: Springer. doi:\n                        10.1007\/978-3-642-00727-9_16\n                        \n                    .","DOI":"10.1007\/978-3-642-00727-9_16"},{"key":"2261_CR9","unstructured":"Cheng, Y., & Church, G. M. (2000). Biclustering of expression data. In: Proceedings of the eighth international conference on intelligent systems for molecular biology (pp. 93\u2013103). Menlo Park: AAAI Press."},{"key":"2261_CR10","doi-asserted-by":"crossref","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"3","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E. N. (1959). Random graphs. Annals of Mathematical Statistics, 3, 1141\u20131144.","journal-title":"Annals of Mathematical Statistics"},{"key":"2261_CR11","unstructured":"Guo, J., H\u00fcffner, F., Komusiewicz, C., & Zhang, Y. (2008). Improved algorithms for bicluster editing. In: TAMC\u201908\u20145th international conference on theory and applications of models of computation, Lecture Notes in Computer Science, (Vol. 4978, pp. 445\u2013456)."},{"key":"2261_CR12","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., & Moreno Perez, J. (2010). Variable neighbourhood search: Methods and applications. Annals of Operations Research, 175, 367\u2013407.","journal-title":"Annals of Operations Research"},{"key":"2261_CR13","doi-asserted-by":"crossref","unstructured":"Hartigan, J. A. (1972). Direct clustering of a data matrix. Journal of the American Statistical Association, 67(337), 123\u2013129. \n                        http:\/\/www.jstor.org\/stable\/2284710\n                        \n                    .","DOI":"10.1080\/01621459.1972.10481214"},{"key":"2261_CR14","volume-title":"Clustering algorithms","author":"JA Hartigan","year":"1975","unstructured":"Hartigan, J. A. (1975). Clustering algorithms (99th ed.). New York, NY: Wiley.","edition":"99"},{"issue":"12","key":"2261_CR15","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1093\/bioinformatics\/btq227","volume":"26","author":"S Hochreiter","year":"2010","unstructured":"Hochreiter, S., Bodenhofer, U., Heusel, M., Mayr, A., Mitterecker, A., Kasim, A., et al. (2010). FABIA: Factor analysis for bicluster acquisition. Bioinformatics, 26(12), 1520\u20131527.","journal-title":"Bioinformatics"},{"issue":"24","key":"2261_CR16","doi-asserted-by":"crossref","first-page":"3267","DOI":"10.1093\/bioinformatics\/btp588","volume":"25","author":"C Huttenhower","year":"2009","unstructured":"Huttenhower, C., Mutungu, K. T., Indik, N., Yang, W., Schroeder, M., Forman, J., et al. (2009). Detailing regulatory networks through large scale data integration. Bioinformatics, 25(24), 3267\u20133274.","journal-title":"Bioinformatics"},{"key":"2261_CR17","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1101\/gr.648603","volume":"13","author":"Y Kluger","year":"2003","unstructured":"Kluger, Y., Basri, R., Chang, J., & Gerstein, M. (2003). Spectral biclustering of microarray data: Coclustering genes and conditions. Genome Research, 13, 703\u2013716.","journal-title":"Genome Research"},{"key":"2261_CR18","first-page":"61","volume":"12","author":"L Lazzeroni","year":"2000","unstructured":"Lazzeroni, L., & Owen, A. (2000). Plaid models for gene expression data. Statistica Sinica, 12, 61\u201386.","journal-title":"Statistica Sinica"},{"issue":"15","key":"2261_CR19","doi-asserted-by":"crossref","first-page":"e101","DOI":"10.1093\/nar\/gkp491","volume":"37","author":"G Li","year":"2009","unstructured":"Li, G., Ma, Q., Tang, H., Paterson, A. H., & Xu, Y. (2009). QUBIC: A qualitative biclustering algorithm for analyses of gene expression data. Nucleic Acids Research, 37(15), e101.","journal-title":"Nucleic Acids Research"},{"key":"2261_CR20","first-page":"320","volume-title":"Handbook of metaheuristics, international series in operations research and management science","author":"H Loureno","year":"2003","unstructured":"Loureno, H., Martin, O., & Stutzle, T. (2003). Iterated local search. In F. Glover, G. Kochenberger, F. S. Hillier, & C. C. Price (Eds.), Handbook of metaheuristics, international series in operations research and management science (Vol. 57, pp. 320\u2013353). New York: Springer."},{"key":"2261_CR21","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/TCBB.2004.2","volume":"1","author":"SC Madeira","year":"2004","unstructured":"Madeira, S. C., & Oliveira, A. L. (2004). Biclustering algorithms for biological data analysis: A survey. IEEE\/ACM Transactions on Computational Biology and Bioinformatics, 1, 24\u201345.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"2261_CR22","unstructured":"Murali, T. M., & Kasif, S. (2003). Extracting conserved gene expression motifs from gene expression data. In: The Pacific symposium on biocomputing (pp. 77\u201388)."},{"issue":"9","key":"2261_CR23","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1093\/bioinformatics\/btl060","volume":"22","author":"A Preli\u0107","year":"2006","unstructured":"Preli\u0107, A., Bleuler, S., Zimmermann, P., Wille, A., B\u00fchlmann, P., Gruissem, W., et al. (2006). A systematic comparison and evaluation of biclustering methods for gene expression data. Bioinformatics, 22(9), 1122\u20131129. doi:\n                        10.1093\/bioinformatics\/btl060\n                        \n                    .","journal-title":"Bioinformatics"},{"key":"2261_CR24","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00224-007-9032-7","volume":"44","author":"F Protti","year":"2009","unstructured":"Protti, F., da Silva, M. D., & Szwarcfiter, J. L. (2009). Applying modular decomposition to parameterized cluster editing problems. Theory of Computing Systems, 44, 91\u2013104.","journal-title":"Theory of Computing Systems"},{"key":"2261_CR25","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1007\/0-306-48332-7_188","volume-title":"Encyclopedia of Optimization","author":"M Resende","year":"2001","unstructured":"Resende, M. (2001). Greedy randomized adaptive search procedures. In C. A. Floudas & P. M. Pardalos (Eds.), Encyclopedia of Optimization (pp. 913\u2013922). US: Springer."},{"key":"2261_CR26","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., & Tsur, D. (2004). Cluster graph modification problems. Discrete Applied Mathematics, 144, 173\u2013182. doi:\n                        10.1016\/j.dam.2004.01.007\n                        \n                    .","journal-title":"Discrete Applied Mathematics"},{"key":"2261_CR27","doi-asserted-by":"publisher","unstructured":"Subhashini, R., & Kumar, V. J. S. (2010). Evaluating the performance of similarity measures used in document clustering and information retrieval. In: First international conference on Integrated intelligent computing (ICIIC), 2010 (pp. 27\u201331). doi:\n                        10.1109\/ICIIC.2010.42\n                        \n                    .","DOI":"10.1109\/ICIIC.2010.42"},{"issue":"Suppl 7","key":"2261_CR28","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. (2013). BiCluE: exact and heuristic algorithms for weighted bi-cluster editing of biomedical data. BMC Proceedings, 7(Suppl 7), S9. doi:\n                        10.1186\/1753-6561-7-S7-S9\n                        \n                    .","journal-title":"BMC Proceedings"},{"key":"2261_CR29","doi-asserted-by":"publisher","unstructured":"Sun, P., Speicher, N. K., Rttger, R., Guo, J., & Baumbach, J. (2014). Bi-force: large-scale bicluster editing and its application to gene expression data biclustering. Nucleic Acids Research. doi:\n                        10.1093\/nar\/gku201\n                        \n                    .","DOI":"10.1093\/nar\/gku201"},{"key":"2261_CR30","volume-title":"Handbook of computational molecular biology","author":"A Tanay","year":"2006","unstructured":"Tanay, A., Sharan, R., & Shamir, R. (2006). Biclustering algorithms: A survey. In S. Aluru (Ed.), Handbook of computational molecular biology. Boca Raton: Chapman Hall\/CRC Press."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2261-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2261-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2261-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2261-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T12:39:33Z","timestamp":1510835973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2261-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,28]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["2261"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2261-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,28]]}}}