Computing all Subtree Repeats in Ordered Ranked Trees - Archive ouverte HAL Access content directly
Conference Papers Year : 2011
Not file

Dates and versions

hal-00742065 , version 1 (15-10-2012)

Identifiers

  • HAL Id : hal-00742065 , version 1

Cite

Michalis Christou, Maxime Crochemore, Tomas Flouri, Costas S. Iliopoulos, Jan Janousek, et al.. Computing all Subtree Repeats in Ordered Ranked Trees. SPIRE, 2011, Pisa, Italy. pp.338-343. ⟨hal-00742065⟩
51 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More