{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:31:15Z","timestamp":1725535875132},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642032226"},{"type":"electronic","value":"9783642032233"}],"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-03223-3_2","type":"book-chapter","created":{"date-parts":[[2009,7,29]],"date-time":"2009-07-29T05:53:14Z","timestamp":1248846794000},"page":"13-23","source":"Crossref","is-referenced-by-count":0,"title":["Constraint Programming Models for Transposition Distance Problem"],"prefix":"10.1007","author":[{"given":"Ulisses","family":"Dias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K., Wallace, M.: Constraints Logic Programming using Eclipse. Cambridge (2007)","DOI":"10.1017\/CBO9780511607400"},{"issue":"2","key":"2_CR2","first-page":"239","volume":"12","author":"V. Bafna","year":"1995","unstructured":"Bafna, V., Pevzner, P.A.: Sorting by reversals: Genome rearrangements in plant organelles and evolutionary history of X chromosome. Molecular Biology and Evolution\u00a012(2), 239\u2013246 (1995)","journal-title":"Molecular Biology and Evolution"},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V. Bafna","year":"1998","unstructured":"Bafna, V., Pevzner, P.A.: Sorting by Transpositions. SIAM Journal on Discrete Mathematics\u00a011(2), 224\u2013240 (1998)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-540-73437-6_15","volume-title":"Combinatorial Pattern Matching","author":"M. Beno\u00eet-Gagn\u00e9","year":"2007","unstructured":"Beno\u00eet-Gagn\u00e9, M., Hamel, S.: A New and Faster Method of Sorting by Transpositions. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 131\u2013141. Springer, Heidelberg (2007)"},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1090\/dimacs\/047\/10","volume":"47","author":"A. Caprara","year":"1999","unstructured":"Caprara, A., Lancia, G., Ng, S.-K.: A Column-Generation Based Branch-and-Bound Algorithm for Sorting by Reversals. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, The American Mathematical Society\u00a047, 213\u2013226 (1999)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science, The American Mathematical Society"},{"key":"2_CR6","unstructured":"Caprara, A., Lancia, G., Ng, S.-K.: Sorting Permutations by Reversals through Branch-and-Price. Technical Report OR-99-1, DEIS - Operations Research Group, University of Bologna (1999)"},{"key":"2_CR7","first-page":"12","volume-title":"Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms (SODA 2000)","author":"A. Caprara","year":"2000","unstructured":"Caprara, A., Lancia, G., Ng, S.-K.: Fast Practical Solution of Sorting by Reversals. In: Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms (SODA 2000), San Francisco, USA, pp. 12\u201321. ACM Press, New York (2000)"},{"key":"2_CR8","unstructured":"Christie, D.A.: Genome Rearrangement Problems. PhD thesis, Glasgow University (1998)"},{"key":"2_CR9","unstructured":"Dias, Z., Souza, C.: Polynomial-sized ILP Models for Rearrangement Distance Problems. In: BSB 2007 Poster Proceedings (2007)"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1073\/pnas.22.7.448","volume":"22","author":"T. Dobzhansky","year":"1936","unstructured":"Dobzhansky, T., Sturtevant, A.H.: Inversions in the third chromosome of wild races of Drosophila pseudoobscura, and their use in the study of the history of the species. Proceedings of the National Academy of Science\u00a022, 448\u2013450 (1936)","journal-title":"Proceedings of the National Academy of Science"},{"key":"2_CR11","unstructured":"The Eclipse Constraint Programming System (March 2009), http:\/\/www.eclipse-clp.org"},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1109\/TCBB.2006.44","volume":"3","author":"I. Elias","year":"2006","unstructured":"Elias, I., Hartmn, T.: A 1.375-Approximation Algorithm for Sorting by Transpositions. IEEE\/ACM Trans. Comput. Biol. Bioinformatics\u00a03(4), 369\u2013379 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"issue":"1-3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0012-365X(01)00150-9","volume":"241","author":"H. Eriksson","year":"2001","unstructured":"Eriksson, H., Eriksson, K., Karlander, J., Svensson, L., W\u00e4stlund, J.: Sorting a Bridge Hand. Discrete Math.\u00a0241(1-3), 289\u2013300 (2001)","journal-title":"Discrete Math."},{"key":"2_CR14","unstructured":"Fortuna, V.J.: Dist\u00e2ncias de transposi\u00e7\u00e3o entre genomas. Master\u2019s thesis, Institute of Computing, University of Campinas (2005)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming Cabbage into Turnip (Polynomial Algorithm for Sorting Signed Permutations by Reversals). In: Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, Las Vegas, USA, May 1995, pp. 178\u2013189 (1995)","DOI":"10.1145\/225058.225112"},{"key":"2_CR16","first-page":"581","volume-title":"Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS 1995)","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming Men into Mice (Polynomial Algorithm for Genomic Distance Problem). In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), October 1995, pp. 581\u2013592. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"2_CR17","first-page":"156","volume-title":"A Simpler 1.5-approximation Algorithm for Sorting by Transpositions","author":"T. Hartman","year":"2003","unstructured":"Hartman, T., Sharan, R.: A Simpler 1.5-approximation Algorithm for Sorting by Transpositions, pp. 156\u2013169. Springer, Heidelberg (2003)"},{"key":"2_CR18","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-85557-6_8","volume-title":"Advances in Bioinformatics and Computational Biology","author":"R.A. Hausen","year":"2008","unstructured":"Hausen, R.A., Faria, L., Figueiredo, C.M.H., Kowada, L.A.B.: On the toric graph as a tool to handle the problem of sorting by transpositions. In: Bazzan, A.L.C., Craven, M., Martins, N.F. (eds.) BSB 2008. LNCS (LNBI), vol.\u00a05167, pp. 79\u201391. Springer, Heidelberg (2008)"},{"key":"2_CR19","first-page":"604","volume-title":"Proceedings of the 6th Annual Symposium on Discrete Algorithms","author":"J.D. Kececioglu","year":"1995","unstructured":"Kececioglu, J.D., Ravi, R.: Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation. In: Proceedings of the 6th Annual Symposium on Discrete Algorithms, January 1995, pp. 604\u2013613. ACM Press, New York (1995)"},{"issue":"4","key":"2_CR20","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1109\/TCBB.2006.56","volume":"3","author":"A. Labarre","year":"2006","unstructured":"Labarre, A.: New Bounds and Tractable Instances for the Transposition Distance. IEEE\/ACM Trans. Comput. Biol. Bioinformatics\u00a03(4), 380\u2013394 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"key":"2_CR21","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints: An Introduction","author":"K. Marriott","year":"1998","unstructured":"Marriott, K., Stuckey, P.J.: Programming with Constraints: An Introduction. MIT Press, Cambridge (1998)"},{"key":"2_CR22","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-85557-6_11","volume-title":"Advances in Bioinformatics and Computational Biology","author":"C.V.G. Mira","year":"2008","unstructured":"Mira, C.V.G., Dias, Z., Santos, H.P., Pinto, G.A., Walter, M.E.: Transposition Distance Based on the Algebraic Formalism. In: Bazzan, A.L.C., Craven, M., Martins, N.F. (eds.) BSB 2008. LNCS (LNBI), vol.\u00a05167, pp. 115\u2013126. Springer, Heidelberg (2008)"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF02143500","volume":"27","author":"J.D. Palmer","year":"1988","unstructured":"Palmer, J.D., Herbon, L.A.: Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence. Journal of Molecular Evolution\u00a027, 87\u201397 (1988)","journal-title":"Journal of Molecular Evolution"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Walter, M.E.M.T., Dias, Z., Meidanis, J.: A New Approach for Approximating the Transposition Distance. In: Proceedings of the String Processing and Information Retrieval (SPIRE 2000) (September 2000)","DOI":"10.1109\/SPIRE.2000.878196"}],"container-title":["Lecture Notes in Computer Science","Advances in Bioinformatics and Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03223-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T15:13:34Z","timestamp":1558451614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03223-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642032226","9783642032233"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03223-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}