An Optimal Decomposition Algorithm for Tree Edit Distance

An optimal decomposition algorithm for tree edit distance

Better Tradeoffs for Exact Distance Oracles in Planar Graphs

Binary Jumbled Pattern Matching on Trees and Tree-Like Structures

Consequences of Faster Alignment of Sequences

Fast Algorithms for Computing Tree LCS

scholarly article

Fast RNA structure alignment for crossing input structures

Fast algorithms for computing tree LCS

Faster shortest paths in dense distance graphs, with applications

Gene proximity analysis across whole genomes via PQ trees.

scientific article published in December 2005

Improved Submatrix Maximum Queries in Monge Matrices

Locality and gaps in RNA comparison.

scientific article published in October 2007

Longest Common Extensions in Trees

Longest common extensions in trees

Minimum Cut of Directed Planar Graphs in O(n log log n) Time

Near-Optimal Compression for the Planar Graph Metric

Shortest Paths in Directed Planar Graphs with Negative Lengths: a Linear-SpaceO(nlog2n)-Time Algorithm

Shortest paths in directed planar graphs with negative lengths

Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions

Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions

Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search

The nearest colored node in a tree

Tree Compression with Top Trees

Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can)

Tree compression with top trees

Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time