{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:37Z","timestamp":1725565237484},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152931"},{"type":"electronic","value":"9783642152948"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15294-8_9","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T04:51:46Z","timestamp":1284094306000},"page":"102-110","source":"Crossref","is-referenced-by-count":2,"title":["Listing All Sorting Reversals in Quadratic Time"],"prefix":"10.1007","author":[{"given":"Krister M.","family":"Swenson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ghada","family":"Badr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Sankoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45784-4_23","volume-title":"Algorithms in Bioinformatics","author":"Y. Ajana","year":"2002","unstructured":"Ajana, Y., Lefebvre, J.-F., Tillier, E.R.M., El-Mabrouk, N.: Exploring the set of all minimal sequences of reversals - an application to test the replication-directed reversal hypothesis. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 300\u2013315. Springer, Heidelberg (2002)"},{"key":"#cr-split#-9_CR2.1","doi-asserted-by":"crossref","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(5), 483\u2013491 (2001);","DOI":"10.1089\/106652701753216503"},{"key":"#cr-split#-9_CR2.2","unstructured":"A preliminary version appeared in WADS 2001, pp. 365\u2013376"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Baudet, C., Dias, Z.: An Improved Algorithm to Enumerate All Traces that Sort a Signed Permutation by Reversals. In: SIGAPP 2010: Proceedings of the Twenty Fifth Symposium on Applied Computing (2010)","DOI":"10.1145\/1774088.1774416"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.dam.2004.04.010","volume":"146","author":"A. Bergeron","year":"2005","unstructured":"Bergeron, A.: A very elementary presentation of the Hannenhalli\u2013Pevzner theory. Discrete Applied Mathematics\u00a0146(2), 134\u2013145 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR5","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":"9_CR6","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-72031-7_27","volume-title":"Bioinformatics Research and Applications","author":"M.D.V. Braga","year":"2007","unstructured":"Braga, M.D.V., Sagot, M., Scornavacca, C., Tannier, E.: The Solution Space of Sorting by Reversals. In: M\u0103ndoiu, I.I., Zelikovsky, A. (eds.) ISBRA 2007. LNCS (LNBI), vol.\u00a04463, pp. 293\u2013304. Springer, Heidelberg (2007)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1009838309166","volume":"3","author":"A. Caprara","year":"1999","unstructured":"Caprara, A.: On the tightness of the alternating-cycle lower bound for sorting by reversals. J. Combin. Optimization\u00a03, 149\u2013182 (1999)","journal-title":"J. Combin. Optimization"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1109\/SFCS.1995.492588","volume-title":"Proc. 36th Ann. IEEE Symp. Foundations of Comput. Sci. (FOCS 1995)","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming mice into men (polynomial algorithm for genomic distance problems). In: Proc. 36th Ann. IEEE Symp. Foundations of Comput. Sci. (FOCS 1995), pp. 581\u2013592. IEEE Press, Piscataway (1995)"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S. Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. J. ACM\u00a046(1), 1\u201327 (1999)","journal-title":"J. ACM"},{"issue":"3","key":"9_CR10","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.: Faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Computing\u00a029(3), 880\u2013892 (1999)","journal-title":"SIAM J. Computing"},{"key":"9_CR11","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":"9_CR12","doi-asserted-by":"crossref","unstructured":"Lefebvre, J.-F., El-Mabrouk, N., Tillier, E.R.M., Sankoff, D.: Detection and validation of single gene inversions. In: Proc. 11th Int\u2019l. Conf. on Intelligent Systems for Mol. Biol. (ISMB 2003). Bioinformatics, vol.\u00a019, pp. i190\u2013i196. Oxford U. Press (2003)","DOI":"10.1093\/bioinformatics\/btg1025"},{"issue":"5","key":"9_CR13","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1089\/cmb.2006.13.1005","volume":"13","author":"D. Sankoff","year":"2006","unstructured":"Sankoff, D., Haque, L.: The distribution of genomic distance between random genomes. Journal of Computational Biology\u00a013(5), 1005\u20131012 (2006)","journal-title":"Journal of Computational Biology"},{"key":"9_CR14","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-32290-0_8","volume-title":"Comparative Genomics","author":"D. Sankoff","year":"2005","unstructured":"Sankoff, D., Lefebvre, J.-F., Tillier, E.R.M., Maler, A., El-Mabrouk, N.: The distribution of inversion lengths in bacteria. In: Lagergren, J. (ed.) RECOMB-WS 2004. LNCS (LNBI), vol.\u00a03388, pp. 97\u2013108. Springer, Heidelberg (2005)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Siepel, A.C.: An algorithm to find all sorting reversals. In: Proc. 6th Ann. Int\u2019l. Conf. Comput. Mol. Biol. (RECOMB 2002). ACM Press, New York (2002)","DOI":"10.1145\/565196.565233"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-02008-7_28","volume-title":"Research in Computational Molecular Biology","author":"K.M. Swenson","year":"2009","unstructured":"Swenson, K.M., Rajan, V., Lin, Y., Moret, B.M.E.: Sorting signed permutations by inversions in O(n logn) time. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol.\u00a05541, pp. 386\u2013399. Springer, Heidelberg (2009)"},{"key":"9_CR17","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-87989-3_18","volume-title":"Comparative Genomics","author":"K.M. Swenson","year":"2008","unstructured":"Swenson, K.M., Lin, Y., Rajan, V., Moret, B.M.E.: Hurdles hardly have to be heeded. In: Nelson, C.E., Vialette, S. (eds.) RECOMB-CG 2008. LNCS (LNBI), vol.\u00a05267, pp. 239\u2013249. Springer, Heidelberg (2008)"},{"issue":"6-7","key":"9_CR18","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-7), 881\u2013888 (2007)","journal-title":"Disc. Appl. Math."},{"key":"9_CR19","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.: 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)"},{"issue":"1","key":"9_CR20","first-page":"5","volume":"1","author":"Y. Yang","year":"2009","unstructured":"Yang, Y., Szkely, L.A.: On the expectation and variance of reversal distance. Acta Univ. Sapientiae, Mathematica\u00a01(1), 5\u201320 (2009)","journal-title":"Acta Univ. Sapientiae, Mathematica"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15294-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T06:57:04Z","timestamp":1559631424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15294-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152931","9783642152948"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15294-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}