{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:45Z","timestamp":1759637925122},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,5,30]],"date-time":"2012-05-30T00:00:00Z","timestamp":1338336000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s00224-012-9388-1","type":"journal-article","created":{"date-parts":[[2012,7,7]],"date-time":"2012-07-07T16:01:19Z","timestamp":1341676879000},"page":"270-281","source":"Crossref","is-referenced-by-count":4,"title":["A Faster Algorithm for Finding Minimum Tucker Submatrices"],"prefix":"10.1007","volume":"51","author":[{"given":"Guillaume","family":"Blin","sequence":"first","affiliation":[]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,30]]},"reference":[{"key":"9388_CR1","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1089\/cmb.2007.A005","volume":"14","author":"Z. Adam","year":"2007","unstructured":"Adam, Z., Turmel, M., Lemieux, C., Sankoff, D.: Common intervals and symmetric difference in a model-free phylogenomics, with an application to streptophyte evolution. J.\u00a0Comput. Biol. 14, 436\u2013445 (2007)","journal-title":"J.\u00a0Comput. Biol."},{"key":"9388_CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1089\/cmb.1995.2.159","volume":"2","author":"F. Alizadeh","year":"1995","unstructured":"Alizadeh, F., Karp, R., Weisser, D., Zweig, G.: Physical mapping of chromosomes using unique probes. J.\u00a0Comput. Biol. 2, 159\u2013184 (1995)","journal-title":"J.\u00a0Comput. Biol."},{"key":"9388_CR3","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1145\/1363686.1363981","volume-title":"23rd ACM Symposium on Applied Computing SAC\u201908","author":"E. Althaus","year":"2008","unstructured":"Althaus, E., Canzar, S., Emmett, M.R., Karrenbauer, A., Marshall, A.G., Meyer-Baese, A., Zhang, H.: Computing h\/d-exchange speeds of single residues from data of peptic fragments. In: 23rd ACM Symposium on Applied Computing SAC\u201908, pp. 1273\u20131277. ACM Press, New York (2008)"},{"issue":"1\u20133","key":"9388_CR4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0166-218X(96)00055-8","volume":"71","author":"J.E. Atkins","year":"1996","unstructured":"Atkins, J.E., Middendorf, M.: On physical mapping and the consecutive ones property for sparse matrices. Discrete Appl. Math. 71(1\u20133), 23\u201340 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9388_CR5","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/S0097539795285771","volume":"28","author":"J.E. Atkins","year":"1998","unstructured":"Atkins, J.E., Boman, E.G., Hendrickson, B.: A spectral algorithm for seriation and the consecutive ones problem. SIAM J. Comput. 28(1), 297\u2013310 (1998)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"9388_CR6","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1287\/opre.28.5.1074","volume":"28","author":"J.J. Bartholdi","year":"1980","unstructured":"Bartholdi, J.J., Orlin, J.B., Ratliff, H.D.: Cyclic scheduling via integer programs with circular ones. Oper. Res. 28(5), 1074\u20131085 (1980)","journal-title":"Oper. Res."},{"issue":"1","key":"9388_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(91)90098-M","volume":"90","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D.: On the complexity of testing for odd holes and induced odd paths. Discrete Math. 90(1), 85\u201392 (1991)","journal-title":"Discrete Math."},{"key":"9388_CR8","unstructured":"Blin, G., Rizzi, R., Vialette, S.: General framework for minimal conflicting set. Technical report, Universit\u00e9 Paris Est, I.G.M., Jan. (2010)"},{"key":"9388_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/978-3-642-20712-9_29","volume-title":"6th International Computer Science Symposium in Russia (CSR\u201911)","author":"G. Blin","year":"2011","unstructured":"Blin, G., Rizzi, R., Vialette, S.: A polynomial-time algorithm for finding minimal conflicting sets. In: 6th International Computer Science Symposium in Russia (CSR\u201911), St. Petersbourg, Russian Federation. Lecture Notes in Computer Science, vol. 6651, pp. 373\u2013384 (2011)"},{"key":"9388_CR10","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. Comput. Syst. Sci. 13, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"9388_CR11","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pcbi.1000234","volume":"4","author":"C. Chauve","year":"2008","unstructured":"Chauve, C., Tannier, \u00c9.: A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genome. PLoS Comput. Biol. 4, e1000234 (2008)","journal-title":"PLoS Comput. Biol."},{"key":"9388_CR12","series-title":"Electronic Notes on Discrete Mathematics","first-page":"121","volume-title":"Proc. 5th European Conference on Combinatorics, Graph Theory and Applications (EuroComb)","author":"C. Chauve","year":"2009","unstructured":"Chauve, C., Man\u01d4ch, J., Patterson, M.: On the gapped consecutive ones property. In: Proc. 5th European Conference on Combinatorics, Graph Theory and Applications (EuroComb), Bordeaux, France. Electronic Notes on Discrete Mathematics, vol. 34, pp. 121\u2013125 (2009)"},{"key":"9388_CR13","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1089\/cmb.1997.4.433","volume":"4","author":"T. Christof","year":"1997","unstructured":"Christof, T., J\u00fcnger, M., Kececioglu, J., Mutzel, P., Reinelt, G.: A branch-and-cut approach to physical mapping of chromosome by unique end-probes. J.\u00a0Comput. Biol. 4, 433\u2013447 (1997)","journal-title":"J.\u00a0Comput. Biol."},{"key":"9388_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-69346-7_17","volume-title":"6th International Conference on Integer Programming and Combinatorial Optimization IPCO\u201998","author":"T. Christof","year":"1998","unstructured":"Christof, T., Oswald, M., Reinelt, G.: Consecutive ones and a betweenness problem in computational biology. In: 6th International Conference on Integer Programming and Combinatorial Optimization IPCO\u201998. Lecture Notes in Computer Science, vol. 1412, pp. 213\u2013228. Springer, Berlin (1998)"},{"key":"9388_CR15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01581196","volume":"55","author":"M. Conforti","year":"1992","unstructured":"Conforti, M., Rao, M.R.: Structural properties and decomposition of linear balanced matrices. Math. Program. 55, 129\u2013168 (1992)","journal-title":"Math. Program."},{"key":"9388_CR16","first-page":"27","volume":"98","author":"M. Dom","year":"2009","unstructured":"Dom, M.: Algorithmic aspects of the consecutive-ones property. Bull. Eur. Assoc. Theor. Comput. Sci. 98, 27\u201359 (2009)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"issue":"3\u20134","key":"9388_CR17","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.jcss.2009.07.001","volume":"76","author":"M. Dom","year":"2010","unstructured":"Dom, M., Guo, J., Niedermeier, R.: Approximation and fixed-parameter algorithms for consecutive ones submatrix problems. J. Comput. Syst. Sci. 76(3\u20134), 204\u2013221 (2010)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9388_CR18","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pac. J. Math. 15(3), 835\u2013855 (1965)","journal-title":"Pac. J. Math."},{"issue":"1\u20132","key":"9388_CR19","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M. Habib","year":"2000","unstructured":"Habib, M., McConnell, R.M., Paul, C., Viennot, L.: Lex-bfs and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. 234(1\u20132), 59\u201384 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9388_CR20","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0020-0190(01)00325-8","volume":"83","author":"M. Hajiaghayi","year":"2002","unstructured":"Hajiaghayi, M., Ganjali, Y.: A note on the consecutive ones submatrix problem. Inf. Process. Lett. 83(3), 163\u2013166 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9388_CR21","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0166-218X(91)90011-K","volume":"30","author":"R. Hassin","year":"1991","unstructured":"Hassin, R., Megiddo, N.: Approximation algorithms for hitting objects with straight lines. Discrete Appl. Math. 30(1), 29\u201342 (1991)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"9388_CR22","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.disopt.2006.02.002","volume":"3","author":"D.S. Hochbaum","year":"2006","unstructured":"Hochbaum, D.S., Levin, A.: Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. Discrete Optim. 3(4), 327\u2013340 (2006)","journal-title":"Discrete Optim."},{"issue":"1","key":"9388_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.2001.1205","volume":"43","author":"W.-L. Hsu","year":"2002","unstructured":"Hsu, W.-L.: A simple test for the consecutive ones property. J.\u00a0Algorithms 43(1), 1\u201316 (2002)","journal-title":"J.\u00a0Algorithms"},{"issue":"1","key":"9388_CR24","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0304-3975(02)00435-8","volume":"296","author":"W.-L. Hsu","year":"2003","unstructured":"Hsu, W.-L., McConnell, R.M.: PC trees and circular-ones arrangements. Theor. Comput. Sci. 296(1), 99\u2013116 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9388_CR25","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1137\/0218005","volume":"18","author":"N. Korte","year":"1989","unstructured":"Korte, N., M\u00f6hring, R.H.: An incremental linear-time algorithm for recognizing interval graphs. SIAM J. Comput. 18(1), 68\u201381 (1989)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9388_CR26","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1137\/0206004","volume":"6","author":"L.T. Kou","year":"1977","unstructured":"Kou, L.T.: Polynomial complete consecutive information retrieval problems. SIAM J. Comput. 6(1), 67\u201375 (1977)","journal-title":"SIAM J. Comput."},{"key":"9388_CR27","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1089\/106652703322539051","volume":"10","author":"W.-F. Lu","year":"2003","unstructured":"Lu, W.-F., Hsu, W.-L.: A test for the consecutive ones property on noisy data\u2014application to physical mapping and sequence assembly. J.\u00a0Comput. Biol. 10, 709\u2013735 (2003)","journal-title":"J.\u00a0Comput. Biol."},{"key":"9388_CR28","first-page":"768","volume-title":"15th Annual ACM-SIAM Symposium on Discrete Algorithms SODA\u201904","author":"R.M. McConnell","year":"2004","unstructured":"McConnell, R.M.: A certifying algorithm for the consecutive-ones property. In: 15th Annual ACM-SIAM Symposium on Discrete Algorithms SODA\u201904, pp. 768\u2013777. ACM Press, New York (2004)"},{"key":"9388_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1007\/978-3-540-30140-0_67","volume-title":"12th Annual European Symposium on Algorithms ESA\u201904","author":"S. Mecke","year":"2004","unstructured":"Mecke, S., Wagner, D.: Solving geometric covering problems by data reduction. In: 12th Annual European Symposium on Algorithms ESA\u201904. Lecture Notes in Computer Science, vol. 3221, pp. 760\u2013771. Springer, Berlin (2004)"},{"key":"9388_CR30","volume-title":"5th Workshop on Algorithmic Methods and Models for Optimization of Railways ATMOS\u201905","author":"S. Mecke","year":"2005","unstructured":"Mecke, S., Sch\u00f6bel, A., Wagner, D.: Station location complexity and approximation. In: 5th Workshop on Algorithmic Methods and Models for Optimization of Railways ATMOS\u201905, Dagstuhl, Germany (2005)"},{"key":"9388_CR31","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0166-218X(98)00078-X","volume":"88","author":"J. Meidanis","year":"1998","unstructured":"Meidanis, J., Porto, O., Telles, G.P.: On the consecutive ones property. Discrete Appl. Math. 88, 325\u2013354 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"21\u201323","key":"9388_CR32","doi-asserted-by":"crossref","first-page":"1986","DOI":"10.1016\/j.tcs.2008.12.039","volume":"410","author":"M. Oswald","year":"2009","unstructured":"Oswald, M., Reinelt, G.: The simultaneous consecutive ones problem. Theor. Comput. Sci. 410(21\u201323), 1986\u20131992 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9388_CR33","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.disopt.2004.07.002","volume":"1","author":"N. Ruf","year":"2004","unstructured":"Ruf, N., Sch\u00f6bel, A.: Set covering with almost consecutive ones property. Discrete Optim. 1(2), 215\u2013228 (2004)","journal-title":"Discrete Optim."},{"issue":"3","key":"9388_CR34","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00453-007-0118-z","volume":"48","author":"J. Tan","year":"2007","unstructured":"Tan, J., Zhang, L.: The consecutive ones submatrix problem for sparse matrices. Algorithmica 48(3), 287\u2013299 (2007)","journal-title":"Algorithmica"},{"key":"9388_CR35","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(72)90019-6","volume":"12","author":"A.C. Tucker","year":"1972","unstructured":"Tucker, A.C.: A structure theorem for the consecutive 1\u2019s property. J. Comb. Theory, Ser. B 12, 153\u2013162 (1972)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9388_CR36","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/opre.10.4.518","volume":"10","author":"A.F. Veinott","year":"1962","unstructured":"Veinott, A.F., Wagner, H.M.: Optimal capacity scheduling. Oper. Res. 10, 518\u2013547 (1962)","journal-title":"Oper. Res."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9388-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-012-9388-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9388-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T16:28:52Z","timestamp":1642696132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-012-9388-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,30]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9388"],"URL":"https:\/\/doi.org\/10.1007\/s00224-012-9388-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,30]]}}}