"Computing all subtree repeats in ordered trees."

Michalis Christou et al. (2012)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2012.09.001

access: closed

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/ChristouCFIJMP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/ChristouCFIJMP12
Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Computing all subtree repeats in ordered trees. Inf. Process. Lett. 112(24): 958-962 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.