{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T19:24:12Z","timestamp":1747164252283,"version":"3.28.0"},"reference-count":53,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icde.2003.1260787","type":"proceedings-article","created":{"date-parts":[[2004,5,13]],"date-time":"2004-05-13T14:43:37Z","timestamp":1084459417000},"page":"125-136","source":"Crossref","is-referenced-by-count":31,"title":["Distance based indexing for string proximity search"],"prefix":"10.1109","author":[{"given":"S.C.","family":"Sahinalp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Tasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Macker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.M.","family":"Ozsoyoglu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"35","doi-asserted-by":"publisher","DOI":"10.1038\/35057062"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00268-X"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276877"},{"key":"34","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Cybernetics and Control Theory"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335353"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.2.149"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838101"},{"key":"43","first-page":"516","article-title":"The A-tree: An index structure for high dimensional spaces using relative approximation","author":"sakurai","year":"2000","journal-title":"VLDB"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322237"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"40","doi-asserted-by":"crossref","DOI":"10.1038\/news020121-2","article-title":"Algorithm makes tongue tree","author":"ball","year":"2002","journal-title":"Nature"},{"key":"22","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"0","journal-title":"Proc 1999 Int l Conf Very Large Data Bases"},{"key":"23","article-title":"Approximate string joins in a database (almost) for free","author":"gravano","year":"0","journal-title":"Proc of VLDB 2001"},{"key":"24","first-page":"429","article-title":"Contrast plots and p-sphere trees: Space vs. time in nearest neighbor searches","author":"goldstein","year":"2000","journal-title":"Proc VLDB"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"journal-title":"Human Genome Evolution","year":"1996","author":"jackson","key":"28"},{"key":"29","doi-asserted-by":"crossref","DOI":"10.1101\/gr.10.5.597","article-title":"Structure of chromosomal duplications and their role in mediating human genomic disorders","volume":"10","author":"ji","year":"2000","journal-title":"Genome Research"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.4.327"},{"key":"2","article-title":"Efficient similarity search in sequence databases","author":"agrawal","year":"0","journal-title":"Proc of FODO 1993"},{"key":"1","article-title":"Nearest neighbor classification in 3D protein databases","author":"ankerst","year":"0","journal-title":"Proc ISMB 1999"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1101\/gr.GR-1871R"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253347"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1990.9999"},{"key":"5","article-title":"A database index to large biological sequences","author":"hunt","year":"0","journal-title":"Proc of VLDB Conference 2001"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63220-4_49"},{"key":"4","article-title":"Fast similarity search in the presence of noise, scaling and translation in time-series databases","author":"agarwal","year":"0","journal-title":"Proc of the VLDB Conf 1995"},{"key":"31","first-page":"351","article-title":"Efficient index structures for string databases","author":"kahveci","year":"2001","journal-title":"Proc VLDB"},{"key":"9","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/276305.276353","article-title":"High-dimensional index structures","author":"berchtold","year":"1998","journal-title":"Proc ACM SIGMOD"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/93605.98741"},{"key":"19","first-page":"582","article-title":"Content based image indexing","author":"chiueh","year":"1995","journal-title":"Proc VLDB"},{"key":"17","article-title":"Finding motifs using random projections","author":"buhler","year":"0","journal-title":"Proceedings of RECOMB 2001"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301325"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301330"},{"key":"16","first-page":"574","article-title":"Near neighbor search in large metric spaces","author":"brin","year":"1995","journal-title":"Proc VLDB"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/362003.362025"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253345"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.88.048702"},{"key":"12","article-title":"When is nearest neighbors meaningful?","author":"beyer","year":"0","journal-title":"Proc ICDT 1997"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288933"},{"key":"20","first-page":"426","article-title":"M-trees: An efficient access method for similarity search in metric space","author":"ciaccia","year":"1997","journal-title":"Proc VLDB"},{"key":"49","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/15.3.194"},{"key":"48","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1126\/science.1251186"},{"key":"44","first-page":"13","article-title":"Multidimensional access methods: Trees have grown everywhere","author":"sellis","year":"0","journal-title":"Proc 1997 Int l Conf Very Large Data Bases (VLDB)"},{"journal-title":"Data Compression Methods and Theory","year":"1988","author":"storer","key":"47"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2000.839456"},{"key":"51","first-page":"194","article-title":"A quantitative analysis and performance study for similarity search methods in high dimensional spaces","author":"weber","year":"1998","journal-title":"Proc VLDB"},{"key":"52","first-page":"311","article-title":"Data structures and algorithms for nearest neighbor search in general metric spaces","author":"yianilos","year":"1993","journal-title":"Proc ACM-SIAM symposium on Discrete algorithms"},{"key":"53","article-title":"Indexing the distance, an efficient method to KNN processing","author":"yu","year":"0","journal-title":"Proc of VLDB 2001"},{"key":"50","doi-asserted-by":"publisher","DOI":"10.1126\/science.280.5369.1540"}],"event":{"name":"19th International Conference on Data Engineering","acronym":"ICDE-03","location":"Bangalore, India"},"container-title":["Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8910\/28179\/01260787.pdf?arnumber=1260787","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T04:27:19Z","timestamp":1585801639000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1260787\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":53,"URL":"https:\/\/doi.org\/10.1109\/icde.2003.1260787","relation":{},"subject":[]}}