{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T16:10:39Z","timestamp":1730218239763,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1109\/eit.2008.4554351","type":"proceedings-article","created":{"date-parts":[[2008,7,3]],"date-time":"2008-07-03T10:35:23Z","timestamp":1215081323000},"page":"482-487","source":"Crossref","is-referenced-by-count":2,"title":["Method of comparing graph differencing algorithms for software differencing"],"prefix":"10.1109","author":[{"given":"Jason","family":"Stanek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suraj","family":"Kothari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Kang Gui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(95)00115-8"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021271615909"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1979.4310127"},{"year":"0","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158694"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-737140-5.50006-3"},{"key":"10","first-page":"707","article-title":"binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Physics Doklady"},{"key":"7","first-page":"1145","article-title":"a two-stage discrete optimization method for largest common subgraph problems","volume":"e82 d","author":"funabiki","year":"1999","journal-title":"IEICE Transactions on Information and Systems"},{"year":"0","key":"6"},{"key":"5","first-page":"172","article-title":"validating vlsi circuit layout by wirelist comparison","author":"ebeling","year":"1983","journal-title":"Proceedings of the IEEE International Conference on Computer Aided Design"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/34.790431"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.1992.242533"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/93542.93574"}],"event":{"name":"2008 IEEE International Conference on Electro\/Information Technology (EIT 2008)","start":{"date-parts":[[2008,5,18]]},"location":"Ames, IA, USA","end":{"date-parts":[[2008,5,20]]}},"container-title":["2008 IEEE International Conference on Electro\/Information Technology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4547422\/4554253\/04554351.pdf?arnumber=4554351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T16:45:31Z","timestamp":1489682731000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4554351\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/eit.2008.4554351","relation":{},"subject":[],"published":{"date-parts":[[2008,5]]}}}