{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T11:19:19Z","timestamp":1774437559619,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540573012","type":"print"},{"value":"9783540480471","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57301-1_5","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:42:26Z","timestamp":1330260146000},"page":"69-84","source":"Crossref","is-referenced-by-count":1003,"title":["Efficient similarity search in sequence databases"],"prefix":"10.1007","author":[{"given":"Rakesh","family":"Agrawal","sequence":"first","affiliation":[]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[]},{"given":"Arun","family":"Swami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"5_CR1","unstructured":"R. Agrawal, T. Imielinski, and A. Swami, \u201cDatabase Mining: A Performance Perspective\u201d, IEEE Transactions on Knowledge and Data Engineering, Special issue on Learning and Discovery in Knowledge-Based Databases, (to appear)."},{"key":"5_CR2","unstructured":"R. Agrawal, S. Ghosh, T. Imielinski, B. Iyer, and A. Swami, \u201cAn Interval Classifier for Database Mining Applications\u201d, VLDB 92, Vancouver, August 1992."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami, \u201cMining Association Rules between Sets of Items in Large Databases\u201d, ACM SIGMOD, Washington D.C., May 1993.","DOI":"10.1145\/170035.170072"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"S.F. Altschul, W. Gish, W. Miller, E.W. Myers and D.J. Lipman, \u201cA Basic Local Alignment Search Tool\u201d Journal of Molecular Biology, 1990.","DOI":"10.1016\/S0022-2836(05)80360-2"},{"issue":"3","key":"5_CR5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"F. Aurenhammer, \u201cVoronoi Diagrams \u2014 A Survey of a Fundamental Geometric Data Structure\u201d ACM Computing Surveys 23(3):345\u2013405, Sept. 1991.","journal-title":"ACM Computing Surveys"},{"issue":"10","key":"5_CR6","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. Baeza-Yates","year":"1992","unstructured":"Ricardo Baeza-Yates and Gaston H. Gonnet, \u201cA New Approach to Text Searching\u201d, Comm. of ACM, 35 10, Oct. 1992, 74\u201382.","journal-title":"Comm. of ACM"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, \u201cThe R*-tree: an efficient and robust access method for points and rectangles\u201d, ACM SIGMOD, pages 322\u2013331, May 1990.","DOI":"10.1145\/93597.98741"},{"issue":"4","key":"5_CR8","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/146370.146374","volume":"24","author":"L. G. Brown","year":"1992","unstructured":"L. G. Brown, \u201cA Survey of Image Registration Techniques\u201d, ACM Computing Surveys, 24(4), pages 325\u2013376, December 1992.","journal-title":"ACM Computing Surveys"},{"key":"5_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-2921-1","volume-title":"The Analysis of Time Series: an Introduction","author":"C. Chatfield","year":"1984","unstructured":"C. Chatfield, The Analysis of Time Series: an Introduction, Chapman and Hall, London & New York, 1984, Third Edition.","edition":"Third Edition"},{"key":"5_CR10","volume-title":"Technical Analysis of Stock Trends","author":"R. D. Edwards","year":"1966","unstructured":"R. D. Edwards and J. Magee, Technical Analysis of Stock Trends, John Magee, Springfield, Massachusetts, 1966, 5th Edition, second printing.","edition":"5th Edition"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"K. Fukunaga, Introduction to Statistical Pattern Recognition, Academic Press, 1990, 2nd Edition.","DOI":"10.1016\/B978-0-08-047865-4.50007-7"},{"key":"5_CR12","unstructured":"A. Gelb, Applied Optimal Estimation, MIT Press, 1986."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"A. Guttman, \u201cR-trees: a dynamic index structure for spatial searching\u201d, Proc. ACM SIGMOD, pages 47\u201357, June 1984.","DOI":"10.1145\/602259.602266"},{"key":"5_CR14","unstructured":"Richard Wesley Hamming, Digital Filters, Prentice-Hall Signal Processing Series, Englewood Cliffs, N.J., 1977."},{"issue":"2","key":"5_CR15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/TPAMI.1979.4766900","volume":"PAMI-1","author":"G. M. Hunter","year":"1979","unstructured":"G. M. Hunter and K. Steiglitz, \u201cOperations on images using quad trees\u201d, IEEE Trans. on PAMI, PAMI-1(2):145\u2013153, April 1979.","journal-title":"IEEE Trans. on PAMI"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"H. V. Jagadish, \u201cSpatial search with polyhedra\u201d, Proc. Sixth IEEE Int'l Conf. on Data Engineering, February 1990.","DOI":"10.1109\/ICDE.1990.113483"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"H. V. Jagadish, \u201cA retrieval technique for similar shapes\u201d, Proc. ACM SIGMOD Conf. pages 208\u2013217, May 1991.","DOI":"10.1145\/115790.115821"},{"issue":"4","key":"5_CR18","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1145\/99935.99949","volume":"15","author":"D. Lomet","year":"1990","unstructured":"D. Lomet and B. Salzberg, \u201cThe Hb-Tree: a Multiattribute Indexing Method with Good Guaranteed Performance\u201d, ACM TODS, 15(4), pages 625\u2013658, December 1990.","journal-title":"ACM TODS"},{"key":"5_CR19","volume-title":"Fractal Geometry of Nature","author":"B. Mandelbrot","year":"1977","unstructured":"B. Mandelbrot. Fractal Geometry of Nature, W.H. Freeman, New York, 1977."},{"issue":"3","key":"5_CR20","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/45945.48027","volume":"6","author":"A. Motro","year":"1988","unstructured":"A. Motro, \u201cVAGUE: A User Interface to Relational Databases that Permits Vague Queries,\u201d ACM Trans. on Information Systems (TOIS), 6(3), pages 187\u2013214, July 1988.","journal-title":"ACM Trans. on Information Systems (TOIS)"},{"issue":"1","key":"5_CR21","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"J. Nievergelt, H. Hinterberger, and K. C. Sevcik, \u201cThe grid file: an adaptable, symmetric multikey file structure\u201d, ACM TODS, 9(1):38\u201371, March 1984.","journal-title":"ACM TODS"},{"key":"5_CR22","volume-title":"Digital Signal Processing","author":"A. V. Oppenheim","year":"1975","unstructured":"A. V. Oppenheim and R. W. Schafer, Digital Signal Processing, Prentice-Hall, Englewood Cliffs, N.J., 1975."},{"key":"5_CR23","volume-title":"M.Sc. scholarly paper","author":"M. Otterman","year":"1992","unstructured":"M. Otterman, \u201cApproximate Matching with High Dimensionality R-trees\u201d, M.Sc. scholarly paper, Dept. of Computer Science, Univ. of Maryland, College Park, MD, 1992."},{"key":"5_CR24","unstructured":"G. Salton and M.J. McGill, Introduction to Modern Information Retrieval, McGraw-Hill, 1983."},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, 1989.","DOI":"10.1007\/3-540-52208-5_28"},{"key":"5_CR26","volume-title":"Fractals, Chaos, Power Laws: Minutes From an Infinite Paradise","author":"M. Schroeder","year":"1991","unstructured":"M. Schroeder, Fractals, Chaos, Power Laws: Minutes From an Infinite Paradise, W.H. Freeman and Company, New York, 1991."},{"issue":"2","key":"5_CR27","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/96105.96111","volume":"8","author":"D. Shasha","year":"1990","unstructured":"D. Shasha and T-L. Wang, \u201cNew techniques for best-match retrieval\u201d, ACM TOIS, 8(2):140\u2013158, April 1990.","journal-title":"ACM TOIS"},{"key":"5_CR28","unstructured":"R. Stam and R. Snodgrass, \u201cA Bibliography on Temporal Databases\u201d, IEEE Bulletin on Data Engineering, 11(4), Dec. 1988."},{"issue":"4","key":"5_CR29","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/103085.103089","volume":"34","author":"G. K. Wallace","year":"1991","unstructured":"G. K. Wallace \u201cThe JPEG Still Picture Compression Standard\u201d, CACM, 34(4):31\u201344, April 1991.","journal-title":"CACM"},{"issue":"10","key":"5_CR30","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"Sun Wu and Udi Manber, \u201cText searching allowing errors\u201d, Comm. of ACM (CACM), 35(10):83\u201391, October 1992.","journal-title":"Comm. of ACM (CACM)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Data Organization and Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57301-1_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:05Z","timestamp":1605647465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57301-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573012","9783540480471"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-57301-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}