{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:42:36Z","timestamp":1725856956555},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319398167"},{"type":"electronic","value":"9783319398174"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-39817-4_20","type":"book-chapter","created":{"date-parts":[[2016,5,26]],"date-time":"2016-05-26T13:15:09Z","timestamp":1464268509000},"page":"205-214","source":"Crossref","is-referenced-by-count":1,"title":["Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?"],"prefix":"10.1007","author":[{"given":"Lianrong","family":"Pu","sequence":"first","affiliation":[]},{"given":"Haitao","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,27]]},"reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1023\/B:JOCO.0000031419.12290.2b","volume":"8","author":"G Lin","year":"2004","unstructured":"Lin, G., Jiang, T.: A further improved approximation algorithm for breakpoint graph decomposition. J. Comb. Optim. 8(2), 183\u2013194 (2004)","journal-title":"J. Comb. Optim."},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BFb0029799","volume":"684","author":"J Kececioglu","year":"1993","unstructured":"Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for the inversion distance between two chromosomes. Comb. Pattern Matching Fourth Ann. Symp. 684, 87\u2013105 (1993)","journal-title":"Comb. Pattern Matching Fourth Ann. Symp."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: Proceedings of the First Annual International Conference on Computational Molecular Biology (1997)","DOI":"10.1145\/267521.267531"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In: Proceedings of 27th Annual ACM Symposium on Theory of Comput (STOC) (1995)","DOI":"10.1145\/225058.225112"},{"issue":"2","key":"20_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/A:1009838309166","volume":"3","author":"A Caprara","year":"1999","unstructured":"Caprara, A.: On the tightness of the alternating-cycle lower bound for sorting by reversals. J. Comb. Optim. 3(2), 149\u2013182 (1999)","journal-title":"J. Comb. Optim."},{"issue":"10","key":"20_CR6","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1089\/cmb.2009.0156","volume":"16","author":"KM Swenson","year":"2009","unstructured":"Swenson, K.M., Lin, Y., Rajan, V., Moret, B.M.E.: Hurdles and sorting by inversions: combinatorial, statistical, and experimental results. J. Comput. Biol. 16(10), 1339\u20131351 (2009)","journal-title":"J. Comput. Biol."},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/978-3-540-87989-3_18","volume-title":"Comparative Genomics","author":"KM Swenson","year":"2008","unstructured":"Swenson, K.M., Lin, Y., Rajan, V., Moret, B.M.E.: Hurdles hardly have to be heeded. In: Nelson, C.E., Vialette, S. (eds.) RECOMB-CG 2008. LNCS (LNBI), vol. 5267, pp. 241\u2013251. Springer, Heidelberg (2008)"},{"key":"20_CR8","first-page":"162","volume":"937","author":"S Hannenhalli","year":"1995","unstructured":"Hannenhalli, S.: Polynomial-time algorithm for computing translocation distance between genomes. Proc. Sixth Ann. Symp. Comb. Pattern Matching (CPM) 937, 162\u2013176 (1995)","journal-title":"Proc. Sixth Ann. Symp. Comb. Pattern Matching (CPM)"},{"key":"20_CR9","unstructured":"Kececioglu, J., Ravi, R.: Of mice and men: algorithms for evolutionary distances between genomes with translocation. In: Proceedings Sixth Annual ACM-SIAM Symposium, Discrete Algorithms (SODA) (1995)"},{"issue":"3","key":"20_CR10","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1093\/bioinformatics\/btq674","volume":"27","author":"H Jiang","year":"2010","unstructured":"Jiang, H., Zhu, B., Zhu, D.: Algorithms for sorting unsigned linear genomes by the DCJ operations. Bioinformatics 27(3), 311\u2013316 (2010)","journal-title":"Bioinformatics"},{"issue":"4","key":"20_CR11","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/TCBB.2005.48","volume":"2","author":"X Chen","year":"2005","unstructured":"Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement. ACM\/IEEE Trans. Comput. Bio. Bioinf. 2(4), 302\u2013315 (2005)","journal-title":"ACM\/IEEE Trans. Comput. Bio. Bioinf."},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/978-3-319-05269-4_22","volume-title":"Research in Computational Molecular Biology","author":"M Shao","year":"2014","unstructured":"Shao, M., Lin, Y., Moret, B.: An exact algorithm to compute the DCJ distance for genomes with duplicate genes. In: Sharan, R. (ed.) RECOMB 2014. LNCS, vol. 8394, pp. 280\u2013292. Springer, Heidelberg (2014)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/11775096_27","volume-title":"Algorithmic Aspects in Information and Management","author":"Z Chen","year":"2006","unstructured":"Chen, Z., Fu, B., Zhu, B.: The approximability of the exemplar breakpoint distance problem. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 291\u2013302. Springer, Heidelberg (2006)"},{"issue":"38","key":"20_CR14","doi-asserted-by":"crossref","first-page":"14254","DOI":"10.1073\/pnas.0805217105","volume":"105","author":"J Ma","year":"2008","unstructured":"Ma, J., Ratan, A., Raney, B.J., Suh, B.B., Miller, W., Haussler, D.: The infinite sites model of genome evolution. Proc. Nat. Acad. Sci. 105(38), 14254\u201314261 (2008)","journal-title":"Proc. Nat. Acad. Sci."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39817-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T22:25:03Z","timestamp":1567981503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39817-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319398167","9783319398174"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39817-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}