Search: in, Shasha, D

3 results

Results

Fast parallel algorithms for the unit cost editing distance between trees

... labeled trees are trees whose nodes are labeled and in which the left-to-right order among siblings is significant. We consider ...

Publication - huliganka - 04/16/2013 - 23:38 - 0 comments - 1 attachment

Structural matching and discovery in document databases

... 632.81 KB Structural matching and discovery in documents such as SGML and HTML is important for data warehousing [6], ... an example, a user of the World Wide Web may be interested in knowing changes in an HTML document [2, 5, 10]. Such changes can be detected ...

Publication - huliganka - 04/16/2013 - 23:16 - 0 comments - 1 attachment

On the Editing Distance between Undirected Acyclic Graphs and Related Problems

... form of the constrained distance previously reported in [27]. When applied to ordered trees, the degree-2 distance is a ... and insertions occur at leaves i.e., with degree 1.) In this extended abstract, we present algorithms for computing the degree-2 ...

Publication - huliganka - 04/16/2013 - 06:16 - 0 comments - 0 attachments