{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:15:33Z","timestamp":1773274533530,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642139611","type":"print"},{"value":"9783642139628","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13962-8_8","type":"book-chapter","created":{"date-parts":[[2010,6,26]],"date-time":"2010-06-26T12:33:57Z","timestamp":1277555637000},"page":"69-77","source":"Crossref","is-referenced-by-count":6,"title":["A Faster Algorithm for Finding Minimum Tucker Submatrices"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Blin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","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. Comput. Biol.\u00a014, 436\u2013445 (2007)","journal-title":"J. Comput. Biol."},{"key":"8_CR2","doi-asserted-by":"publisher","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. Comput. Biol.\u00a02, 159\u2013184 (1995)","journal-title":"J. Comput. Biol."},{"key":"8_CR3","doi-asserted-by":"crossref","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: ACM Press (ed.) SAC 2008, pp. 1273\u20131277 (2008)","DOI":"10.1145\/1363686.1363981"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","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.\u00a028(1), 297\u2013310 (1998)","journal-title":"SIAM J. Comput."},{"issue":"13","key":"8_CR5","doi-asserted-by":"publisher","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.\u00a071(13), 23\u201340 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"8_CR6","doi-asserted-by":"publisher","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.\u00a028(5), 1074\u20131085 (1980)","journal-title":"Oper. Res."},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","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.\u00a090(1), 85\u201392 (1991)","journal-title":"Discrete Math."},{"key":"8_CR8","unstructured":"Blin, G., Rizzi, R., Vialette, S.: General framework for minimal conflicting set. Technical report, Universit\u00e9 Paris Est, I.G.M (January 2010)"},{"key":"8_CR9","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. System Sci.\u00a013, 335\u2013379 (1976)","journal-title":"J. Comput. System Sci."},{"key":"8_CR10","doi-asserted-by":"crossref","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.\u00a034, pp. 121\u2013125 (2009)","DOI":"10.1016\/j.endm.2009.07.020"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-04744-2_5","volume-title":"Comparative Genomics","author":"C. Chauve","year":"2009","unstructured":"Chauve, C., Stephen, T., Haus, U.-U., You, V.: Minimal conflicting sets for the consecutive ones property in ancestral genome reconstruction. In: Ciccarelli, F.D., Mikl\u00f3s, I. (eds.) RECOMB-CG 2009. LNCS, vol.\u00a05817, pp. 48\u201358. Springer, Heidelberg (2009)"},{"key":"8_CR12","doi-asserted-by":"crossref","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.\u00a04, paper e1000234 (2008)","DOI":"10.1371\/journal.pcbi.1000234"},{"key":"8_CR13","doi-asserted-by":"publisher","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. Comput. Biol.\u00a04, 433\u2013447 (1997)","journal-title":"J. Comput. Biol."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-69346-7_17","volume-title":"Integer Programming and Combinatorial Optimization","author":"T. Christof","year":"1998","unstructured":"Christof, T., Oswald, M., Reinelt, G.: Consecutive ones and a betweenness problem in computational biology. In: Bixby, R.E., Boyd, E.A., R\u00edos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol.\u00a01412, pp. 213\u2013228. Springer, Heidelberg (1998)"},{"key":"8_CR15","doi-asserted-by":"publisher","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. Mathematical Programming\u00a055, 129\u2013168 (1992)","journal-title":"Mathematical Programming"},{"key":"8_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. EATCS\u00a098, 27\u201359 (2009)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci. EATCS"},{"key":"8_CR17","unstructured":"Dom, M., Guo, J., Niedermeier, R.: Approximation and fixed-parameter algorithms for consecutive ones submatrix problems. Journal of Computer and System Sciences, Press, Corrected Proof (2009)"},{"issue":"3","key":"8_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. Pacific J. Math.\u00a015(3), 835\u2013855 (1965)","journal-title":"Pacific J. Math."},{"issue":"12","key":"8_CR19","doi-asserted-by":"publisher","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. Theoret. Comput. Sci.\u00a0234(12), 59\u201384 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"8_CR20","doi-asserted-by":"publisher","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. Information Processing Letters\u00a083(3), 163\u2013166 (2002)","journal-title":"Information Processing Letters"},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","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 Applied Mathematics\u00a030(1), 29\u201342 (1991)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"8_CR22","doi-asserted-by":"publisher","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 Optimization\u00a03(4), 327\u2013340 (2006)","journal-title":"Discrete Optimization"},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","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. Algorithms\u00a043(1), 1\u201316 (2002)","journal-title":"J. Algorithms"},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","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. Theoret. Comput. Sci.\u00a0296(1), 99\u2013116 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"8_CR25","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0218005","volume":"18","author":"N. Korte","year":"1989","unstructured":"Korte, N., Mhring, R.H.: An incremental linear-time algorithm for recognizing interval graphs. SIAM J. Comput.\u00a018(1), 68\u201381 (1989)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"8_CR26","doi-asserted-by":"publisher","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.\u00a06(1), 67\u201375 (1977)","journal-title":"SIAM J. Comput."},{"key":"8_CR27","doi-asserted-by":"publisher","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 \u2013 application to physical mapping and sequence assembly. J. Comput. Biol.\u00a010, 709\u2013735 (2003)","journal-title":"J. Comput. Biol."},{"key":"8_CR28","unstructured":"McConnell, R.M.: A certifying algorithm for the consecutive-ones property. In: ACM Press (ed.) 15th Annual ACMSIAM Symposium on Discrete Algorithms SODA 2004, pp. 768\u2013777 (2004)"},{"key":"8_CR29","unstructured":"Mecke, S., Schbel, A., Wagner, D.: Station location complexity and approximation. In: 5th Workshop on Algorithmic Methods and Models for Optimization of Railways ATMOS 2005, Dagstuhl, Germany (2005)"},{"key":"8_CR30","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":"Algorithms \u2013 ESA 2004","author":"S. Mecke","year":"2004","unstructured":"Mecke, S., Wagner, D.: Solving geometric covering problems by data reduction. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 760\u2013771. Springer, Heidelberg (2004)"},{"key":"8_CR31","doi-asserted-by":"publisher","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.\u00a088, 325\u2013354 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"2123","key":"8_CR32","doi-asserted-by":"publisher","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. Theoret. Comput. Sci.\u00a0410(2123), 1986\u20131992 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"8_CR33","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.disopt.2004.07.002","volume":"1","author":"N. Ruf","year":"2004","unstructured":"Ruf, N., Schbel, A.: Set covering with almost consecutive ones property. Discrete Optimization\u00a01(2), 215\u2013228 (2004)","journal-title":"Discrete Optimization"},{"issue":"3","key":"8_CR34","doi-asserted-by":"publisher","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\u00a048(3), 287\u2013299 (2007)","journal-title":"Algorithmica"},{"key":"8_CR35","doi-asserted-by":"publisher","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 1s property. Journal of Combinatorial Theory. Series B\u00a012, 153\u2013162 (1972)","journal-title":"Journal of Combinatorial Theory. Series B"},{"key":"8_CR36","doi-asserted-by":"publisher","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.\u00a010, 518\u2013547 (1962)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Programs, Proofs, Processes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13962-8_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:46:03Z","timestamp":1606185963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13962-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642139611","9783642139628"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13962-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}