Efficient chaining of seeds in ordered trees - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Efficient chaining of seeds in ordered trees


We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent with respect to postfix order and ancestrality. This problem is a natural extension of a similar problem for sequences, and has applications in computational biology, such as mining a database of RNA secondary structures. For the chaining problem with a set of m constant size seeds, we describe an algorithm with complexity O(m2 log(m)) in time and O(m2 ) in space.
Fichier principal
Vignette du fichier
iwoca2010_submission.pdf (1.19 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00490028 , version 1 (24-06-2010)



Julien Allali, Cédric Chauve, Pascal Ferraro, Anne-Laure Gaillard. Efficient chaining of seeds in ordered trees. 21st International Workshop on Combinatorial Algorithms, Jul 2010, London, United Kingdom. ⟨hal-00490028⟩
111 View
84 Download



Gmail Facebook X LinkedIn More