{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:16:10Z","timestamp":1742969770651,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020070"},{"type":"electronic","value":"9783642020087"}],"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-02008-7_28","type":"book-chapter","created":{"date-parts":[[2009,5,13]],"date-time":"2009-05-13T13:28:14Z","timestamp":1242221294000},"page":"386-399","source":"Crossref","is-referenced-by-count":13,"title":["Sorting Signed Permutations by Inversions in O(nlogn) Time"],"prefix":"10.1007","author":[{"given":"Krister M.","family":"Swenson","sequence":"first","affiliation":[]},{"given":"Vaibhav","family":"Rajan","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Bernard M. E.","family":"Moret","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"28_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 fast linear-time algorithm for inversion distance with an experimental comparison. J. Comput. Biol.\u00a08(5), 483\u2013491 (2001)","journal-title":"J. Comput. Biol."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Bergeron, A., Heber, S., Stoye, J.: Common intervals and sorting by reversals: a marriage of necessity. In: Proc. 2nd European Conf. Comput. Biol. ECCB 2002, pp. 54\u201363 (2002)","DOI":"10.1093\/bioinformatics\/18.suppl_2.S54"},{"key":"28_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)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: Proc. 1st Int\u2019l Conf. Comput. Mol. Biol. (RECOMB 1997), pp. 75\u201383 (1997)","DOI":"10.1145\/267521.267531"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0022-5193(87)80263-1","volume":"127","author":"W.H.E. Day","year":"1987","unstructured":"Day, W.H.E., Sankoff, D.: The computational complexity of inferring phylogenies from chromosome inversion data. J. Theor. Biol.\u00a0127, 213\u2013218 (1987)","journal-title":"J. Theor. Biol."},{"key":"28_CR6","first-page":"178","volume-title":"Proc. 27th Ann. ACM Symp. Theory of Comput (STOC 1995)","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In: Proc. 27th Ann. ACM Symp. Theory of Comput (STOC 1995), pp. 178\u2013189. ACM Press, New York (1995)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-44888-8_13","volume-title":"Combinatorial Pattern Matching","author":"H. Kaplan","year":"2003","unstructured":"Kaplan, H., Verbin, E.: Efficient data structures and a new randomized approach for sorting signed permutations by reversals. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 170\u2013185. Springer, Heidelberg (2003)"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1016\/S0076-6879(05)95035-0","volume-title":"Molecular Evolution: Producing the Biochemical Data, Part B, Methods in Enzymology","author":"B.M.E. Moret","year":"2005","unstructured":"Moret, B.M.E., Warnow, T.: Advances in phylogeny reconstruction from gene order and content data. In: Zimmer, E.A., Roalson, E.H. (eds.) Molecular Evolution: Producing the Biochemical Data, Part B, Methods in Enzymology, vol.\u00a0395, pp. 673\u2013700. Elsevier, Amsterdam (2005)"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-7091-9138-5_3","volume-title":"Cell Organelles","author":"J.D. Palmer","year":"1992","unstructured":"Palmer, J.D.: Chloroplast and mitochondrial genome evolution in land plants. In: Herrmann, R. (ed.) Cell Organelles, pp. 99\u2013133. Springer, Heidelberg (1992)"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"5533","DOI":"10.1073\/pnas.78.9.5533","volume":"78","author":"J.D. Palmer","year":"1981","unstructured":"Palmer, J.D., Thompson, W.F.: Rearrangements in the chloroplast genomes of mung bean and pea. Proc. Nat\u2019l Acad. Sci., USA\u00a078, 5533\u20135537 (1981)","journal-title":"Proc. Nat\u2019l Acad. Sci., USA"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02458839","volume":"51","author":"D. Sankoff","year":"1989","unstructured":"Sankoff, D., Goldstein, M.: Probabilistic models for genome shuffling. Bull. Math. Biol.\u00a051, 117\u2013124 (1989)","journal-title":"Bull. Math. Biol."},{"issue":"3","key":"28_CR13","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM\u00a032(3), 652\u2013686 (1985)","journal-title":"J. ACM"},{"key":"28_CR14","first-page":"697","volume":"46","author":"A.H. Sturtevant","year":"1926","unstructured":"Sturtevant, A.H.: A crossover reducer in Drosophila melanogaster due to inversion of a section of the third chromosome. Biol. Zent. Bl.\u00a046, 697\u2013702 (1926)","journal-title":"Biol. Zent. Bl."},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1073\/pnas.22.7.448","volume":"22","author":"A.H. Sturtevant","year":"1936","unstructured":"Sturtevant, A.H., Dobzhansky, T.: Inversions in the third chromosome of wild races of drosophila pseudoobscura and their use in the study of the history of the species. Proc. Nat\u2019l Acad. Sci., USA\u00a022, 448\u2013450 (1936)","journal-title":"Proc. Nat\u2019l Acad. Sci., USA"},{"issue":"6\u20137","key":"28_CR16","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.dam.2005.02.033","volume":"155","author":"E. Tannier","year":"2007","unstructured":"Tannier, E., Bergeron, A., Sagot, M.-F.: Advances on sorting by reversals. Disc. Appl. Math.\u00a0155(6\u20137), 881\u2013888 (2007)","journal-title":"Disc. Appl. Math."},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-27801-6_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","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02008-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:11:29Z","timestamp":1558267889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02008-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020070","9783642020087"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02008-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}