Approximate labelled subtree homeomorphism

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

Volumn 3109, Issue , 2004, Pages 59-73

  Pinter, Ron Y ^a   Rokhlenko, Oleg ^a   Tsur, Dekel ^b   Ziv Ukelson, Michal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; OPTIMIZATION; PATTERN MATCHING;

ALGORITHM FOR SOLVING; HOMEOMORPHIC; NODE SIMILARITIES; OPTIMIZATION PROBLEMS; ORDERED TREE; SUB TREES; SUBTREE HOMEOMORPHISM;

TREES (MATHEMATICS);

EID: 35048839072     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_5     Document Type: Article

References (26)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, 1993.
2. D. Carmel, N. Efrati, G.M. Landau, Y.S. Maarek, and Y. Mass. An extension of the vector space model for querying xml documents via xml fragments. In XML and Information Retrieval (Workshop) Tampere, Finland, 2002.
3. 2.5) time algorithms for the subgraph homeomorphism problem on trees. J. Algorithms, 8:106-112, 1987.
4. E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, 1:269-271, 1959.
5. J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. J. of the Assoc. for Comput. Mach., 19(2):248-264, 1972.
6. T. Feder and R. Motwani. Clique partitions, graph compression and speeding-up algorithms. In Proceedings 23rd Symposium on the Theory of Computing (STOC 91), pages 123-133, 1991.
7. M. L. Predman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the Association for Computing Machinery, 34(3):596-615, 1987.
8. H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for network problems. SIAM J. Comput., 18(5):1012-1036, 1989.
9. P. B. Gibbons, R. M. Karp, and D. Soroker. Subtree isomorphism is in random NC. Discrete Applied Mathmatics, 29:35-62, 1990.
10. A. V. Goldberg, S. A. Plotkin, and P.M Vidya. Sublinear-time parallel algorithms for matching and related problems. J. Algorithms, 14:180-213, 1993.
11. L. R. Ford Jr. and D. R. Fulkerson. Flows in Networks. Princeton, NJ: Princeton University Press, 1962.
12. M. Y. Kao, T. W. Lam, W. K. Sung, and H. F. Ting. Cavity matchings, label compressions, and unrooted evolutionary trees. SIAM J. Comput., 30(2):602-624, 2000.
13. M. Karpinski and A. Lingas. Subtree isomorphism is NC reducible to bipartite perfect matching. Information Processing Letters, 30(17):27-32, 1989.
14. P. Kilpelainen and H. Mannila. Ordered and unordered tree inclusion. SIAM J. Comput., 24(2):340-356, 1995.
15. D. W. Matula. An algorithm for subtree identification. SIAM Rev., 10:273-274, 1968.
16. 5/2). Ann. Discrete Math., 2:91-106, 1978.
17. H. Ogata, W. Fujibuchi, S. Goto, and M. Kanehisa. A heuristic graph comparison algorithm and its application to detect functionally related enzyme clusters. Nucleic Acids Research, 28:4021-4028, 2000.
18. J. B. Orlin and R. K. Ahuja. New scaling algorithms for the assignment and minimum cycle mean problems. Math. Prog., 54:541-561, 1992.
19. R. Y. Pinter, O. Rokhlenko, E. Yeger-Lotem, and M. Ziv-Ukelson. A new tool for the alignment of metabolic pathways. Manuscript, 2004.
20. S. W. Reyner. An analysis of a good algorithm for the subtree problems. SIAM J. Comput., 6:730-732, 1977.
21. T. Schlieder and F. Naumann. Approximate Tree Embedding for Querying XML Data. ACM SIGIR Workshop on XML and IR, 2000.
22. F. Schreiber. Comparison of metabolic pathways using constraint graph drawing. In Proceedings of the Asia-Pacific Bioinformatics Conference (APBC'03), Conferences in Research and Practice in Information Technology; 19, pages 105-110, 2003.
23. R. Shamir and D. Tsur. Faster subtree isomorphism. Journal of Algorithms, 33(2):267-280, 1999.
24. M. A. Steel and T. Warnow. Kaikoura tree theorems: Computing the maximum agreement subtree. Information Processing Letters, 48(2):77-82, 1993.
25. R. E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, 1982.
26. G. Valiente. Constrained tree inclusion. In Proceedings of 14th Annual Symposium of Combinatorial Pattern Matching (CPU '03), volume 2676 of Lecture Notes in Computer Science, pages 361-371, 2003.