Generalized LCS

Theoretical Computer Science

Volumn 409, Issue 3, 2008, Pages 438-449

  Amir, Amihood ^a,b   Hartman, Tzvika ^a,c   Kapah, Oren ^a   Shalom, B Riva ^a   Tsur, Dekel ^d  

^a BAR ILAN UNIVERSITY   (Israel)

^b Johns Hopkins University   (United States)

^c UNIVERSITY OF HAIFA   (Israel)

^d BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Longest common subsequence; Matrices; Non crossing matching; Trees

Indexed keywords

CONTROL THEORY; POLYNOMIAL APPROXIMATION;

#P-HARD; COMPLEX STRUCTURES; K TREES; LONGEST COMMON SUBSEQUENCE; LONGEST COMMON SUBSEQUENCES; LOWER BOUNDS; MATRICES; MULTIPLE TREES; NON CROSSING MATCHING; ORDERED TREES; POLYNOMIAL TIMES; SUB STRUCTURES; TREES; UNORDERED TREES;

OBJECT RECOGNITION;

EID: 55949094555     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.08.037     Document Type: Article

References (26)

1. Amir A., and Keselman D. Maximum agreement subtree in a set of evolutionary trees - metrics and efficient algorithms. SIAM J. Comput. 26 6 (1997) 1656-1669
2. Amir A., and Landau G.M. Fast parallel and serial multidimensional approximate array matching. Theoret. Comput. Sci. 81 1 (1991) 97-115
3. R. Baeza-Yates, Similarity in two-dimensional strings, in: Proc. COOCON, 1998, pp. 319-328
4. L. Bergroth, H. Hakonen, T. Raita, A survey of longest common subsequence algorithms, in: Proc. 7th Symposium on String Processing and Information Retrieval, SPIRE, 2000, pp. 39-48
5. Bille P. A Survey on Tree Edit Distance and Related Problems. Theoret. Comput. Sci. 337 1-3 (2005) 217-239
6. P. Bille, I.L. Gørtz, The tree inclusion problem: In optimal space and faster, in: Proc. 32nd International Colloquium on Automata, Languages and Programming, 2005, pp. 66-77
7. Branden C., and Tooze J. Introduction to Protein Structure (1999), Garland Publishing, New York, NY
8. Demaine E., Mozes S., Rossman B., and Weimann O. An optimal decomposition algorithm for tree edit distance. ACM Trans. Algorithms (2008)
9. M. Farach, T.M. Przytycka, M. Thorup, The maximum agreement subtree problem for binary trees, in: Proc. 3rd Annual European Symposium on Algorithms, ESA, 1995, pp. 381-393
10. Gabow H.N., and Tarjan R.E. Faster scaling algorithms for network problems. SIAM J. Comput. 18 5 (1989) 1013-1036
11. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Co., New York
12. Harel D., and Tarjan R.E. Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13 2 (1984) 338-355
13. Kilpelinen P., and Mannila H. Ordered and unordered tree inclusion. SIAM J. Comput. 24 2 (1995) 340-356
14. P.N. Klein, Computing the edit distance between unrooted ordered trees, in: Proc. 6th European Symposium on Algorithms, ESA, 1998, pp. 91-102
15. Krithivasan K., and Sitalakshmi R. Efficient two-dimensional pattern matching in the presence of errors. Inform. Sci. 43 3 (1987) 169-184
16. R.Y. Pinter, O. Rokhlenko, D. Tsur, M. Ziv-Ukelson, Approximate labeled subtree homeomorphism, in: Proc. 15th Symposium on Combinatorial Pattern Matching, CPM, 2004, pp. 59-73
17. T. Richter, A new algorithm for the ordered tree inclusion problem, in: Proc. 8th Symposium on Combinatorial Pattern Matching, CPM, 1997, pp. 150-166
18. Shapiro B.A., and Zhang K.Z. Comparing multiple RNA secondary structures using tree comparisons. Comput. Appl. Biosci. 6 4 (1990) 309-318
19. Shasha D., and Zhang K. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18 6 (1989) 1245-1262
20. Steel M., and Warnow T. Kaikoura tree theorems: The maximum agreement subtree problem. Inform. Process. Lett. 48 (1993) 77-82
21. Takahashi Y., Satoh Y., Suzuki H., and Sasaki S. Recognition of largest common structural fragment among a variety of chemical structures. Anal. Sci. 3 (1987) 23-28
22. G. Valiente, Simple and efficient tree comparison, Technical Report LSI-01-1-R, Technical University of Catalonia, Department of Software, 2001
23. Valiente G. Constrained tree inclusion. J. Discrete Algorithms 3 2-4 (2005) 431-447
24. Wagner R.A., and Fischer M.J. The string-to-string correction problem. J. ACM 21 (1974) 168-173
25. Zhang K. Algorithm for the constrained editing problem between ordered labeled trees and related problems. Pattern Recognit. 28 (1995) 463-478
26. Zhang K. A constrained edit distance between unordered labeled trees. Algorithmica 15 3 (1996) 205-222