{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:27:57Z","timestamp":1742398077744},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_16","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"146-155","source":"Crossref","is-referenced-by-count":5,"title":["Revisiting T.\u00a0Uno and M.\u00a0Yagiura\u2019s Algorithm"],"prefix":"10.1007","author":[{"given":"Binh-Minh Bui","family":"Xuan","sequence":"first","affiliation":[]},{"given":"Michel","family":"Habib","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2-3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.tcs.2004.02.036","volume":"320","author":"M.-P. B\u00e9al","year":"2004","unstructured":"B\u00e9al, M.-P., Bergeron, A., Corteel, S., Raffinot, M.: An algorithmic view of gene teams. Theoretical Computer Science\u00a0320(2-3), 395\u2013418 (2004)","journal-title":"Theoretical Computer Science"},{"key":"16_CR2","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-32290-0_1","volume-title":"Comparative Genomics","author":"S. B\u00e9rard","year":"2005","unstructured":"B\u00e9rard, S., Bergeron, A., Chauve, C.: Conservation of combinatorial structures in evolution scenarios. In: Lagergren, J. (ed.) RECOMB-WS 2004. LNCS (LNBI), vol.\u00a03388, pp. 1\u201314. Springer, Heidelberg (2005)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/11561071_69","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Bergeron","year":"2005","unstructured":"Bergeron, A., Chauve, C., de Montgolfier, F., Raffinot, M.: Computing common intervals of k permutations, with applications to modular decomposition of graphs. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 779\u2013790. Springer, Heidelberg (2005)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-45071-8_9","volume-title":"Computing and Combinatorics","author":"A. Bergeron","year":"2003","unstructured":"Bergeron, A., Stoye, J.: On the similarity of sets of permutations and its applications to genome comparison. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 68\u201379. Springer, Heidelberg (2003)"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0166-218X(94)00044-E","volume":"60","author":"K.P. Bogart","year":"1995","unstructured":"Bogart, K.P., Fishburn, P.C., Isaak, G., Langley, L.: Proper and unit tolerance graphs. Discrete Applied Mathematics\u00a060, 99\u2013117 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BFb0024493","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"C. Capelle","year":"1997","unstructured":"Capelle, C.: Block decomposition of inheritance hierarchies. In: M\u00f6hring, R.H. (ed.) WG 1997. LNCS, vol.\u00a01335, pp. 118\u2013131. Springer, Heidelberg (1997)"},{"issue":"1","key":"16_CR7","first-page":"55","volume":"5","author":"C. Capelle","year":"2002","unstructured":"Capelle, C., Habib, M., de Montgolfier, F.: Graph decomposition and factorizing permutations. Discrete Mathematics and Theoretical Computer Science\u00a05(1), 55\u201370 (2002)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"issue":"1","key":"16_CR8","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(1), 35\u201350 (1981)","journal-title":"Discrete Mathematics"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0017474","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"A. Cournier","year":"1994","unstructured":"Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 68\u201384. Springer, Heidelberg (1994)"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jagm.2000.1090","volume":"36","author":"E. Dahlhaus","year":"2000","unstructured":"Dahlhaus, E.: Parallel algorithms for hierarchical clustering, and applications to split decomposition and parity graph recognition. Journal of Algorithms\u00a036(2), 205\u2013240 (2000)","journal-title":"Journal of Algorithms"},{"key":"16_CR11","volume-title":"Computational geometry","author":"M. Berg de","year":"1991","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational geometry. Springer, Heidelberg (1991)"},{"key":"16_CR12","unstructured":"de Montgolfier, F.: D\u00e9composition modulaire des graphes. Th\u00e9orie, extensions et algorithmes. PhD thesis, Universit\u00e9 Montpellier II (2003)"},{"issue":"3","key":"16_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/(SICI)1097-0118(199807)28:3<129::AID-JGT2>3.0.CO;2-M","volume":"28","author":"S. Felsner","year":"1998","unstructured":"Felsner, S.: Tolerance graphs and orders. Journal of Graph Theory\u00a028(3), 129\u2013140 (1998)","journal-title":"Journal of Graph Theory"},{"key":"16_CR14","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-30219-3_3","volume-title":"Algorithms in Bioinformatics","author":"M. Figeac","year":"2004","unstructured":"Figeac, M., Varr\u00e9, J.-S.: Sorting by reversals with common intervals. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 26\u201337. Springer, Heidelberg (2004)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-27810-8_17","volume-title":"Algorithm Theory - SWAT 2004","author":"M. Habib","year":"2004","unstructured":"Habib, M., de Montgolfier, F., Paul, C.: A simple linear-time modular decomposition algorithm. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 187\u2013198. Springer, Heidelberg (2004)"},{"issue":"6","key":"16_CR16","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/BF01189070","volume":"13","author":"M. Habib","year":"1995","unstructured":"Habib, M., Huchard, M., Spinrad, J.P.: A linear algorithm to decompose inheritance graphs into modules. Algorithmica\u00a013(6), 573\u2013591 (1995)","journal-title":"Algorithmica"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-48194-X_19","volume-title":"Combinatorial Pattern Matching","author":"S. Heber","year":"2001","unstructured":"Heber, S., Stoye, J.: Finding all common intervals of k permutations. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 207\u2013218. Springer, Heidelberg (2001)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-54945-5_49","volume-title":"ISA \u201991 Algorithms","author":"W.-L. Hsu","year":"1991","unstructured":"Hsu, W.-L., Ma, T.-M.: Substitution decomposition on chordal graphs and applications. In: Hsu, W.-L., Lee, R.C.T. (eds.) ISA 1991. LNCS, vol.\u00a0557, pp. 52\u201360. Springer, Heidelberg (1991)"},{"key":"16_CR19","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":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/11604686_37","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"R.M. McConnell","year":"2005","unstructured":"McConnell, R.M., de Montgolfier, F.: Algebraic Operations on PQ Trees and Modular Decomposition Trees. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 421\u2013432. Springer, Heidelberg (2005)"},{"key":"16_CR21","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, 189\u2013241 (1999)","journal-title":"Discrete Mathematics"},{"key":"16_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"},{"issue":"2","key":"16_CR23","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":"16_CR24","first-page":"481","volume-title":"Handbook of Combinatorics","author":"D.J.A. Welsh","year":"1995","unstructured":"Welsh, D.J.A.: Matroids: Fundamental concepts. In: Handbook of Combinatorics, vol.\u00a01, pp. 481\u2013526. North-Holland, Amsterdam (1995)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:02:39Z","timestamp":1619506959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11602613_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}