{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:32Z","timestamp":1759638632461},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45995-2_30","type":"book-chapter","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T22:33:34Z","timestamp":1180478014000},"page":"319-325","source":"Crossref","is-referenced-by-count":7,"title":["An Improved Algorithm for Sequence Comparison with Block Reversals"],"prefix":"10.1007","author":[{"given":"S.","family":"Muthukrishnan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Cenk","family":"Sahinalp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"30_CR1","unstructured":"R. Agarwal, K. Lin, H. Sawhney and K. Shim. Fast similarity search in the presence of noise, scaling and translation in time-series databases. Proc. 21st VLDB conf, 1995."},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"M. Gribskov and J. Devereux Sequence Analysis Primer, Stockton Press, 1991.","DOI":"10.1007\/978-1-349-21355-9"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R. Tarjan. Fast Algorithms for Finding Nearest Common Ancestors. SIAM J. Comput., 13(2): 338\u2013355, 1984.","journal-title":"SIAM J. Comput."},{"key":"30_CR4","unstructured":"M. Jackson, T. Strachan and G. Dover. Human Genome Evolution, Bios Scientific Publishers, 1996."},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"R. Karp, R. Miller and A. Rosenberg, Rapid Identification of Repeated Patterns in Strings, Trees, and Arrays, Proceedings of ACM Symposium on Theory of Computing, (1972).","DOI":"10.1145\/800152.804905"},{"issue":"1","key":"30_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(96)00268-X","volume":"181","author":"D. Lopresti","year":"1997","unstructured":"D. Lopresti and A. Tomkins. Block Edit Models for Approximate String Matching. Theoretical Computer Science, 181(1): 159\u2013179, 1997.","journal-title":"Theoretical Computer Science"},{"key":"30_CR7","volume-title":"Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison","author":"D. Sanko","year":"1983","unstructured":"D. Sanko. and J. Kruskal, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley, Reading, Mass., 1983."},{"issue":"8","key":"30_CR8","first-page":"707","volume":"10","author":"V. I. Levenshtein","year":"1966","unstructured":"V. I. Levenshtein, Binary Codes Capable of Correcting Deletions, Insertions and Reversals, Cybernetics and Control Theory, 10(8):707\u2013710, 1966.","journal-title":"Cybernetics and Control Theory"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"S. Muthukrishnan and S. C. Sahinalp, Approximate Nearest Neighbors and Sequence Comparison with Block Operations, Proceedings of ACM Symposium on Theory of Computing, 2000.","DOI":"10.1145\/335305.335353"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"P. Sellers","year":"1980","unstructured":"P. Sellers, The Theory and Computation of Evolutionary Distances: Pattern Recognition. Journal of Algorithms, 1, (1980):359\u2013373.","journal-title":"Journal of Algorithms"},{"key":"30_CR11","unstructured":"J. A. Storer, Data Compression, Methods and Theory. Computer Science Press, 1988."},{"issue":"4","key":"30_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/357401.357404","volume":"2","author":"W. F. Tichy","year":"1984","unstructured":"W. F. Tichy, The String-to-String Correction Problem with Block Moves. ACM Trans. on Computer Systems, 2(4): 309\u2013321, 1984.","journal-title":"ACM Trans. on Computer Systems"},{"issue":"3","key":"30_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"J. Ziv and A. Lempel, A Universal Algorithm for Sequential Data Compression IEEE Trans. on Information Theory, 337\u2013343, 1977.","journal-title":"IEEE Transactions on Information Theory"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"P. Weiner Linear Pattern Matching Algorithms. Proc. IEEE Foundations of Computer Science (FOCS), 1\u201311, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:30:23Z","timestamp":1556440223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}