Fast parallel algorithms for the unit cost editing distance between trees

Authors:
D. Shasha;K. Zhang
Affiliations:
Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY;Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY
Venue:
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Year:
1989

Introducing efficient parallelism into approximate string matching and a new serial algorithm

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Simple fast algorithms for the editing distance between trees and related problems

SIAM Journal on Computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
Parallel Construction of a Suffix Tree (Extended Abstract)

ICALP '87 Proceedings of the 14th International Colloquium, on Automata, Languages and Programming
On Approximate String Matching

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory

Hi-index	0.00