{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:26:50Z","timestamp":1725481610214},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403111"},{"type":"electronic","value":"9783540448884"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44888-8_27","type":"book-chapter","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T11:34:12Z","timestamp":1173094452000},"page":"372-383","source":"Crossref","is-referenced-by-count":10,"title":["Working on the Problem of Sorting by Transpositions on Genome Rearrangements"],"prefix":"10.1007","author":[{"given":"Maria Emilia M. T.","family":"Walter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz Reginaldo A. F.","family":"Curado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adilton G.","family":"Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"key":"27_CR1","unstructured":"V. Bafna and P. Pevzner. Sorting by transpositions. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 614\u2013623, 1995."},{"key":"27_CR2","volume-title":"Genome rearrangements problems","author":"D. A. Christie","year":"1998","unstructured":"D. A. Christie. Genome rearrangements problems. PhD thesis, Glasgow University, Scotland, 1998."},{"key":"27_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45735-6_7","volume-title":"String Processing and Information Retrieval \u2014 SPIRE 2002","author":"Z. Dias","year":"2002","unstructured":"Z. Dias and J. Meidanis. Sorting by prefix transpositions. In String Processing and Information Retrieval \u2014 SPIRE 2002, 2002. Lecture Notes in Computer Science, v. 2476, 2002."},{"key":"27_CR4","unstructured":"S. A. Guyer, L. S. Heath, and J. P. C. Vergara. Subsequences and run heuristics for sorting by transpositions. In 4th Dimacs International Algorithm Implementation Challenge, 1995."},{"key":"27_CR5","unstructured":"J. Meidanis, M. E. M. T. Walter, and Z. Dias. Transposition distance of strictly decreasing sequences. In Workshop on String Processing-WSP 97, 1997."},{"key":"27_CR6","unstructured":"E. T. G. Oliveira. Implementations of algorithms to the problem of sorting by transpositions. Master\u2019s thesis, Department of Computer Science, University of Brasilia, 2001."},{"key":"27_CR7","unstructured":"J. P. C. Vergara. Sorting by Bounded Permutations. PhD thesis, Virginia Polytechnic Institute and State University, 1997."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"M. E. M. T. Walter, Z. Dias, and J. Meidanis. A new approach for approximating the transposition distance. In String Processing and Information Retrieval-SPIRE 2000, pages 199\u2013208, 2000.","DOI":"10.1109\/SPIRE.2000.878196"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44888-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T14:48:01Z","timestamp":1548082081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44888-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403111","9783540448884"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44888-8_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}