{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:35:56Z","timestamp":1725564956980},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260769"},{"type":"electronic","value":"9783540319351"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11430919_26","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T06:06:46Z","timestamp":1283839606000},"page":"203-215","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Indexing Method for Efficient Sequence Matching in Large DNA Database Environment"],"prefix":"10.1007","author":[{"given":"Jung-Im","family":"Won","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jee-Hee","family":"Yoon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanghyun","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Wook","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S. Altschul","year":"1990","unstructured":"Altschul, S., Gish, W., Miller, W., Myers, E., Lipman, D.: Basic local alignment search tool. Journal of Molecular Biology\u00a0215, 403\u2013410 (1990)","journal-title":"Journal of Molecular Biology"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: Proc. ACM SIGMOD International Conference on Management of Data, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/nar\/26.1.1","volume":"26","author":"D.A. Benson","year":"1998","unstructured":"Benson, D.A., Boguski, M.S., Lipman, D.J., Ostell, J., Quellette, B.F.: Genbank. Nucleic Acids Research\u00a026(1), 1\u20137 (1998)","journal-title":"Nucleic Acids Research"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Bieganski, P., Riedl, J., Carlis, J.V.: Generalized suffix trees for biological sequence data: applications and implementation. In: Proc. Hawaii International Conference on System Sciences (1994)","DOI":"10.1109\/HICSS.1994.323593"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1093\/nar\/27.11.2369","volume":"27","author":"A.L. Delcher","year":"1999","unstructured":"Delcher, A.L., Kasif, S., Fleischmann, R.D., Peterson, J., White, O., Salzberg, S.L.: Alignment of whole genomes. Nucleic Acids Research\u00a027, 2369\u20132376 (1999)","journal-title":"Nucleic Acids Research"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1002\/spe.535","volume":"33","author":"R. Giegerich","year":"2003","unstructured":"Giegerich, R., Kurtz, S., Stoye, J.: Efficient Implementation of Lazy Suffix Trees. Softw. Pract. Exp.\u00a033, 1035\u20131049 (2003)","journal-title":"Softw. Pract. Exp."},{"issue":"2","key":"26_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1093\/bioinformatics\/17.2.180","volume":"17","author":"R.S.C. Goble","year":"2001","unstructured":"Goble, R.S.C., Baker, P., Brass: A Classification of tasks in bioinformatics. Bioinformatics\u00a017(2), 180\u2013188 (2001)","journal-title":"Bioinformatics"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s007780200064","volume":"11","author":"E. Hunt","year":"2002","unstructured":"Hunt, E., Atkinson, M.P., Irving, R.W.: Database indexing for large DNA and protein sequence collections. VLDB Journal\u00a011(3), 256\u2013271 (2002)","journal-title":"VLDB Journal"},{"key":"26_CR9","unstructured":"Kelly, K., Labute, P.: The A* Search and Applications to Sequence Alignment (1996), http:\/\/www.chemcomp.com\/article\/astar.htm"},{"issue":"5","key":"26_CR10","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1093\/bioinformatics\/15.5.426","volume":"15","author":"S. Kurtz","year":"1999","unstructured":"Kurtz, S., Schleiermacher, C.: REPuter: fast computation of maximal repeats in complete genomes. Bioinformatics\u00a015(5), 426\u2013427 (1999)","journal-title":"Bioinformatics"},{"issue":"22","key":"26_CR11","doi-asserted-by":"publisher","first-page":"4633","DOI":"10.1093\/nar\/29.22.4633","volume":"29","author":"S. Kurtz","year":"2001","unstructured":"Kurtz, S., Choudhuri, J., Ohlebusch, E., Schleiermacher, C., Stoye, J., Giegerich, R.: REPuter: the manifold applications of repeat analysis on a genome scale. Nucleic Acids Research\u00a029(22), 4633\u20134642 (2001)","journal-title":"Nucleic Acids Research"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Meek, C., Patel, J.M., Kasetty, S.: OASIS: An Online and Accurate Technique for Local-Alignment Searches on Biological sequences. In: Proc. VLDB Conference, pp. 920\u2013921 (2003)","DOI":"10.1016\/B978-012722442-8\/50085-9"},{"issue":"1","key":"26_CR13","first-page":"205","volume":"1","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Baeza-Yates, R.: A Hybrid Indexing Method for Approximate String Matching. Journal of Discrete ALgorithms\u00a01(1), 205\u2013239 (2000)","journal-title":"Journal of Discrete ALgorithms"},{"key":"26_CR14","unstructured":"http:\/\/www.ncbi.nlm.nih.gov"},{"issue":"4","key":"26_CR15","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1109\/69.536247","volume":"8","author":"H. Shang","year":"1996","unstructured":"Shang, H., Merrett, T.H.: Tries for approximate string matching. IEEE Trans. on Knowledge and Data Engineering\u00a08(4), 540\u2013547 (1996)","journal-title":"IEEE Trans. on Knowledge and Data Engineering"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T. Smith","year":"1981","unstructured":"Smith, T., Waterman, M.: Identification of Common Molecular Subsequences. Journal of Molecular Biology\u00a0147, 195\u2013197 (1981)","journal-title":"Journal of Molecular Biology"},{"key":"26_CR17","doi-asserted-by":"crossref","DOI":"10.1142\/2418","volume-title":"String Searching Algorithms","author":"G.A. Stephen","year":"1994","unstructured":"Stephen, G.A.: String Searching Algorithms. World Scientific Publishing, Singapore (1994)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Ukkonen, E.: Approximate string matching over suffix trees. In: Proc. Combinatorial Pattern Matching, pp. 228\u2013242 (1993)","DOI":"10.1007\/BFb0029808"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Wang, H., et al.: BLAST++: A Tool for BLASTing Queries in Batches. In: Proc. Asia-Pacific Bioinformatics Conference, pp. 71\u201379 (2003)","DOI":"10.1093\/bioinformatics\/btg310"},{"issue":"1","key":"26_CR20","first-page":"63","volume":"14","author":"H.E. Williams","year":"2002","unstructured":"Williams, H.E., Zobel, J.: Indexing and Retrieval for Genomic Databases. IEEE TKDE\u00a014(1), 63\u201378 (2002)","journal-title":"IEEE TKDE"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11430919_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:57:35Z","timestamp":1605643055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11430919_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260769","9783540319351"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11430919_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}