An Optimal Algorithm for Computing All Subtree Repeats in Trees

Flouri, Tomas; Kobert, Kassian; Pissis, Solon P.; Stamatakis, Alexandros

doi:10.1007/978-3-642-45278-9_23

by Flouri, Tomas, Kobert, Kassian, Pissis, Solon P. and Stamatakis, Alexandros

Reference:

T. Flouri, K. Kobert, S. P. Pissis, A. Stamatakis, "An Optimal Algorithm for Computing All Subtree Repeats in Trees", in Combinatorial Algorithms, T. Lecroq, L. Mouchard, Eds., Springer Berlin Heidelberg, 2013, pp. 269-282.

Bibtex Entry:

@incollection{IWOCA2013,
year={2013},
isbn={978-3-642-45277-2},
booktitle={Combinatorial Algorithms},
volume={8288},
series={Lecture Notes in Computer Science},
editor={Lecroq, Thierry and Mouchard, Laurent},
doi={10.1007/978-3-642-45278-9_23},
title={An Optimal Algorithm for Computing All Subtree Repeats in Trees},
publisher={Springer Berlin Heidelberg},
author={Flouri, Tomas and Kobert, Kassian and Pissis, Solon P. and Stamatakis, Alexandros},
pages={269-282}
}