{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:38:13Z","timestamp":1760402293365,"version":"build-2065373602"},"reference-count":20,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T00:00:00Z","timestamp":1588118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>Tree comparisons are used in various areas with various statistical or dissimilarity measures. Given that data in various domains are diverse, and a particular comparison approach could be more appropriate for specific applications, there is a need to evaluate different comparison approaches. As gathering real data is often an extensive task, using generated trees provides a faster evaluation of the proposed solutions. This paper presents three algorithms for generating random trees: parametrized by tree size, shape based on the node distribution and the amount of difference between generated trees. The motivation for the algorithms came from unordered trees that are created from class hierarchies in object-oriented programs. The presented algorithms are evaluated by statistical and dissimilarity measures to observe stability, behavior, and impact on node distribution. The results in the case of dissimilarity measures evaluation show that the algorithms are suitable for tree comparison.<\/jats:p>","DOI":"10.3390\/computers9020035","type":"journal-article","created":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T13:23:45Z","timestamp":1588166625000},"page":"35","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generating Trees for Comparison"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5248-7223","authenticated-orcid":false,"given":"Danijel","family":"Mlinari\u0107","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, 10000 Zagreb, Croatia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9611-8497","authenticated-orcid":false,"given":"Vedran","family":"Mornar","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, 10000 Zagreb, Croatia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7889-3131","authenticated-orcid":false,"given":"Boris","family":"Mila\u0161inovi\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, 10000 Zagreb, Croatia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,4,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/21.286387","article-title":"Exact and approximate algorithms for unordered tree matching","volume":"24","author":"Shasha","year":"1994","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1093\/bioinformatics\/6.4.309","article-title":"Comparing multiple RNA secondary structures using tree comparisons","volume":"6","author":"Shapiro","year":"1990","journal-title":"Bioinformatics"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Hashimoto, M., and Mori, A. (2008, January 15\u201318). Diff\/TS: A Tool for Fine-Grained Structural Change Analysis. Proceedings of the 2008 15th Working Conference on Reverse Engineering, Antwerp, Belgium.","DOI":"10.1109\/WCRE.2008.44"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1145\/235968.233366","article-title":"Change Detection in Hierarchically Structured Information","volume":"25","author":"Chawathe","year":"1996","journal-title":"SIGMOD Rec."},{"key":"ref_5","unstructured":"Russell, S., and Norvig, P. (2009). Artificial Intelligence: A Modern Approach, Prentice Hall Press. [3rd ed.]."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Valiente, G. (2002). Algorithms on Trees and Graphs, Springer-Verlag.","DOI":"10.1007\/978-3-662-04921-1"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"52489","DOI":"10.1109\/ACCESS.2020.2981260","article-title":"Tree Inheritance Distance","volume":"8","author":"Mornar","year":"2020","journal-title":"IEEE Access"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","article-title":"The tree-to-tree editing problem","volume":"6","author":"Selkow","year":"1977","journal-title":"Inf. Process. Lett."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","article-title":"Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems","volume":"18","author":"Zhang","year":"1989","journal-title":"SIAM J. Comput."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","article-title":"A survey of graph edit distance","volume":"13","author":"Gao","year":"2010","journal-title":"Pattern Anal. Appl."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Riesen, K. (2016). Structural Pattern Recognition with Graph Edit Distance: Approximation Algorithms and Applications, Springer Publishing Company. [1st ed.].","DOI":"10.1142\/9789814656535_0015"},{"key":"ref_12","unstructured":"(2019, July 24). A Libre Lightweight Streaming Front-End for Android.: TeamNewPipe\/NewPipe. Available online: https:\/\/github.com\/TeamNewPipe\/NewPipe."},{"key":"ref_13","unstructured":"(2019, October 09). Graphviz\u2014Graph Visualization Software. Available online: https:\/\/www.graphviz.org\/."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0025-5564(74)90013-3","article-title":"Cutting down recursive trees","volume":"21","author":"Meir","year":"1974","journal-title":"Math. Biosci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/321105.321108","article-title":"Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting","volume":"9","author":"Hibbard","year":"1962","journal-title":"J. ACM"},{"key":"ref_16","unstructured":"Knuth, D.E. (2013). Art of Computer Programming, Volume 4, Fascicle 4, The: Generating All Trees\u2013History of Combinatorial Generation, Addison-Wesley Professional."},{"key":"ref_17","unstructured":"Aragon, C.R., and Seidel, R.G. (November, January 30). Randomized Search Trees. Proceedings of the 30th Annual Symposium on Foundations of Computer Science (SFCS\u201989), Research Triangle Park, NC, USA."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/274787.274812","article-title":"Randomized Binary Search Trees","volume":"45","author":"Roura","year":"1998","journal-title":"J. ACM"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Frieze, A., and Karo\u0144ski, M. (2015). Introduction to Random Graphs, Cambridge University Press.","DOI":"10.1017\/CBO9781316339831"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B. (2001). Random Graphs, Cambridge University Press. [2nd ed.].","DOI":"10.1017\/CBO9780511814068"}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/9\/2\/35\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T13:32:16Z","timestamp":1760362336000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/9\/2\/35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,29]]},"references-count":20,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2020,6]]}},"alternative-id":["computers9020035"],"URL":"https:\/\/doi.org\/10.3390\/computers9020035","relation":{},"ISSN":["2073-431X"],"issn-type":[{"type":"electronic","value":"2073-431X"}],"subject":[],"published":{"date-parts":[[2020,4,29]]}}}