{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:10:57Z","timestamp":1729631457066,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/itw.2006.1633815","type":"proceedings-article","created":{"date-parts":[[2006,5,25]],"date-time":"2006-05-25T20:26:01Z","timestamp":1148588761000},"page":"217-221","source":"Crossref","is-referenced-by-count":5,"title":["Approximating the number of differences between remote sets"],"prefix":"10.1109","author":[{"given":"S.","family":"Agarwal","sequence":"first","affiliation":[]},{"given":"A.","family":"Trachtenberg","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384004"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/SEQUEN.1997.666900"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2002.1020232"},{"key":"10","first-page":"123","article-title":"Serial computations of Levenshtein distances","author":"hirschberg","year":"1997","journal-title":"Pattern Matching Algorithms"},{"key":"7","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1090\/dimacs\/020\/08","article-title":"Graph entropy: A survey","volume":"20","author":"simonyi","year":"1995","journal-title":"Combinatorial Optimization DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/18.2639"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055607"},{"key":"4","first-page":"411","article-title":"Coding of an information source having ambiguous alphabet and the entropy of graphs","author":"ko?rner","year":"1973","journal-title":"Proc 6th Prague Conf on Information Theory"},{"key":"9","first-page":"1","article-title":"Finding similar files in a large file system","author":"manber","year":"1994","journal-title":"Proceedings of the USENIX Winter 1994 Technical Conference"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633031"}],"event":{"name":"2006 IEEE Information Theory Workshop","location":"Punta del Este, Uruguay"},"container-title":["2006 IEEE Information Theory Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10885\/34255\/01633815.pdf?arnumber=1633815","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T00:50:30Z","timestamp":1555635030000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1633815\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/itw.2006.1633815","relation":{},"subject":[]}}