“A structure based flexible search method for motifs in RNA” Isana ...

Comparison of ordered rooted
trees
� The following operations are defined on ordered
trees:
� relabel - Change the label of a node v in T.
� delete - Delete a non-root node v in T with parent v′,
making the children of v become the children of v′. The
children are inserted in the place of v as a subsequence in
the left-to-right order of the children of v′.
� insert - The complement of delete. Insert a
node v as a child of v′ in T making v the
parent of a consecutive subsequence of the
children of v′.