A simple method for computing all subtree repeats in unordered trees in linear time (bibtex)
by Tomas Flouri, Kassian Kobert, Solon P. Pissis and Alexandros Stamatakis
Reference:
T. Flouri, K. Kobert, S. P. Pissis, A. Stamatakis, "A simple method for computing all subtree repeats in unordered trees in linear time", in Festschrift for Borivoj Melichar, J. Holub, B. W. Watson, J. Zdarek, Eds., Czech Technical University in Prague, 2012, pp. 145-152.
Bibtex Entry:
@incollection{bob,
year={2012},
booktitle={Festschrift for Borivoj Melichar},
editor={Jan Holub and Bruce W. Watson and Jan Zdarek},
title={A simple method for computing all subtree repeats in unordered trees in linear time},
author={Tomas Flouri and Kassian Kobert and Solon P. Pissis and Alexandros Stamatakis},
pages={145-152},
publisher={Czech Technical University in Prague}
}
Powered by bibtexbrowser