{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T05:34:17Z","timestamp":1734068057485,"version":"3.30.2"},"reference-count":28,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/csb.2002.1039343","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T23:34:26Z","timestamp":1056584066000},"page":"207-216","source":"Crossref","is-referenced-by-count":2,"title":["Accelerating approximate subsequence search on large protein sequence databases"],"prefix":"10.1109","author":[{"family":"Jiong Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Wei Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Yi Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.S.","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511790492"},{"journal-title":"Fundamentals of Database Systems","year":"1994","author":"elmasri","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743441"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/301970.301973"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/299432.299477","article-title":"Sequence homology detection through large scale pattern discovery","author":"floratos","year":"1999","journal-title":"Proc ACM Recomb"},{"journal-title":"Algorithms on Strings Trees and Sequences Computer Science and Computational Biology","year":"0","author":"gusfield","key":"ref15"},{"key":"ref16","first-page":"139","article-title":"A database index to large biological sequences","author":"hunt","year":"2001","journal-title":"Proc of VLDB"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321946"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2451-9_10"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185432"},{"key":"ref28","article-title":"Index for approximate search on large string databases","author":"yang","year":"2002","journal-title":"IBM Research Report"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380250203"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/25.17.3389"},{"key":"ref6","article-title":"Final report of the CU-Denver mathematics clinic: Lead compound optimization using gene expression profiling","author":"billups","year":"2001","journal-title":"Mathematics Clinic Report MC01 S001"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-58094-8_18","article-title":"Proximity matching using fixed-queries trees","author":"baeza-yates","year":"1994","journal-title":"Proc Combinatorial Pattern Matching"},{"key":"ref8","first-page":"77","article-title":"q-gram based database searching using a suffix array (QUASAR)","author":"burkhardt","year":"1999","journal-title":"Proc ACM Recomb"},{"key":"ref7","first-page":"69","article-title":"Finding motifs using random projections","author":"buhler","year":"2001","journal-title":"Proc ACM Recomb"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0076-6879(96)66029-7"},{"journal-title":"Introduction to Algorithms","year":"1990","author":"cormen","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1990.9999"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"ref22","first-page":"21","article-title":"A hybrid indexing method for approximate string matching","volume":"1","author":"navarro","year":"2000","journal-title":"J of Discrete Algorithms"},{"key":"ref21","first-page":"350","article-title":"Indexing text with approximate q-grams","author":"navarro","year":"2000","journal-title":"CPM2000 LNCS 1848"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/369133.369220"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0034-6"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90143-4"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/14.1.55"}],"event":{"name":"IEEE Computer Society Bioinformatics Conference","acronym":"CSB-02","location":"Stanford, CA, USA"},"container-title":["Proceedings. IEEE Computer Society Bioinformatics Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8059\/22276\/01039343.pdf?arnumber=1039343","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T02:20:51Z","timestamp":1734056451000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1039343\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/csb.2002.1039343","relation":{},"subject":[]}}