{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:11Z","timestamp":1725663371980},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_39","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:07:37Z","timestamp":1330204057000},"page":"472-486","source":"Crossref","is-referenced-by-count":1,"title":["Complexity issues in tree-based version control"],"prefix":"10.1007","author":[{"given":"Naomi","family":"Nishimura","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"Richard M. M. Karp","year":"1975","unstructured":"Richard M. Karp, \u201cOn the Complexity of Combinatorial Problems,\u201d Networks, 5, pp. 45\u201368, 1975.","journal-title":"Networks"},{"key":"39_CR2","unstructured":"Naomi Nishimura, \u201cComplexity Issues In Tree-Based Version Control,\u201d Technical Report 212\/88, Master's Thesis, University of Toronto, 1988."},{"key":"39_CR3","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1109\/TSE.1975.6312866","volume":"SE-1","author":"Marc J. J. Rochkind","year":"1975","unstructured":"Marc J. Rochkind, \u201cThe Source Code Control System,\u201d IEEE Transactions on Software Engineering\nSE-1, pp. 364\u2013370, 1975.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"4","key":"39_CR4","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"James A. A. Storer","year":"1982","unstructured":"James A. Storer and Thomas G. Szymanski, \u201cData Compression via Textual Substitution,\u201d Journal of the Association for Computing Machinery\n29, 4, pp. 928\u2013951, October 1982.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"39_CR5","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K. Tai","year":"1979","unstructured":"Kuo-Chung Tai, \u201cThe Tree-to-Tree Correction Problem,\u201d Journal of the Association for Computing Machinery\n26, 3, pp. 422\u2013433, July 1979.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"39_CR6","unstructured":"Walter Tichy, \u201cDesign, Implementation, Evaluation of a Revision Control System,\u201d Proceedings of the 6th International Conference on Software Engineering, pp. 58\u201367, 1982."},{"issue":"4","key":"39_CR7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/357401.357404","volume":"2","author":"W. Tichy","year":"1984","unstructured":"Walter Tichy, \u201cThe String-to-String Correction Problem with Block Moves,\u201d ACM Transactions on Computer Systems\n2, 4, pp. 309\u2013321, November 1984.","journal-title":"ACM Transactions on Computer Systems"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"R. A. Wagner, \u201cOn the Complexity of the Extended String-to-String Correction Problem,\u201d Proceedings of the Seventh Annual ACM Symposium on Theory of Computing, pp. 218\u2013223, 1975.","DOI":"10.1145\/800116.803771"},{"key":"39_CR9","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. A. Wagner","year":"1974","unstructured":"R. A. Wagner and M. J. Fischer, \u201cThe String-to-String Correction Problem,\u201d Journal of the Association for Computing Machinery\n21, pp. 168\u2013173, 1974.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"39_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(81)90110-1","volume":"12","author":"Wilhelm","year":"1981","unstructured":"Wilhelm, \u201cA Modified Tree-to-Tree Correction Problem,\u201d Information Processing Letters\n12, 3, pp. 127\u2013132, 1981.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:04:38Z","timestamp":1619571878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}