{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:26:01Z","timestamp":1725470761616},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540445296"},{"type":"electronic","value":"9783540445302"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11864127_7","type":"book-chapter","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T04:41:57Z","timestamp":1158900117000},"page":"75-86","source":"Crossref","is-referenced-by-count":2,"title":["How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Angibaud","sequence":"first","affiliation":[]},{"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[]},{"given":"Irena","family":"Rusu","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Barth, P.: A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization. Technical Report MPI-I-95-2-003, Max Planck Institut Informatik, 13 pages (2005)","key":"7_CR1"},{"unstructured":"Blin, G., Chauve, C., Fertin, G.: The breakpoint distance for signed sequences. In: Proc. 1st Algorithms and Computational Methods for Biochemical and Evolutionary Networks (CompBioNets), pp. 3\u201316. KCL publications (2004)","key":"7_CR2"},{"key":"7_CR3","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/11554714_2","volume-title":"Comparative Genomics","author":"G. Blin","year":"2005","unstructured":"Blin, G., Chauve, C., Fertin, G.: Genes order and phylogenetic reconstruction: Application to \u03b3-proteobacteria. In: McLysaght, A., Huson, D.H. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03678, pp. 11\u201320. Springer, Heidelberg (2005)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11533719_5","volume-title":"Computing and Combinatorics","author":"G. Blin","year":"2005","unstructured":"Blin, G., Rizzi, R.: Conserved interval distance computation between non-trivial genomes. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 22\u201331. Springer, Heidelberg (2005)"},{"key":"7_CR5","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/11554714_3","volume-title":"Comparative Genomics","author":"G. Bourque","year":"2005","unstructured":"Bourque, G., Yacef, Y., El-Mabrouk, N.: Maximizing synteny blocks to identify ancestral homologs. In: McLysaght, A., Huson, D.H. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03678, pp. 21\u201335. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Bryant, D.: The complexity of calculating exemplar distances. In: Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pp. 207\u2013212 (2000)","key":"7_CR6","DOI":"10.1007\/978-94-011-4309-7_19"},{"doi-asserted-by":"crossref","unstructured":"Chai, D., Kuehlmann, A.: A fast pseudo-boolean constraint solver, pp. 830\u2013835 (2003)","key":"7_CR7","DOI":"10.1145\/775832.776041"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/11758525_105","volume-title":"Computational Science \u2013 ICCS 2006","author":"C. Chauve","year":"2006","unstructured":"Chauve, C., Fertin, G., Rizzi, R., Vialette, S.: Genomes containing duplicates are hard to compare. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol.\u00a03992, pp. 783\u2013790. Springer, Heidelberg (2006)"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","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. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a02(4), 302\u2013315 (2005)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"7_CR10","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":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1371\/journal.pbio.0000019","volume":"1","author":"E. Lerat","year":"2003","unstructured":"Lerat, E., Daubin, V., Moran, N.A.: From gene tree to organismal phylogeny in prokaryotes: the case of \u03b3-proteobacteria. PLoS Biology\u00a01(1), 101\u2013109 (2003)","journal-title":"PLoS Biology"},{"issue":"11","key":"7_CR12","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1093\/bioinformatics\/15.11.909","volume":"15","author":"D. Sankoff","year":"1999","unstructured":"Sankoff, D.: Genome rearrangement with gene families. Bioinformatics\u00a015(11), 909\u2013917 (1999)","journal-title":"Bioinformatics"},{"key":"7_CR13","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/11554714_2","volume-title":"Comparative Genomics","author":"D. Sankoff","year":"2005","unstructured":"Sankoff, D., Haque, L.: Power boosts for cluster tests. In: McLysaght, A., Huson, D.H. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03678, pp. 11\u201320. Springer, Heidelberg (2005)"},{"volume-title":"Theory of Linear and Integer Programming","year":"1998","author":"A. Schrijver","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, Chichester (1998)","key":"7_CR14"},{"key":"7_CR15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.3233\/SAT190020","volume":"2","author":"H.M. Sheini","year":"2006","unstructured":"Sheini, H.M., Sakallah, K.A.: Pueblo: A hybrid pseudo-boolean SAT solver. Journal on Satisfiability, Boolean Modeling and Computation\u00a02, 165\u2013189 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11864127_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T09:05:51Z","timestamp":1587200751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11864127_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540445296","9783540445302"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11864127_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}
