{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:10:02Z","timestamp":1737504602533,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_40","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"481-492","source":"Crossref","is-referenced-by-count":9,"title":["Permutation Editing and Matching via Embeddings"],"prefix":"10.1007","author":[{"given":"Graham","family":"Cormode","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00fcleyman Cenk","family":"Sahinalp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"40_CR1","first-page":"148","volume-title":"Proceedings of the 34th Annual Symposium on Foundations of Comptuer Science","author":"V. Bafna","year":"1993","unstructured":"V. Bafna and P. A. Pevzner. Genome rearrangements and sorting by reversals. In Proceedings of the 34th Annual Symposium on Foundations of Comptuer Science, pages 148\u2013157, Palo Alto, CA, 1993. IEEE Computer Society Press."},{"issue":"2","key":"40_CR2","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V. Bafna","year":"1998","unstructured":"Vineet Bafna and Pavel A. Pevzner. Sorting by transpositions. SIAM Journal on Discrete Mathematics, 11(2):224\u2013240, May 1998.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"A. Caprara. Sorting by reversals is difficult. In Proceedings of the First International Conference on Computational Molecular Biology, pages 75\u201383, 1997.","DOI":"10.1145\/267521.267531"},{"key":"40_CR4","unstructured":"David A. Christie. A 3\/2-approximation algorithm for sorting by reversals. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 244\u2013252, San Francisco, California, 25-27 January 1998."},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan. An approximate L1-difference algorithm for massive data streams. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 501\u2013511, 1999.","DOI":"10.1109\/SFFCS.1999.814623"},{"key":"40_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-61258-0_13","volume-title":"Combinatorial Pattern Matching, 7th Annual Symposium","author":"V. Ferretti","year":"1996","unstructured":"Vincent Ferretti, Joseph H. Nadeau, and David Sankoff. Original synteny. In Combinatorial Pattern Matching, 7th Annual Symposium, volume 1075 of Lecture Notes in Computer Science, pages 159\u2013167. Springer, 1996."},{"key":"40_CR7","first-page":"386","volume-title":"Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"L. A. Goldberg","year":"1999","unstructured":"Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel Pevzner, S\u00fcleyman Cenk Sahinalp, and Elizabeth Sweedyk. The complexity of gene placement. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 386\u2013395, N.Y., January 17-19 1999. ACM-SIAM."},{"issue":"2","key":"40_CR8","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0304-3975(98)00092-9","volume":"210","author":"Q.-P. Gu","year":"1999","unstructured":"Qian-Ping Gu, Shietung Peng, and Hal Sudborough. A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theoretical Computer Science, 210(2):327\u2013339, 17 January 1999.","journal-title":"Theoretical Computer Science"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 604\u2013613, 1998.","DOI":"10.1145\/276698.276876"},{"issue":"2","key":"40_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(93)90177-B","volume":"48","author":"H. Karloff","year":"1993","unstructured":"Howard Karloff. Fast algorithms for approximately counting mismatches. Information Processing Letters, 48(2):53\u201360, November 1993.","journal-title":"Information Processing Letters"},{"issue":"1\/2","key":"40_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01188586","volume":"13","author":"J. Kececioglu","year":"1995","unstructured":"J. Kececioglu and D. Sankoff. Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica, 13(1\/2):180\u2013210, January 1995.","journal-title":"Algorithmica"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Effiient search for approximate nearest neighbor in high dimensional spaces. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 614\u2013623, 1998.","DOI":"10.1145\/276698.276877"},{"key":"40_CR13","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1073\/pnas.81.3.814","volume":"81","author":"J. H. Nadeau","year":"1984","unstructured":"J. H. Nadeau and B. A. Taylor. Lengths of chromosome segments conserved since divergence of man and mouse. Proc. Nat\u2019l Acad. Sci. USA, 81:814\u2013818, 1984.","journal-title":"Proc. Nat\u2019l Acad. Sci. USA"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"D. Sankoff and J. Nadeau. Conserved synteny as a measure of genomic distance. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 71, 1996.","DOI":"10.1016\/S0166-218X(96)00067-4"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:49:11Z","timestamp":1737503351000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_40","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}