{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T21:43:16Z","timestamp":1711489396679},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T00:00:00Z","timestamp":1274227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s10489-010-0233-4","type":"journal-article","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T19:00:11Z","timestamp":1274209211000},"page":"21-38","source":"Crossref","is-referenced-by-count":1,"title":["A hash trie filter method for approximate string matching in\u00a0genomic databases"],"prefix":"10.1007","volume":"33","author":[{"given":"Ye-In","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiun-Rung","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min-Tze","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,19]]},"reference":[{"issue":"3","key":"233_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"SF Altschul","year":"1990","unstructured":"Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ (1990) Basic local alignment search tool. J Mol Biol 215(3):403\u2013410","journal-title":"J Mol Biol"},{"issue":"10","key":"233_CR2","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R Baeza-Yates","year":"1992","unstructured":"Baeza-Yates R, Gonnet G (1992) A new approach to text searching. Commun ACM 35(10):74\u201382","journal-title":"Commun ACM"},{"issue":"4","key":"233_CR3","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01185431","volume":"12","author":"W Chang","year":"1994","unstructured":"Chang W, Lawler E (1994) Sublinear approximate string matching and biological applications. Algorithmica 12(4):327\u2013344","journal-title":"Algorithmica"},{"key":"233_CR4","doi-asserted-by":"crossref","unstructured":"Chang W, Marr T (1994) Approximate string matching and local similarity. In: 5th annual symposium on combinatorial pattern matching, pp\u00a0259\u2013273","DOI":"10.1007\/3-540-58094-8_23"},{"issue":"4","key":"233_CR5","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1109\/TPAMI.2008.197","volume":"31","author":"S Dobri\u0161ek","year":"2009","unstructured":"Dobri\u0161ek S, \u017dibert J, Pave\u0161i\u0107 N, Miheli\u010d F (2009) An edit-distance model for the approximate matching of timed strings. IEEE Trans Pattern Anal Mach Intell 31(4):736\u2013741","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"7","key":"233_CR6","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1016\/j.jcss.2007.03.007","volume":"73","author":"M Farach-Colton","year":"2007","unstructured":"Farach-Colton M, Landau GM, Sahinalp SC, Tsur D (2007) Identification of common molecular subsequences. J Comput Syst Sci 73(7):1035\u20131044","journal-title":"J Comput Syst Sci"},{"key":"233_CR7","unstructured":"Friedberg EC, Walker GC, Siede W (1995) DNA repair and mutagenesis. American Society Microbiology, America"},{"key":"233_CR8","unstructured":"Houle JL, Cadigan W, Henry S, Pinnamaneni A, Lundahl S (2000) Database Mining in the Human Genome Initiative. Available at: http:\/\/www.biodatabases.com\/whitepaper01.html . Accessed 2 Sept. 2009"},{"key":"233_CR9","unstructured":"Hunt E, Atkinson MP, Irving RW (2001) A database index to large biological sequences. In: 27th conference on very large databases, pp\u00a0139\u2013148"},{"issue":"1","key":"233_CR10","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/s007780200064","volume":"10","author":"E Hunt","year":"2002","unstructured":"Hunt E, Atkinson MP, Irving RW (2002) Database indexing for large DNA and protein sequence collections. VLDB J 10(1):256\u2013271","journal-title":"VLDB J"},{"key":"233_CR11","doi-asserted-by":"crossref","unstructured":"Hyyro H, Pinzon Y, Shinohara A (2005) Fast bit-vector algorithms for approximate string matching under indel distance. In: 31st annual conference on current trends in theory and practice of informatics, pp\u00a0380\u2013384","DOI":"10.1007\/978-3-540-30577-4_44"},{"key":"233_CR12","doi-asserted-by":"crossref","unstructured":"Karkkainen J, Na JC (2007) Faster filters for approximate string matching. In: Workshop on algorithm engineering and experiments, pp\u00a01\u20137","DOI":"10.1137\/1.9781611972870.8"},{"key":"233_CR13","doi-asserted-by":"crossref","unstructured":"Lee HP, Tsai YT, CY Tang (2004) A seriate coverage filtration approach for homology search. In: ACM symposium on applied computing, pp\u00a0180\u2013184","DOI":"10.1145\/967900.967937"},{"issue":"4693","key":"233_CR14","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1126\/science.2983426","volume":"227","author":"DJ Lipman","year":"1985","unstructured":"Lipman DJ, Pearson WR (1985) Rapid and sensitive protein similarity searches. Science 227(4693):1435\u20131441","journal-title":"Science"},{"issue":"3","key":"233_CR15","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1093\/bioinformatics\/18.3.440","volume":"18","author":"B Ma","year":"2002","unstructured":"Ma B, Tromp J, Li M (2002) PatternHunter: faster and more sensitive homology search. Bioinformatics 18(3):440\u2013445","journal-title":"Bioinformatics"},{"issue":"2","key":"233_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1242524.1242529","volume":"32","author":"A Mazeika","year":"2007","unstructured":"Mazeika A, B\u00f6hlen MH, Koudas N, Srivastava D (2007) Estimating the selectivity of approximate string queries. ACM Trans Database Syst 32(2):1\u201340","journal-title":"ACM Trans Database Syst"},{"issue":"3","key":"233_CR17","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46","author":"G Myers","year":"1999","unstructured":"Myers G (1999) A fast bit-vector algorithm for approximate string matching based on dynamic programming. J ACM 46(3):395\u2013415","journal-title":"J ACM"},{"key":"233_CR18","doi-asserted-by":"crossref","unstructured":"Navarro G (1997) Multiple approximate string matching by counting. In: 4th south American workshop on string processing, pp\u00a095\u2013111","DOI":"10.1515\/9780773591400-012"},{"issue":"1","key":"233_CR19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro G (2001) A guided tour to approximate string matching. ACM Comput Surv 33(1):31\u201388","journal-title":"ACM Comput Surv"},{"key":"233_CR20","doi-asserted-by":"crossref","unstructured":"Navarro G, Sutinen E, Tanninen J, Tarhio J (2000) Indexing text with approximate q-grams. In: 11th annual symposium on combinatorial pattern matching, pp\u00a0350\u2013363","DOI":"10.1007\/3-540-45123-4_29"},{"issue":"1","key":"233_CR21","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"TF Smith","year":"1995","unstructured":"Smith TF, Waterman MS (1995) Identification of common molecular subsequences. J Mol Biol 147(1):195\u2013197","journal-title":"J Mol Biol"},{"key":"233_CR22","doi-asserted-by":"crossref","unstructured":"Sutinen E, Tarhio J (1995) On using q-gram locations in approximate string matching. In: 3th annual European symposium on algorithms, pp\u00a0327\u2013340","DOI":"10.1007\/3-540-60313-1_153"},{"key":"233_CR23","doi-asserted-by":"crossref","unstructured":"Sutinen E, Tarhio J (1996) Filtration with q-samples in approximate string matching. In: 7th annual symposium on combinatorial pattern matching, pp\u00a050\u201363","DOI":"10.1007\/3-540-61258-0_4"},{"issue":"4","key":"233_CR24","first-page":"321","volume":"11","author":"E Sutinen","year":"2004","unstructured":"Sutinen E, Tarhio J (2004) Approximate string matching with ordered q-grams. Nord J Comput 11(4):321\u2013343","journal-title":"Nord J Comput"},{"key":"233_CR25","doi-asserted-by":"crossref","unstructured":"Takaoka T (1994) Approximate pattern matching with samples. In: 5th international symposium on algorithms and computation, pp\u00a0234\u2013242","DOI":"10.1007\/3-540-58325-4_186"},{"issue":"1","key":"233_CR26","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","volume":"6","author":"E Ukkonen","year":"1985","unstructured":"Ukkonen E (1985) Finding approximate patterns in strings. J Algorithms 6(1):132\u2013137","journal-title":"J Algorithms"},{"issue":"1","key":"233_CR27","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E Ukkonen","year":"1992","unstructured":"Ukkonen E (1992) Approximate string matching with q-grams and maximal matches. Theor Comput Sci 92(1):191\u2013211","journal-title":"Theor Comput Sci"},{"issue":"1","key":"233_CR28","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/69.979973","volume":"14","author":"HE Williams","year":"2002","unstructured":"Williams HE, Zobel J (2002) Indexing and retrieval for genomic databases. IEEE Trans Knowl Data Eng 14(1):63\u201378","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-010-0233-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-010-0233-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-010-0233-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T21:03:15Z","timestamp":1711486995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-010-0233-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,19]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["233"],"URL":"https:\/\/doi.org\/10.1007\/s10489-010-0233-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,19]]}}}