{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:10:17Z","timestamp":1762323017439},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_37","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"421-432","source":"Crossref","is-referenced-by-count":5,"title":["Algebraic Operations on PQ Trees and Modular Decomposition Trees"],"prefix":"10.1007","author":[{"given":"Ross M.","family":"McConnell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"de Montgolfier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1073\/pnas.45.11.1607","volume":"45","author":"S. Benzer","year":"1959","unstructured":"Benzer, S.: On the topology of the genetic fine structure. Proc. Nat. Acad. Sci. U.S.A.\u00a045, 1607\u20131620 (1959)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"S. Booth","year":"1976","unstructured":"Booth, S., Lueker, S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci.\u00a013, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(81)90138-2","volume":"37","author":"M. Chein","year":"1981","unstructured":"Chein, M., Habib, M., Maurer, M.C.: Partitive hypergraphs. Discrete Mathematics\u00a037, 35\u201350 (1981)","journal-title":"Discrete Mathematics"},{"key":"37_CR4","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1006\/jagm.1994.1013","volume":"16","author":"A. Ehrenfeucht","year":"1994","unstructured":"Ehrenfeucht, A., Gabow, H.N., McConnell, R.M., Sullivan, S.J.: An O(n\n                           2) divide-and-conquer algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs. Journal of Algorithms\u00a016, 283\u2013294 (1994)","journal-title":"Journal of Algorithms"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0304-3975(90)90130-A","volume":"70","author":"A. Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Theory of 2-structures, part 2: Representations through labeled tree families. Theoretical Computer Science\u00a070, 305\u2013342 (1990)","journal-title":"Theoretical Computer Science"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hungar.\u00a018, 25\u201366 (1967)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"37_CR8","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"37_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Heber, S., Stoye, J.: Finding all common intervals of k permutations. In: CPM, pp. 207\u2013218 (2001)","DOI":"10.1007\/3-540-48194-X_19"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"59","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. Theoretical Computer Science\u00a0296, 59\u201374 (2003)","journal-title":"Theoretical Computer Science"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/11496656_12","volume-title":"Combinatorial Pattern Matching","author":"G.M. Landau","year":"2005","unstructured":"Landau, G.M., Parida, L., Weimann, O.: Using pq trees for comparative genomics. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 128\u2013143. Springer, Heidelberg (2005)"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"McConnell, R.M.: Linear-time recognition of circular-arc graphs. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2001), vol.\u00a042, pp. 386\u2013394 (2001)","DOI":"10.1109\/SFCS.2001.959913"},{"key":"37_CR14","unstructured":"McConnell, R.M.: A certifying algorithm for the consecutive-ones property. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms SODA2004, vol.\u00a015 (2004) (to appear)"},{"issue":"1-3","key":"37_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Mathematics\u00a0201(1-3), 189\u2013241 (1999)","journal-title":"Discrete Mathematics"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00453-003-1032-7","volume":"37","author":"R.M. McConnell","year":"2003","unstructured":"McConnell, R.M.: Linear-time recognition of circular-arc graphs. Algorithmica\u00a037, 93\u2013147 (2003)","journal-title":"Algorithmica"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"McConnell, R.M., de Montgolfier, F.: Linear-time modular decomposition of directed graphs. Discrete Applied Mathematics (2005)","DOI":"10.1016\/j.dam.2004.02.017"},{"key":"37_CR18","unstructured":"McConnell, R.M., Spinrad, J.P.: Construction of probe interval models. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 866\u2013875 (2002)"},{"key":"37_CR19","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0166-218X(98)00077-8","volume":"88","author":"F.R. McMorris","year":"1998","unstructured":"McMorris, F.R., Wang, C., Zhang, P.: On probe interval graphs. Discrete Applied Mathematics\u00a088, 315\u2013324 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"37_CR20","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-94-009-5315-4_2","volume-title":"Graphs and Order","author":"R.H. M\u00f6hring","year":"1985","unstructured":"M\u00f6hring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. In: Rival, I. (ed.) Graphs and Order, pp. 41\u2013101. D. Reidel, Boston (1985)"},{"key":"37_CR21","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF02022041","volume":"4","author":"R.H. M\u00f6hring","year":"1985","unstructured":"M\u00f6hring, R.H.: Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions. Annals of Operations Research\u00a04, 195\u2013225 (1985)","journal-title":"Annals of Operations Research"},{"key":"37_CR22","first-page":"257","volume":"19","author":"R.H. M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H., Radermacher, F.J.: Substitution decomposition for discrete structures and connections with combinatorial optimization. Annals of Discrete Mathematics\u00a019, 257\u2013356 (1984)","journal-title":"Annals of Discrete Mathematics"},{"key":"37_CR23","first-page":"1409","volume":"38","author":"R.R. Sokal","year":"1958","unstructured":"Sokal, R.R., Michener, C.D.: A statistical method for evaluating systematic relationships. The University of Kansas Scientific Bulletin\u00a038, 1409\u20131438 (1958)","journal-title":"The University of Kansas Scientific Bulletin"},{"issue":"2","key":"37_CR24","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/s004539910014","volume":"26","author":"T. Uno","year":"2000","unstructured":"Uno, T., Yagiura, M.: Fast algorithms to enumerate all common intervals of two permutations. Algorithmica\u00a026(2), 290\u2013309 (2000)","journal-title":"Algorithmica"},{"key":"37_CR25","unstructured":"Zhang, P.: United states patent: Method of mapping DNA fragments. Technical report (July 2000), Available at \n                    \n                      http:\/\/www.cc.columbia.edu\/cu\/cie\/techlists\/patents\/5667970.htm"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604686_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T09:46:00Z","timestamp":1552470360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11604686_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}