{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T16:26:01Z","timestamp":1725985561923},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811310553"},{"type":"electronic","value":"9789811310560"}],"license":[{"start":{"date-parts":[[2018,7,24]],"date-time":"2018-07-24T00:00:00Z","timestamp":1532390400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-981-13-1056-0_57","type":"book-chapter","created":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T16:30:31Z","timestamp":1532363431000},"page":"581-591","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Degree of Similarity of Root Trees"],"prefix":"10.1007","author":[{"given":"Jiri","family":"Sebek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Vondrus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomas","family":"Cerny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"issue":"4","key":"57_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/A:1020499411651","volume":"5","author":"A Bookstein","year":"2002","unstructured":"Bookstein A, Kulyukin VA, Raita T (2002) Generalized hamming distance. Inf Retr 5(4):353\u2013375. https:\/\/doi.org\/10.1023\/A:1020499411651","journal-title":"Inf Retr"},{"key":"57_CR2","unstructured":"Cerny J (2010) Zakladni grafove algoritmy. http:\/\/kam.mff.cuni.cz\/~kuba\/ka\/ka.pdf"},{"key":"57_CR3","doi-asserted-by":"publisher","unstructured":"Charikar MS (2002) Similarity estimation techniques from rounding algorithms. In: Proceedings of the thiry-fourth annual ACM symposium on theory of computing, STOC \u201902. ACM, New York, NY, USA, pp 380\u2013388. https:\/\/doi.org\/10.1145\/509907.509965","DOI":"10.1145\/509907.509965"},{"key":"57_CR4","unstructured":"Chawathe SS (1999) Comparing hierarchical data in external memory. In: Proceedings of the 25th international conference on very large data bases VLDB \u201999. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 90\u2013101. http:\/\/dl.acm.org\/citation.cfm?id=645925.671669"},{"key":"57_CR5","first-page":"1","volume":"36","author":"M Dehmer","year":"2007","unstructured":"Dehmer M, Mehler A (2007) A new method of measuring similarity for a special class of directed graphs. Tatra Mt Math Publ 36:1\u201322","journal-title":"Tatra Mt Math Publ"},{"key":"57_CR6","unstructured":"Demel J (2002) Grafy a jejich aplikace, 1 edn. Academia, Praha (kveten)"},{"key":"57_CR7","unstructured":"Fr \u0301echet MR (1906) Sur quelques points du calcul fonctionnel. Rendiconti del Circolo Matematico di Palermo (1884--1940) 22(1): 1\u201372"},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"Gary CHARTRAND, Ping ZHANG, L.L (2016) Graphs & digraphs, 6th edn . Chapman & Hal-l\/CRC Press, Boca Raton","DOI":"10.1201\/b19731"},{"key":"57_CR9","doi-asserted-by":"publisher","first-page":"547","DOI":"10.5169\/seals-266450","volume":"37","author":"P Jaccard","year":"1901","unstructured":"Jaccard P (1901) Etude de la distribution florale dans une portion des alpes et du jura 37:547\u2013579. https:\/\/doi.org\/10.5169\/seals-266450","journal-title":"Etude de la distribution florale dans une portion des alpes et du jura"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"Katz J, Lindell Y (2014) Introduction to modern cryptography, 2 edn. Chapman & Hall, London","DOI":"10.1201\/b17668"},{"key":"57_CR11","doi-asserted-by":"crossref","unstructured":"Rivest R (1992) The md5 message-digest algorithm. https:\/\/www.ietf.org\/rfc\/rfc1321.txt","DOI":"10.17487\/rfc1321"},{"key":"57_CR12","doi-asserted-by":"crossref","unstructured":"Sebek J, Cerny T (2016) Aop-based approach for local data management in adaptive interfaces. In: 2016 6th international conference on IT convergence and security (ICITCS). pp 1\u20135","DOI":"10.1109\/ICITCS.2016.7740313"},{"key":"57_CR13","doi-asserted-by":"crossref","unstructured":"Sebek J, Cerny T, Richta K (2016) Adaptive application structure design for java ee applications. In: Proceedings of the international conference on research in adaptive and convergent systems. RACS \u201916, ACM, New York, NY, USA, pp 159\u2013164. http:\/\/doi.acm.org\/10.1145\/2987386.2987417","DOI":"10.1145\/2987386.2987417"},{"key":"57_CR14","unstructured":"Sebek J, Richta K (2016) Impact of users emotion on software adaptation1. Databases, Texts p. 1"},{"key":"57_CR15","doi-asserted-by":"crossref","unstructured":"Sebek J, Richta K (2016) Usage of aspect-oriented programming in adaptive application structure. New Trends Databases Inf Syst 217\u2013222","DOI":"10.1007\/978-3-319-44066-8_22"},{"key":"57_CR16","volume-title":"Uvod do teorie grafu","author":"J Sedlacek","year":"1981","unstructured":"Sedlacek J (1981) Uvod do teorie grafu, 3rd edn. Academia, Praha","edition":"3"},{"key":"57_CR17","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","volume":"6","author":"SM Selkow","year":"1977","unstructured":"Selkow SM (1977) The tree-to-tree editing problem. Inf Process Lett 6:184\u2013186. https:\/\/doi.org\/10.1016\/0020-0190(77)90064-3","journal-title":"Inf Process Lett"},{"issue":"2","key":"57_CR18","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Com- put 1(2):146\u2013160. https:\/\/doi.org\/10.1137\/0201010","journal-title":"SIAM J Com- put"},{"key":"57_CR19","unstructured":"Tekli J, Chbeir R, Y \u0301etongnon K (2007) Efficient xml structural similarity detection using sub-tree commonalities. In: SBBD. Brazil"},{"key":"57_CR20","doi-asserted-by":"crossref","unstructured":"Yang R, Kalnis P, Tung AKH (2005) Similarity evaluation on tree-structured data. In: Proceedings of the 2005 ACM SIGMOD international conference on management of data, SIGMOD \u201905. ACM, New York, NY, USA, pp 754\u2013765 http:\/\/doi.acm.org\/10.1145\/1066157.1066243","DOI":"10.1145\/1066157.1066243"},{"key":"57_CR21","unstructured":"Zhen-kun W, Wei-zong Z, Ouyang-Jie, Peng-fei L, Yi-hua D, Meng Z, Jin-hua G (2010) A robust and discriminative image perceptual hash algorithm. In: 2010 fourth international"}],"container-title":["Lecture Notes in Electrical Engineering","Information Science and Applications 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-1056-0_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T14:16:36Z","timestamp":1604672196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-1056-0_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,24]]},"ISBN":["9789811310553","9789811310560"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-1056-0_57","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2018,7,24]]}}}