{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:55Z","timestamp":1725512035674},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540717003"},{"type":"electronic","value":"9783540717010"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71701-0_103","type":"book-chapter","created":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T15:31:38Z","timestamp":1182353498000},"page":"921-931","source":"Crossref","is-referenced-by-count":1,"title":["A Practical Method for Approximate Subsequence Search in DNA Databases"],"prefix":"10.1007","author":[{"given":"Jung-Im","family":"Won","sequence":"first","affiliation":[]},{"given":"Sang-Kyoon","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Jee-Hee","family":"Yoon","sequence":"additional","affiliation":[]},{"given":"Sanghyun","family":"Park","sequence":"additional","affiliation":[]},{"given":"Sang-Wook","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"103_CR1","doi-asserted-by":"crossref","unstructured":"Califano, A., Rigoutso, I.: FLASH: A Fast Look-up Algorithm for String Homology. In: Proc. Intelligent System Conference for Morecular Biology, pp. 56\u201364 (1993)","DOI":"10.1109\/CVPR.1993.341106"},{"issue":"3","key":"103_CR2","first-page":"273","volume":"11","author":"C. Fondrat","year":"1995","unstructured":"Fondrat, C., Dessen, P.: A Rapid Access Motif database(RAMdb) with a search algorithm for the retrieval patterns in nucleic acids or proteun databanks. Computer Applications in the Biosciences\u00a011(3), 273\u2013279 (1995)","journal-title":"Computer Applications in the Biosciences"},{"key":"103_CR3","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."},{"key":"103_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"issue":"3","key":"103_CR5","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":"103_CR6","unstructured":"Kahveci, T., Singh, A.K.: An Efficient Index Structure for String Databases. In: Proc. VLDB Conference, pp. 351\u2013360 (2001)"},{"key":"103_CR7","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":"103_CR8","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":"103_CR9","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":"103_CR10","doi-asserted-by":"crossref","unstructured":"Tata, S., Hankins, R., Patel, J.: Practical Suffix Tree Construction. In: Proc. VLDB Conference, pp. 36\u201347 (2004)","DOI":"10.1016\/B978-012088469-8.50007-3"},{"key":"103_CR11","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":"103_CR12","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"},{"key":"103_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/11430919_26","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"J.I. Won","year":"2005","unstructured":"Won, J.I., et al.: A Novel Indexing Method for Efficient Sequence Matching in Large DNA Database Environment. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 203\u2013215. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71701-0_103.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:25:02Z","timestamp":1605763502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71701-0_103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540717003","9783540717010"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71701-0_103","relation":{},"subject":[]}}