{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T00:26:46Z","timestamp":1777854406546,"version":"3.51.4"},"reference-count":23,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2006,4,1]],"date-time":"2006-04-01T00:00:00Z","timestamp":1143849600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Information Science"],"published-print":{"date-parts":[[2006,4]]},"abstract":"<jats:p>Exact match queries, wildcard match queries, and k mismatch queries are widely used in various molecular biology applications including the searching of ESTs (Expressed Sequence Tags) and DNA transcription factors. In this paper, we suggest an efficient indexing and processing mechanism for such queries. Our indexing method places a sliding window at every possible location of a DNA sequence and extracts its signature by considering the occurrence frequency of each nucleotide. It then stores a set of signatures using a multi-dimensional index such as the R*-tree. Also, by assigning a weight to each position of a window, it prevents signatures from being concentrated around a few spots in indexing space. Our query processing method converts a query sequence into a multi-dimensional rectangle and searches the index for the signatures overlapping with the rectangle. Experiments with real biological data sets have revealed that the proposed approach is at least 4.4 times, 2.1 times, and several orders of magnitude faster than the previous one in performing exact match, wildcard match, and k-mismatch queries, respectively.<\/jats:p>","DOI":"10.1177\/0165551506062329","type":"journal-article","created":{"date-parts":[[2006,3,21]],"date-time":"2006-03-21T10:17:46Z","timestamp":1142936266000},"page":"176-190","source":"Crossref","is-referenced-by-count":3,"title":["An efficient DNA sequence searching method using position specific weighting scheme"],"prefix":"10.1177","volume":"32","author":[{"given":"Woo-Cheol","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanghyun","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jung-Im","family":"Won","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Yonsei University, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Wook","family":"Kim","sequence":"additional","affiliation":[{"name":"College of Information and Communications, Hanyang University, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jee-Hee","family":"Yoon","sequence":"additional","affiliation":[{"name":"Division of Information Engineering and Telecommunications, Hallym                         University, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2006,4,1]]},"reference":[{"key":"atypb1","volume-title":"Developing Bioinformatics Computer Skills","author":"C. Gibas","year":"2001"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/25.17.3389"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80360-2"},{"key":"atypb5","first-page":"351","volume-title":"Proceedings of the 27th International Conference on Very Large Databases (VLDB01) 11\u201314 September 2001","author":"T. Kaheci"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1142\/2418"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"issue":"1","key":"atypb12","first-page":"191","volume":"56","author":"V. Makinen","year":"2003","journal-title":"Fundamenta Informaticae"},{"key":"atypb13","first-page":"420","volume-title":"Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM04) 5\u20137 July 2004","author":"V. Makinen"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-40996-3_35"},{"key":"atypb15","first-page":"47","volume-title":"Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data (ACM SIGMOD) 18\u201321 June 2004","author":"A. Guttman"},{"key":"atypb16","first-page":"69","volume-title":"Proceedings of the 4th International Conference of Foundations of Data Organization and Algorithms (FODO93) 13\u201315 October 1993","author":"R. Agrawal"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1002\/spe.535"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1007\/s007780200064"},{"key":"atypb19","first-page":"91","volume-title":"Proceedings of the 36th Annual ACM Symposium on Theory of computing (STOC04) 9\u201311 June 2003","author":"R. Cole"},{"key":"atypb20","first-page":"794","volume-title":"Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete algorithms(SODA00) 9\u201311 January 2000","author":"A. Amir"},{"key":"atypb21","first-page":"28","volume-title":"Proceedings of the 22nd International Conference on Very Large Databases (VLDB96) 3\u20136 September 1996","author":"S. Berchtold"},{"key":"atypb22","volume-title":"The Entrez Nucleotides Database"},{"key":"atypb23","volume-title":"The Ensembl Project"}],"container-title":["Journal of Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0165551506062329","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0165551506062329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T23:07:06Z","timestamp":1777504026000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0165551506062329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["10.1177\/0165551506062329"],"URL":"https:\/\/doi.org\/10.1177\/0165551506062329","relation":{},"ISSN":["0165-5515","1741-6485"],"issn-type":[{"value":"0165-5515","type":"print"},{"value":"1741-6485","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4]]}}}