{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:11:10Z","timestamp":1742379070236},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540720300"},{"type":"electronic","value":"9783540720317"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72031-7_27","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T14:16:24Z","timestamp":1186323384000},"page":"293-304","source":"Crossref","is-referenced-by-count":12,"title":["The Solution Space of Sorting by Reversals"],"prefix":"10.1007","author":[{"given":"Mar\u00edlia D. V.","family":"Braga","sequence":"first","affiliation":[]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[]},{"given":"Celine","family":"Scornavacca","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Tannier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_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., et al.: 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)"},{"issue":"5","key":"27_CR2","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 distances between signed permutations with an experimental study. J. Comput. Biol.\u00a08(5), 483\u2013491 (2001)","journal-title":"J. Comput. Biol."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Berard, S., et al.: Perfect sorting by reversals is not always difficult. To appear in IEEE transactions on bioinformatics and computational biology (2006)","DOI":"10.1109\/TCBB.2007.1011"},{"key":"27_CR4","unstructured":"Bergeron, A., et al.: On the properties of sequences of reversals that sort a signed permutation. In: JOBIM 2002, pp. 99\u2013108 (2002)"},{"key":"27_CR5","volume-title":"Mathematics of evolution and phylogeny","author":"A. Bergeron","year":"2005","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: The inversion distance problem. In: Gascuel, O. (ed.) Mathematics of evolution and phylogeny, Oxford University Press, Oxford (2005)"},{"key":"27_CR6","volume-title":"STOC \u201991: Proceedings of the twenty-third annual ACM symposium on Theory of computing","author":"G. Brightwell","year":"1991","unstructured":"Brightwell, G., Winkler, P.: Counting linear extensions is #P-complete. In: STOC \u201991: Proceedings of the twenty-third annual ACM symposium on Theory of computing, ACM Press, New York (1991)"},{"volume-title":"The book of traces","year":"1995","key":"27_CR7","unstructured":"Diekert, V., Rozenberg, G. (eds.): The book of traces. World Scientific, Singapore (1995)"},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","first-page":"42","volume-title":"Computing and Combinatorics","author":"Y. Diekmann","year":"2005","unstructured":"Diekmann, Y., Sagot, M.F., Tannier, E.: Evolution under reversals: parsimony and preservation of common intervals. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 42\u201351. Springer, Heidelberg (2005)"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A Decomposition Theorem for Partially Ordered Sets. Annuals of Mathematics\u00a051, 161\u2013166 (1950)","journal-title":"Annuals of Mathematics"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"701","DOI":"10.2307\/2033375","volume":"7","author":"D.R. Fulkerson","year":"1956","unstructured":"Fulkerson, D.R.: Note on Dilworth\u2019s decomposition theorem for partially ordered sets. Proc. Amer. Math. Soc.\u00a07, 701\u2013702 (1956)","journal-title":"Proc. Amer. Math. Soc."},{"key":"27_CR11","volume-title":"Proceedings of The 2006 International Conference on Bioinformatics and Computational Biology","author":"Y. Han","year":"2006","unstructured":"Han, Y.: Improving the Efficiency of Sorting by Reversals. In: Proceedings of The 2006 International Conference on Bioinformatics and Computational Biology, CSREA Press, Las Vegas (2006)"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S. Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Journal of the ACM\u00a046, 1\u201327 (1999)","journal-title":"Journal of the ACM"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1109\/TSMCC.2005.855522","volume":"36","author":"Z. Li","year":"2006","unstructured":"Li, Z., Wang, L., Zhang, K.: Algorithmic approaches for genome rearrangement: a review. IEEE transactions on systems, man and cybernetics\u00a036, 636\u2013648 (2006)","journal-title":"IEEE transactions on systems, man and cybernetics"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1089\/10665270360688200","volume":"10","author":"A. Siepel","year":"2003","unstructured":"Siepel, A.: An algorithm to enumerate sorting reversals for signed permutations. J. Comput. Biol.\u00a010, 575\u2013597 (2003)","journal-title":"J. Comput. Biol."},{"issue":"6","key":"27_CR15","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0167-6377(86)90071-4","volume":"5","author":"G. Steiner","year":"1986","unstructured":"Steiner, G.: An algorithm to generate the ideals of a partial order. Operations Research Letters\u00a05(6), 317\u2013320 (1986)","journal-title":"Operations Research Letters"},{"key":"27_CR16","first-page":"71","volume":"75","author":"G. Steiner","year":"1990","unstructured":"Steiner, G.: Polynomial algorithms to count linear extensions in certain posets. Congressus Numerantium\u00a075, 71\u201390 (1990)","journal-title":"Congressus Numerantium"},{"key":"27_CR17","unstructured":"Tannier, E., Bergeron, A., Sagot, M.-F.: Advances on Sorting by Reversals. To appear in Discrete Applied Mathematics (2006), a preliminary version appeared in: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 42\u201351. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72031-7_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T17:58:39Z","timestamp":1684000719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72031-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540720300","9783540720317"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72031-7_27","relation":{},"subject":[]}}