Simulation study of a tree similarity measure based on small subtree counts

Mindaugas  Bloznelis; Irmantas  Radavičius

doi:10.15388/LMR.2009.64

Articles

Mindaugas Bloznelis

Vilnius University

Irmantas Radavičius

Vilnius University

Published 2009-12-20

https://doi.org/10.15388/LMR.2009.64

PDF

Keywords

tree comparison
Galton–Watson tree

How to Cite

Bloznelis M. and Radavičius I. (2009) “Simulation study of a tree similarity measure based on small subtree counts”, Lietuvos matematikos rinkinys, 50(proc. LMS), pp. 362–367. doi: 10.15388/LMR.2009.64.

Abstract

Augsten, Böhlen and Gamper [1] suggested a measure of similarity between ordered and labeled trees based on subtree counts: two trees are declared close if they contain similar number of copies of ordered and labeled subtrees of a given form, called pq-gram. We report the results of a simulation study of statistical properties of distances based on pq-grams.

PDF

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy.

Downloads

Article Views | PDF Downloads

Range Graph | Chart Graph

Most read articles by the same author(s)

Irmantas Radavičius, Mykolas Baranauskas, An empirical study of the gap sequences for Shell sort , Lietuvos matematikos rinkinys: Vol 54 (2013): Ser. A
Mindaugas Bloznelis, Irmantas Radavičius, On hamiltonicity of uniform random intersection graphs , Lietuvos matematikos rinkinys: Vol 51 (2010)
Mindaugas Bloznelis, Irmantas Radavičius, An empirical study of the structure of the shortest path tree , Lietuvos matematikos rinkinys: Vol 48 (2008)