Computing all subtree repeats in ordered trees

Information Processing Letters 2012 / 12 Vol. 112; Iss. 24

Computing all subtree repeats in ordered trees

Christou, Michalis, Crochemore, Maxime, Flouri, Tomáš, Iliopoulos, Costas S., Janoušek, Jan, Melichar, Bořivoj, Pissis, Solon P.
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
112
Language:
english
Journal:
Information Processing Letters
DOI:
10.1016/j.ipl.2012.09.001
Date:
December, 2012
File:
PDF, 166 KB
english, 2012
Conversion to is in progress
Conversion to is failed