{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:03:46Z","timestamp":1725595426474},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642223204"},{"type":"electronic","value":"9783642223211"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22321-1_6","type":"book-chapter","created":{"date-parts":[[2011,7,15]],"date-time":"2011-07-15T03:58:48Z","timestamp":1310702328000},"page":"58-69","source":"Crossref","is-referenced-by-count":0,"title":["Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Battaglia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noemi","family":"Scutell\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5-6","key":"6_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/S1570-8667(03)00035-2","volume":"1","author":"A. Amir","year":"2003","unstructured":"Amir, A., Apostolico, A., Landau, G.M., Satta, G.: Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms\u00a01(5-6), 409\u2013421 (2003)","journal-title":"J. Discrete Algorithms"},{"key":"6_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity A Modern Approach","author":"S. Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity A Modern Approach. Cambridge University Press, Cambridge (2009)"},{"unstructured":"Booth, K.S.: PQ-tree algorithms. Ph.D. thesis, Univ. of California (December 1975)","key":"6_CR3"},{"issue":"3","key":"6_CR4","first-page":"335","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. JCSS\u00a013(3), 335\u2013379 (1976)","journal-title":"JCSS"},{"key":"6_CR5","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":"6_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574719","volume-title":"Sperner theory","author":"K. Engel","year":"1997","unstructured":"Engel, K.: Sperner theory. Cambridge University Press, New York (1997)"},{"key":"6_CR7","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-39763-2_11","volume-title":"Algorithms in Bioinformatics","author":"R. Eres","year":"2003","unstructured":"Eres, R., Landau, G.M., Parida, L.: A combinatorial approach to automatic discovery of cluster-patterns. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 139\u2013150. Springer, Heidelberg (2003)"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, D.A.: Incidence matrices and interval graphs. Pacific J. Math.\u00a015(3), 835\u2013855 (1965)","journal-title":"Pacific J. Math."},{"key":"6_CR9","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, NY (1979)"},{"issue":"9","key":"6_CR10","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1145\/361573.361578","volume":"15","author":"S.P. Ghosh","year":"1972","unstructured":"Ghosh, S.P.: File organization: the consecutive retrieval property. Commun. ACM\u00a015(9), 802\u2013808 (1972)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Jain, M., Myers, E.W.: Algorithms for computing and integrating physical maps using unique probes. In: RECOMB 1997, pp. 151\u2013161 (1997)","key":"6_CR11","DOI":"10.1145\/267521.267542"},{"issue":"10","key":"6_CR12","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1089\/cmb.2005.12.1289","volume":"12","author":"G.M. Landau","year":"2005","unstructured":"Landau, G.M., Parida, L., Weimann, O.: Gene proximity analysis across whole genomes via PQ-trees. Journal of Computational Biology\u00a012(10), 1289\u20131306 (2005)","journal-title":"Journal of Computational Biology"},{"key":"6_CR13","volume-title":"Computational complexity","author":"C.M. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.M.: Computational complexity. Addison-Wesley, Reading (1994)"},{"issue":"9","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1089\/cmb.2007.0064","volume":"14","author":"L. Parida","year":"2007","unstructured":"Parida, L.: Statistical significance of large gene clusters. Journal of Computational Biology\u00a014(9), 1145\u20131159 (2007)","journal-title":"Journal of Computational Biology"},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science\u00a08(2), 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22321-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:57:22Z","timestamp":1553914642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22321-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223204","9783642223211"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22321-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}