Alignment of trees - An alternative to tree edit

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

Volumn 807 LNCS, Issue , 1994, Pages 75-86

  Tao, Jiang ^a   Wang, Lusheng ^a   Zhang, Kaizhong ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALIGNMENT; COMPUTATIONAL COMPLEXITY; FORESTRY; PATTERN MATCHING; POLYNOMIAL APPROXIMATION;

ALIGNMENT PROBLEMS; ARBITRARY DEGREE; BEST-KNOWN ALGORITHMS; BOUNDED DEGREE; MULTIPLE ALIGNMENT; POLYNOMIAL-TIME; TIME COMPLEXITY; UNORDERED TREES;

TREES (MATHEMATICS);

EID: 84866934007     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58094-8_7     Document Type: Conference Paper

References (17)

1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. 15. Freeman, 1979.
2. D. Gusfield, Efficient methods for multiple sequence alignment with guaranteed error bounds, Bulletin of Mathematical Biology 55, pp. 141-154, 1993.
3. P. Kilpelainen and H. Mannila, Ordered and unordered tree inclusion, Report A-1991-4, Dept. of Comp. Science, University of Helsinki, August 1991; to appear in SIAM J. on Computin 9.
4. S.-Y. Le, J. Owens, R. Nussinov, J.-H. Chen B. Shapiro and J. V. Maizel, RNA secondary structures: comparison and determination of frequently recurring substructures by consensus, Comp. Appl. Biosci. 5, 205-210, 1989.
5. S.-Y. Le, R. Nassinov, and, I.V. Maizel, Tree graphs of RNA secondary structures and their comparisons, Computers and Biomedical Research, 22,461-473, 1989.
6. S.Y. Lu, A tree-tree distance and its application to cluster analysis, IEEE Trans. Pattern Anal. Mach. Intelligence 1, 219-224, 1979.
7. D. Sankoff and J. Kruskal (Eds), Time Warps, Strin9 Edits, and Macromoleeules: the Theory and Practice of Sequence Comparison, Addison Wesley, Reading Mass., 1983.
8. B. Shapiro, An algorithm for comparing multiple RNA secondary structures, Cornput. Appl. Biosci. 387-393, 1988.
9. F.Y. Shih, Object representation and recognition using mathematical morphology model, J. System Integration, vol. 1, pp. 235-256, 1991.
10. F.Y. Shih and O.R. Mitchell, Threshold decomposition of grayscale morphology into binary morphology, IEEE Trans. Pattern Anal. Mach. lntell., vol. PAMI-11, pp.31-42, 1989.
11. B. Shapiro and K. Zhang, Comparing multiple RNA secondary structures using tree comparisons, Comput. Appl. Biosci. vol. 6, no. 4, pp.309-318, 1990.
12. Y. Takahashi, Y. Satoh, H. Suzuki and S. Sasaki, Recognition of largest common structurM fragment among a variety of chemical structures, Analytical Science, vol. 3, pp 23-28, 1987.
13. K.C. Tai, The tree-to-tree correction problem, J. ACM, 26, 422-433, 1979.
14. L. Wang and T. Jiang, On the complexity of multiple sequence alignment, 1993, to appear in Journal of Computational Biology.
15. K. Zhang and T. Jiang, Some MAX SNP-hard results concerning unordered labeled trees, 1993, To appear in Information Processin9 Letters.
16. K. Zhang and D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. Comput. 18, 1245-1262, 1989.
17. K. Zhang, R. Statman, and D. Shasha, On the editing distance between unordered labeled trees, Information Processing Letters, 42, 133-139, 1992.