An Optimal Algorithm for Computing All Subtree Repeats in Trees

DOI10.1007/978-3-642-45278-9_23zbMath1408.05122OpenAlexW2272295695MaRDI QIDQ2870033

Kassian Kobert, Solon P. Pissis, Alexandros Stamatakis, Tomáš Flouri

Publication date: 17 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc3996578

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: An Optimal Algorithm for Computing All Subtree Repeats in Trees