{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:12:28Z","timestamp":1725538348108},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642047435"},{"type":"electronic","value":"9783642047442"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04744-2_11","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T13:16:13Z","timestamp":1253711773000},"page":"126-137","source":"Crossref","is-referenced-by-count":0,"title":["Pseudo Boolean Programming for Partially Ordered Genomes"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Angibaud","sequence":"first","affiliation":[]},{"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[]},{"given":"Annelyse","family":"Th\u00e9venin","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1089\/cmb.2008.0061","volume":"15","author":"S. Angibaud","year":"2008","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Th\u00e9venin, A., Vialette, S.: Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate genes. J. Computational Biology\u00a015(8), 1093\u20131115 (2008)","journal-title":"J. Computational Biology"},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1089\/cmb.2007.A001","volume":"14","author":"S. Angibaud","year":"2007","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Vialette, S.: A pseudo-boolean general framework for computing rearrangement distances between genomes with duplicates. J. Computational Biology\u00a014(4), 379\u2013393 (2007)","journal-title":"J. Computational Biology"},{"key":"11_CR3","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)"},{"issue":"4","key":"11_CR4","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. J. Computational Biology\u00a014(4), 394\u2013407 (2007)","journal-title":"J. Computational Biology"},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N. E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation\u00a02, 1\u201326 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"issue":"5","key":"11_CR6","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"},{"key":"11_CR7","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. J. Wiley & Sons, Chichester (1998)"},{"issue":"2","key":"11_CR8","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"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-5193(82)90384-8","volume":"99","author":"G.A. Watterson","year":"1982","unstructured":"Watterson, G.A., Ewens, W.J., Hall, T.E., Morgan, A.: The chromosome inversion problem. Journal of Theoretical Biology\u00a099(1), 1\u20137 (1982)","journal-title":"Journal of Theoretical Biology"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1093\/bioinformatics\/bti1037","volume":"21","author":"C. Zheng","year":"2005","unstructured":"Zheng, C., Lenert, A., Sankoff, D.: Reversal distance for partially ordered genomes. Bioinformatics\u00a021(1), 502\u2013508 (2005)","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-04744-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T11:30:25Z","timestamp":1590147025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04744-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642047435","9783642047442"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04744-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}