{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:23:36Z","timestamp":1725557016234},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135613"},{"type":"electronic","value":"9783642135620"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13562-0_16","type":"book-chapter","created":{"date-parts":[[2010,5,31]],"date-time":"2010-05-31T09:08:30Z","timestamp":1275296910000},"page":"163-174","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting the Minimum Breakpoint Linearization Problem"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Bulteau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irena","family":"Rusu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"16_CR1","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1089\/cmb.2007.A002","volume":"14","author":"G. Blin","year":"2007","unstructured":"Blin, G., Blais, E., Hermelin, D., Guillon, P., Blanchette, M., El-Mabrouk, N.: Gene maps linearization using genomic rearrangement distances. Journal of Computational Biology\u00a014(4), 394\u2013407 (2007)","journal-title":"Journal of Computational Biology"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TCBB.2009.3","volume":"6","author":"X. Chen","year":"2009","unstructured":"Chen, X., Cui, Y.: An approximation algorithm for the minimum breakpoint linearization problem. IEEE\/ACM Trans. Comput. Biology Bioinform.\u00a06(3), 401\u2013409 (2009)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/3-540-59408-6_38","volume-title":"Integer Programming and Combinatorial Optimization","author":"G. Even","year":"1995","unstructured":"Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multi-cuts in directed graphs. In: Balas, E., Clausen, J. (eds.) IPCO 1995. LNCS, vol.\u00a0920, pp. 14\u201328. Springer, Heidelberg (1995)"},{"issue":"5","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1142\/S0219720007003107","volume":"5","author":"Z. Fu","year":"2007","unstructured":"Fu, Z., Jiang, T.: Computing the breakpoint distance between partially ordered genomes. J. Bioinformatics and Computational Biology\u00a05(5), 1087\u20131101 (2007)","journal-title":"J. Bioinformatics and Computational Biology"},{"issue":"4","key":"16_CR5","doi-asserted-by":"crossref","first-page":"2235","DOI":"10.1093\/genetics\/165.4.2235","volume":"165","author":"I.V. Yap","year":"2003","unstructured":"Yap, I.V., Schneider, D., Kleinberg, J., Matthews, D., Cartinhourb, S., McCouch, S.R.: A graph-theoretic approach to comparing and integrating genetic, physical and sequence-based maps. Genetics\u00a0165(4), 2235\u20132247 (2003)","journal-title":"Genetics"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Zheng, C., Lenert, A., Sankoff, D.: Reversal distance for partially ordered genomes. In: ISMB (Supplement of Bioinformatics), pp. 502\u2013508 (2005)","DOI":"10.1093\/bioinformatics\/bti1037"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11533719_8","volume-title":"Computing and Combinatorics","author":"C. Zheng","year":"2005","unstructured":"Zheng, C., Sankoff, D.: Genome rearrangements with partially ordered chromosomes. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 52\u201362. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13562-0_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T16:45:27Z","timestamp":1635439527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13562-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135613","9783642135620"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13562-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}