Efficient parallel algorithms for tree editing problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1075, Issue , 1996, Pages 361-372

  Zhang, Kaizhong ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORESTRY; PATTERN MATCHING;

EDIT DISTANCE; MINIMUM COST; PRECISE DEFINITION; TIME ALGORITHMS; TREE EDITING;

PROBLEM SOLVING;

EID: 84957648406     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61258-0_26     Document Type: Conference Paper

References (12)

1. A. Aggarwal and J. Park, 'Notes on searching in multidimensional monotone arrays', In proc. 29th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Washinton, DC, pp. 497-512, 1988
2. A. Apostolico, M.J. Atallah, L.L. Larmore and S. Mcfaddin, 'Efficient parallel algorithms for steing editing and related problems', SIAM J. Comput., vol. 19, no. 5, pp. 968-988, 1990
3. S. Y. Lu, "A tree-to-tree distance and its application to cluster analysis", IEEE Trans. PAMI, vol. 1, pp.219-224, 1979
4. G. M. Landau and U. Vishkin, 'Fast parallel and serial approximate string matching', J. Algorithms, vol. 10, pp.157-169, 1989
5. S. M. Selkow, 'The tree-to-tree editing problem', Information Processing Letters, no. 6, 184-186, 1977
6. B. Shapiro, An algorithm for comparing multiple RNA secondary structures, Cornput. Appl. Biosci., pp. 387-393,1988
7. B. Shapiro and K. Zhang, 'Comparing multiple RNA secondary structures using tree comparisons' Comput. Appl. Biosci. vol. 6, no. 4, pp.309-318, 1990
8. D. Shasha and K. Zhang, 'Fast algorithms for the unit cost edit distance between trees', J. of Algorithms, vol. 11, pp. 581-621, 1990
9. K. C. Tai, ‘The tree-to-tree correction problem', J. ACM, vol. 26, pp.422-433, 1979
10. K. Zhang, ‘A new editing based distance between unordered labeled trees', In A. Apostolieo, M. Crochemore, Z. Galil, and U. Manber, editors, Combinatorial Pattern Matching, Lecture Notes in Computer Science 684, pp. 254-265. Springer- Verlag, 1993; journal version is to appear in Algorithmica.
11. K. Zhang, J. Wang and D. Shasha, 'On the editing distance between undirected wcycfic graphs', Proceedings of the Sixth Symposium on Combinatorial Pattern Matching, Helsinki, Finland, July 1995. Springer-Verlag's Lecture Notes in Computer Science 937, pp 395-407.
12. K. Zhang and D. Shasha, 'Simple fast algorithms for the editing distance between trees and related problems', SlAM J. Computing vol. 18, no. 6, pp.1245-1262, 1989