{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:21:37Z","timestamp":1725567697943},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161803"},{"type":"electronic","value":"9783642161810"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16181-0_5","type":"book-chapter","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T08:06:33Z","timestamp":1286957193000},"page":"50-61","source":"Crossref","is-referenced-by-count":0,"title":["Ultra-Perfect Sorting Scenarios"],"prefix":"10.1007","author":[{"given":"A\u00efda","family":"Ouangraoua","sequence":"first","affiliation":[]},{"given":"Anne","family":"Bergeron","sequence":"additional","affiliation":[]},{"given":"Krister M.","family":"Swenson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","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)"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TCBB.2007.1011","volume":"4","author":"S. B\u00e9rard","year":"2007","unstructured":"B\u00e9rard, S., Bergeron, A., Chauve, C., Paul, C.: Perfect sorting by reversals is not always difficult. IEEE\/ACM Trans. Comput. Biology Bioinform.\u00a04(1), 4\u201316 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"key":"5_CR3","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-540-87989-3_12","volume-title":"Comparative Genomics","author":"S. B\u00e9rard","year":"2008","unstructured":"B\u00e9rard, S., Chateau, A., Chauve, C., Paul, C., Tannier, E.: Perfect DCJ rearrangement. In: Nelson, C.E., Vialette, S. (eds.) RECOMB-CG 2008. LNCS (LNBI), vol.\u00a05267, pp. 158\u2013169. Springer, Heidelberg (2008)"},{"key":"5_CR4","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)"},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1101\/gr.1975204","volume":"14","author":"G. Bourque","year":"2004","unstructured":"Bourque, G., Pevzner, P.A., Tesler, G.: Reconstructing the genomic architecture of ancestral mammals: Lessons from human, mouse, and rat genomes. Genome Research\u00a014(4), 507\u2013516 (2004)","journal-title":"Genome Research"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Braga, M.D., Gautier, C., Sagot, M.-F.: An asymmetric approach to preserve common intervals while sorting by reversals. Algorithms for Molecular Biology 4(16) (2009)","DOI":"10.1186\/1748-7188-4-16"},{"key":"5_CR7","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":"5_CR8","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":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-44679-6_23","volume-title":"Computing and Combinatorics","author":"W.-L. Hsu","year":"2001","unstructured":"Hsu, W.-L.: PC-trees vs. PQ-trees. In: Wang, J. (ed.) COCOON 2001. LNCS, vol.\u00a02108, pp. 207\u2013217. Springer, Heidelberg (2001)"},{"issue":"1","key":"5_CR10","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. Theor. Comput. Sci.\u00a0296(1), 99\u2013116 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR11","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":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/11533719_7","volume-title":"Computing and Combinatorics","author":"M.-F. Sagot","year":"2005","unstructured":"Sagot, M.-F., Tannier, E.: Perfect sorting by reversals. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 42\u201351. Springer, Heidelberg (2005)"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1093\/bioinformatics\/18.3.492","volume":"18","author":"G. Tesler","year":"2002","unstructured":"Tesler, G.: GRIMM: genome rearrangements web server. Bioinformatics\u00a018(3), 492\u2013493 (2002)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16181-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:34:56Z","timestamp":1553171696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16181-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161803","9783642161810"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16181-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}