StringologyTimes

Data Structures and Algorithms: 2006/4/08-14

1: An O(n^3)-Time Algorithm for Tree Edit Distance
2: An exact algorithm for higher-dimensional orthogonal packing
3: Structural Alignments of pseudo-knotted RNA-molecules in polynomial time
4: Beyond Hirsch Conjecture: walks on random polytopes and smoothed complexity of the simplex method
5: Solving Classical String Problems on Compressed Texts
6: On the reduction of a random basis