Fast algorithms for the unit cost editing distance between trees
Open Access
- 31 December 1990
- journal article
- Published by Elsevier BV in Journal of Algorithms
- Vol. 11 (4), 581-621
- https://doi.org/10.1016/0196-6774(90)90011-3
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Parallel string matching with k mismatchesTheoretical Computer Science, 1987
- S4-α mRNA translation regulation complex: II. Secondary structures of the RNA regulatory site in the presence and absence of S4Journal of Molecular Biology, 1987
- Improved string matching with k mismatchesACM SIGACT News, 1986
- Optimal parallel algorithms for string matchingInformation and Control, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Time-space-optimal string matchingJournal of Computer and System Sciences, 1983
- Generalized structures of the 5S ribosomal RNAsNucleic Acids Research, 1982
- A Tree-to-Tree Distance and Its Application to Cluster AnalysisIEEE Transactions on Pattern Analysis and Machine Intelligence, 1979
- Three-Dimensional Structure of a Transfer RNA in Two Crystal FormsScience, 1976