{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T14:20:09Z","timestamp":1649082009639},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,12,12]],"date-time":"2008-12-12T00:00:00Z","timestamp":1229040000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s10115-008-0180-0","type":"journal-article","created":{"date-parts":[[2008,12,11]],"date-time":"2008-12-11T17:08:56Z","timestamp":1229015336000},"page":"301-322","source":"Crossref","is-referenced-by-count":9,"title":["Accelerating sequence searching: dimensionality reduction method"],"prefix":"10.1007","volume":"20","author":[{"given":"Guojie","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunqing","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongqing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,12]]},"reference":[{"issue":"1","key":"180_CR1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1093\/nar\/28.1.15","volume":"28","author":"DA Benson","year":"2000","unstructured":"Benson DA, Karsch-Mizrachi I, Lipman DJ, Ostell J, Rapp BA, Wheeler DL (2000) GenBank. Nucleic Acids Res 28(1): 15\u201318","journal-title":"Nucleic Acids Res"},{"key":"180_CR2","unstructured":"Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: Proc. 24th VLDB Conference (VLDB\u201997), pp 194\u2013205"},{"key":"180_CR3","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"1990","unstructured":"Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to algorithms. MIT Press, Cambridge"},{"key":"180_CR4","unstructured":"Cormode G, Muthukrishnan S (2002) The string edit distance matching problem with moves. In: Proc. of the 13th annual ACM-SIAM symposium on Discrete Algorithms, pp 667\u2013676"},{"issue":"5","key":"180_CR5","doi-asserted-by":"crossref","first-page":"1316","DOI":"10.1109\/TKDE.2003.1232281","volume":"15","author":"Yu DanTong","year":"2003","unstructured":"DanTong Yu, Zhang A (2003) ClusterTree: integration of cluster representation and nearest-neighbor search for large data sets with high dimensions. IEEE Trans Knowl Data Eng 15(5): 1316\u20131337","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"180_CR6","unstructured":"Faloutsos C, Lin KI (1995) Fast Map: a fast algorithm for indexing, data mining and visualization of traditional and multimedia datasets. In: Proc. of the International Conference on Management of Data (SIGMOD\u201995), pp 163\u2013174"},{"key":"180_CR7","doi-asserted-by":"crossref","unstructured":"Filho RFS, Traina AJM, Traina C, Faloutsos C (2001) Similarity search without tears: the OMNI family of all-purpose access methods. In: Proc. of the 19th International Conference on Data Engineering (ICDE\u201901), pp 623\u2013630","DOI":"10.1109\/ICDE.2001.914877"},{"key":"180_CR8","volume-title":"Matrix computations","author":"GH Golub","year":"1989","unstructured":"Golub GH, Van Loan CF (1989) Matrix computations. The Johns Hopkins University Press, Baltimore"},{"key":"180_CR9","unstructured":"Gravano L, Ipeirotis PG, Jagadish HV, Tolga Bozkaya N, Ozsoyoglu M (1997) Distance-based indexing for high-dimensional metric spaces. In: Proc. of the International Conference on Management of Data (SIGMOD\u201997), pp 357\u2013368"},{"key":"180_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on sequences, trees and sequences: computer science and computational biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield D (1997) Algorithms on sequences, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge"},{"key":"180_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1904-8","volume-title":"Principal component analysis","author":"IT Jolliffe","year":"1986","unstructured":"Jolliffe IT (1986) Principal component analysis. Springer, Berlin"},{"key":"180_CR12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10115-007-0097-z","volume":"15","author":"S Kadiyala","year":"2007","unstructured":"Kadiyala S, Shiri N (2007) A compact multi-resolution index for variable length queries in time series databases. Knowl Info Syst 15: 131\u2013147","journal-title":"Knowl Info Syst"},{"key":"180_CR13","doi-asserted-by":"crossref","unstructured":"Karp RM, Miller RE, Rosenberg AL (1972) Rapid identification of repeated patterns in strings, trees and arrays. In: Proc. of the 4th Symposium on Theory of Computing, pp 125\u2013136","DOI":"10.1145\/800152.804905"},{"issue":"3","key":"180_CR14","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/s10115-004-0154-9","volume":"7","author":"E Keogh","year":"2005","unstructured":"Keogh E, Ann RC (2005) Exact indexing of dynamic time warping. Knowl Info Syst 7(3): 358\u2013386","journal-title":"Knowl Info Syst"},{"issue":"3","key":"180_CR15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011669","volume":"3","author":"E Keogh","year":"2001","unstructured":"Keogh E, Chakrabarti K, Mehrotra S, Pazzani M (2001) Dimensionality reduction for fast similarity search in large databases. Knowl Info Syst 3(3): 263\u2013286","journal-title":"Knowl Info Syst"},{"key":"180_CR16","unstructured":"Lee S, Chun S, Kim D (2000) Similarity search for multidimensional data sequences. In: Proc. of the 16th Int\u2019l Conf. on Data Engineering. IEEE Computer Society, Washington, pp 599\u2013608"},{"issue":"2","key":"180_CR17","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/301970.301973","volume":"46","author":"M Li","year":"1999","unstructured":"Li M, Badger JH, Xin C, Kwong S, Kearney P, Ferragina HP, Grossi R (1999) The string B-tree: a new data structure for string search in external memory and its applications. JACM 46(2): 236\u2013280","journal-title":"JACM"},{"issue":"2","key":"180_CR18","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EM McCreight","year":"1976","unstructured":"McCreight EM (1976) A space-economical suffix tree construction algorithm. JACM 23(2): 262\u2013272","journal-title":"JACM"},{"key":"180_CR19","doi-asserted-by":"crossref","unstructured":"Muthukrishnan S, Ahinalp SCS (2000) Approximate nearest neighbors and sequence comparison with block operations. In: Proceedings of the 32nd Symposium on Theory of Computing, pp 416\u2013424","DOI":"10.1145\/335305.335353"},{"issue":"1","key":"180_CR20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2000","unstructured":"Navarro G (2000) A guided tour to approximate sequence matching. ACM Comput Survey 33(1): 31\u201388","journal-title":"ACM Comput Survey"},{"issue":"1","key":"180_CR21","first-page":"205","volume":"1","author":"G Navarro","year":"2000","unstructured":"Navarro G, Baeza-Yates R (2000) A hybrid indexing method for approximate string matching. J Discret Algorithms 1(1): 205\u2013239","journal-title":"J Discret Algorithms"},{"key":"180_CR22","doi-asserted-by":"crossref","first-page":"2444","DOI":"10.1073\/pnas.85.8.2444","volume":"85","author":"W Pearson","year":"1988","unstructured":"Pearson W, Lipman D (1988) Improved tools for biological sequence comparison. Proc Natl Acad Sci USA 85: 2444\u20132488","journal-title":"Proc Natl Acad Sci USA"},{"key":"180_CR23","doi-asserted-by":"crossref","unstructured":"Popivanov I, Miller RJ (2002) Similarity search over time series data using wavelets. In: Proc. of the 18th Int\u2019l Conf. on Data Engineering, ICDE 2002. IEEE Computer Society, San Jose, pp 212\u2013221","DOI":"10.1109\/ICDE.2002.994711"},{"key":"180_CR24","doi-asserted-by":"crossref","unstructured":"Sahinalp SC, Tasan M, Macker J, Ozsoyoglu ZM (2003) Distance-based indexing for string proximity search. In: Proc. of the 19th International Conference on Data Engineering (ICDE\u201903), pp 125\u2013136","DOI":"10.1109\/ICDE.2003.1260787"},{"key":"180_CR25","doi-asserted-by":"crossref","unstructured":"Song G, Cui B, Zheng B, Xie K, Yang D (2008) Squeezing long sequence data for efficient similarity search. In: Proc. Apweb, 2008, pp 438\u2013449","DOI":"10.1007\/978-3-540-78849-2_44"},{"key":"180_CR26","doi-asserted-by":"crossref","unstructured":"Traina C, Traina AJM, Seeger B, Faloutsos C (2000) Slim-Trees: high performance metric trees minimizing overlap between nodes. In: proc. of the 7th International Conference on Extended Database Technology (EDBT\u201900), pp 51\u201365","DOI":"10.1007\/3-540-46439-5_4"},{"key":"180_CR27","unstructured":"Venkateswaran J, Lachwani D, Kahveci T, Jermaine CM (2006) Reference-based indexing of sequence databases. In: Proc. 24th VLDB Conference (VLDB\u201906), pp 906\u2013917"},{"key":"180_CR28","unstructured":"Vieira MR, Traina C, Chino FJT, Traina AJM (2004) DBM-Tree: a dynamic metric access method sensitive to local density data. Simposio Brasileiro de Bancos de Dados (SBBD\u201904), pp 163\u2013177"},{"key":"180_CR29","doi-asserted-by":"crossref","unstructured":"Wang TL, Wang X, Lin KI, Shasha D, Shapiro B, Zhang K (1999) Evaluating a class of distance-mapping algorithms for data mining and clustering. In: Proc. of the 5th ACM International Conference of Knowledge Discovery and Data Mining (SIGKDD\u201999), pp 307\u2013311","DOI":"10.1145\/312129.312264"},{"key":"180_CR30","doi-asserted-by":"crossref","unstructured":"Weiner P (1973) Linear pattern matching algorithms. In: IEEE Symposium on Switching and Automata Theory, pp 1\u201311","DOI":"10.1109\/SWAT.1973.13"},{"key":"180_CR31","unstructured":"Yianilos PN (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In: SODA, pp 311\u2013321"},{"key":"180_CR32","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1089\/10665270050081478","volume":"7","author":"Z Zhang","year":"2000","unstructured":"Zhang Z, Schwartz S, Wagner L, Miller W (2000) A greedy algorithm for aligning DNA sequences. J Comput Biol 7: 203\u2013214","journal-title":"J Comput Biol"},{"key":"180_CR33","unstructured":"http:\/\/www-db.stanford.edu\/pleiades\/SUMATRA.html"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-008-0180-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-008-0180-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-008-0180-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:10:18Z","timestamp":1559124618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-008-0180-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,12]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["180"],"URL":"https:\/\/doi.org\/10.1007\/s10115-008-0180-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,12]]}}}