{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:08:16Z","timestamp":1725566896488},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262015"},{"type":"electronic","value":"9783540315629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496656_11","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T19:17:26Z","timestamp":1285442246000},"page":"116-127","source":"Crossref","is-referenced-by-count":6,"title":["The Median Problem for the Reversal Distance in Circular Bacterial Genomes"],"prefix":"10.1007","author":[{"given":"Enno","family":"Ohlebusch","sequence":"first","affiliation":[]},{"given":"Mohamed Ibrahim","family":"Abouelhoda","sequence":"additional","affiliation":[]},{"given":"Kathrin","family":"Hockel","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Stallkamp","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"D.A. Bader","year":"2001","unstructured":"Bader, D.A., Moret, B.M.E., Yan, M.: A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Journal of Computational Biology\u00a08, 483\u2013491 (2001)","journal-title":"Journal of Computational Biology"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-27801-6_29","volume-title":"Combinatorial Pattern Matching","author":"A. Bergeron","year":"2004","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: Reversal distance without hurdles and fortresses. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 388\u2013399. Springer, Heidelberg (2004)"},{"key":"11_CR3","first-page":"25","volume-title":"Proc. Genome Informatics Workshop","author":"M. Blanchette","year":"1997","unstructured":"Blanchette, M., Bourque, G., Sankoff, D.: Breakpoint phylogenies. In: Proc. Genome Informatics Workshop, pp. 25\u201334. Univ. Academy Press, Tokyo (1997)"},{"issue":"1","key":"11_CR4","first-page":"26","volume":"12","author":"B. Bourque","year":"2002","unstructured":"Bourque, B., Pevzner, P.A.: Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Research\u00a012(1), 26\u201336 (2002)","journal-title":"Genome Research"},{"key":"11_CR5","first-page":"84","volume-title":"Proc. 3rd Annual International Conference on Research in Computational Molecular Biology","author":"A. Caprara","year":"1999","unstructured":"Caprara, A.: Formulations and hardness of multiple sorting by reversals. In: Proc. 3rd Annual International Conference on Research in Computational Molecular Biology, pp. 84\u201394. ACM Press, New York (1999)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/3-540-44696-6_19","volume-title":"Algorithms in Bioinformatics","author":"A. Caprara","year":"2001","unstructured":"Caprara, A.: On the practical solution of the reversal median problem. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol.\u00a02149, pp. 238\u2013251. Springer, Heidelberg (2001)"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1093\/genetics\/23.1.28","volume":"23","author":"T. Dobzhansky","year":"1938","unstructured":"Dobzhansky, T., Sturtevant, A.H.: Inversions in the chromosomes of Drosophila pseudoobscura. Genetics\u00a023, 28\u201364 (1938)","journal-title":"Genetics"},{"issue":"6","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/gb-2000-1-6-research0011","volume":"1","author":"J.A. Eisen","year":"2000","unstructured":"Eisen, J.A., Heidelberg, J.F., White, O., Salzberg, S.L.: Evidence for symmetric chromosomal inversions around the replication origin in bacteria. Genome Biology\u00a01(6), 1\u20139 (2000)","journal-title":"Genome Biology"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"48","author":"S. Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Journal of the ACM\u00a048, 1\u201327 (1999)","journal-title":"Journal of the ACM"},{"issue":"6","key":"11_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/gb-2000-1-6-reviews0006","volume":"1","author":"D. Hughes","year":"2000","unstructured":"Hughes, D.: Evaluating genome dynamics: The constraints on rearrangements within bacterial genomes. Genome Biology\u00a01(6), 1\u20138 (2000)","journal-title":"Genome Biology"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1137\/S0097539798334207","volume":"29","author":"H. Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: A faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Comput.\u00a029(3), 880\u2013892 (1999)","journal-title":"SIAM J. Comput."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/3-540-45784-4_40","volume-title":"Algorithms in Bioinformatics","author":"B.M.E. Moret","year":"2002","unstructured":"Moret, B.M.E., Siepel, A.C., Tang, J., Liu, T.: Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 521\u2013536. Springer, Heidelberg (2002)"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1073\/pnas.81.3.814","volume":"81","author":"J.H. Nadeau","year":"1984","unstructured":"Nadeau, J.H., Taylor, B.A.: Lengths of chromosomal segments conserved since divergence of man and mouse. Proceedings of the National Academy of Sciences of the United States of America\u00a081(3), 814\u2013818 (1984)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"11_CR14","unstructured":"Pe\u2019er, I., Shamir, R.: The median problems for breakpoints are NP-complete. Technical Report TR98-071, Electronic Colloquium on Computational Complexity (1998)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-56024-6_10","volume-title":"Combinatorial Pattern Matching","author":"D. Sankoff","year":"1992","unstructured":"Sankoff, D.: Edit distance for genome comparison based on non-local operations. In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol.\u00a0644, pp. 121\u2013135. Springer, Heidelberg (1992)"},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1089\/cmb.1998.5.555","volume":"5","author":"D. Sankoff","year":"1998","unstructured":"Sankoff, D., Blanchette, M.: Multiple genome rearrangement and breakpoint phylogeny. Journal of Computational Biology\u00a05(3), 555\u2013570 (1998)","journal-title":"Journal of Computational Biology"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/3-540-44696-6_15","volume-title":"Algorithms in Bioinformatics","author":"A.C. Siepel","year":"2001","unstructured":"Siepel, A.C., Moret, B.M.E.: Finding an optimal inversion median: Experimental results. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol.\u00a02149, pp. 189\u2013203. Springer, Heidelberg (2001)"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1038\/79918","volume":"26","author":"E.R.M. Tiller","year":"2000","unstructured":"Tiller, E.R.M., Collins, R.: Genome rearrangement by replication-directed translocation. Nature Genetics\u00a026, 195\u2013197 (2000)","journal-title":"Nature Genetics"},{"key":"11_CR19","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\u20137 (1982)","journal-title":"Journal of Theoretical Biology"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496656_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T17:48:49Z","timestamp":1636566529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496656_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262015","9783540315629"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11496656_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}