Dennis E. Shasha

Simple fast algorithms for the editing distance between trees and related problems

Ordered labeled trees are trees in which the left-to-right order among siblings is significant. The distance between two ordered trees is considered to be the weighted number of edit operations (insert, delete, and modify) to transform one tree to another. The problem of approximate tree matching is also considered. Specifically, algorithms are designed to answer the following kinds of questions:1. What is the distance between two trees? 2. What is the minimum distance between

StatStream: statistical monitoring of thousands of data streams in real time

T_1

Filtering algorithms and implementation for very fast publish/subscribe systems

and

Algorithmics and applications of tree and graph searching

T_2

Efficient and correct execution of parallel programs that share memory

when zero or more subtrees can be removed from

On the editing distance between unordered labeled trees

T_2

Efficient elastic burst detection in data streams

? 3. Let the pruning of a tree at node n mean removing all the descendants of node n. The analogous question for prunings as for subtrees is answered.A dynamic programming algorithm is presented to solve the three questions in sequential time

Warping indexes with envelope transforms for query by humming

O(|T_1 | \times |T_2 | \times \min ({\textit{depth}}(T_1 ),{\textit{leaves}}(T_1 )) \times \min ({\textit{depth}}(T_2 ),{\textit{leaves}}(T_2 )))

Qualitative network models and genome-wide expression data define carbon/nitrogen-responsive molecular machines in Arabidopsis

and space

Making snapshot isolation serializable

O(|T_1 | \times |T_2 |)