{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:54:54Z","timestamp":1725512094824},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_5","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"59-69","source":"Crossref","is-referenced-by-count":0,"title":["Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons"],"prefix":"10.1007","author":[{"given":"Xiaowen","family":"Lou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daming","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_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. J. Comput. Biol.\u00a08, 483\u2013491 (2001)","journal-title":"J. Comput. Biol."},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45749-6_21","volume-title":"Algorithms - ESA 2002","author":"P. Berman","year":"2002","unstructured":"Berman, P., Hannenhalli, S., Karpinki, M.: 1.375-approximation algorithm for sorting by reversals. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 200\u2013210. Springer, Heidelberg (2002)"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V. Bafna","year":"1998","unstructured":"Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discrete Math.\u00a011, 272\u2013289 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: Proc. 1st Annu. Int. Conf. Res. Comput. Mol. Biol. (RECOMB 1997), pp. 75\u201383 (1997)","DOI":"10.1145\/267521.267531"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/S0304-3975(01)00338-3","volume":"289","author":"N. Eriksen","year":"2002","unstructured":"Eriksen, N.: (1\u2009+\u2009\u03b5)-approximation of sorting by reversals and transpositions. Theor. Comput. Sci.\u00a0289, 517\u2013529 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In: Proc. 27th Annu. ACM Symp. Theory Computing (STOC 1995), pp. 178\u2013189 (1995)","DOI":"10.1145\/225058.225112"},{"key":"5_CR7","unstructured":"Hannenhalli, S., Pevzner, P.A.: To cut ... or not to cut (applications of comparative physical maps in molecular evolution). In: Proc. 7th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA 1996), pp. 304\u2013313 (1996)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Combinatorial Pattern Matching","author":"E. Tannier","year":"2004","unstructured":"Tannier, E., Sagot, M.-F.: Sorting by Reversals in Subquadratic Time. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 1\u201313. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:27Z","timestamp":1619522067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_5","relation":{},"subject":[]}}