Local similarity between quotiented ordered trees

Journal of Discrete Algorithms

Volumn 5, Issue 1, 2007, Pages 23-35

  Ouangraoua, Aïda ^a   Ferraro, Pascal ^a   Tichit, Laurent ^a   Dulucq, Serge ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Dynamic programming; Local edition; Ordered labeled trees; Quotiented graph

Indexed keywords

ADAPTIVE ALGORITHMS; GENETIC ENGINEERING; RNA; TREES (MATHEMATICS);

GENOMIC ANALYSIS; LOCAL EDITION; ORDERED LABELED TREES; QUOTIENTED GRAPH;

DYNAMIC PROGRAMMING;

EID: 33947590891     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2006.03.010     Document Type: Article

References (25)

1. Zhang K., and Shasha D. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing 18 6 (1989) 1245-1262
2. G. Collins, S. Le, K. Zhang, A new algorithm for computing similarity between RNA structures, in: Proceedings of the 5th Joint Conference on Information Sciences, 2000, pp. 761-765
3. Shapiro B.A., and Zhang K. Comparing multiple RNA secondary structures using tree comparisons. Cabios 6 (1990) 309-318
4. Ferraro P., and Godin C. A distance measure between plant architectures. Annals of Forest Science 57 (2000) 445-461
5. Lu S., and Fu K. Error-correcting tree automata for syntactic pattern recognition. IEEE Transactions on Computers 27 (1978) 1040-1053
6. Wagner R.A., and Fisher M.J. The string-to-string correction problem. Journal of the Association for Computing Machinery 21 (1974) 168-173
7. Selkow S.M. The tree-to-tree editing problem. Information Processing Letters (1977) 184-186
8. Tai K.-C. The tree-to-tree correction problem. Journal of the Association for Computing Machinery (1979) 422-433
9. K. Zhang, A new editing-based distance between unordered trees, in: Combinatorial Pattern Matching, 4th Ann. Symp., CPM'93, Padala (Italy), 1993, pp. 254-265
10. P. Ferraro, Méthodes algorithmiques de comparaison d'arborescences, Applications à la comparaison de l'architecture des plantes, PhD thesis, Institut National Polytechnique de Toulouse, France, November 2000
11. Tanaka E., and Tanaka K. The tree-to-tree editing problem. International Journal Pattern Recognition and Artificial Intelligence 2 2 (1988) 221-240
12. T. Jiang, L. Wang, K. Zhang, Alignment of trees-an alternative to tree edit, in: Combinatorial Pattern Matching'94, 5th Annual Symposium, 1994, pp. 75-86
13. Godin C., and Caraglio Y. A multiscale model of plant topological structures. Journal of Theoretical Biology 191 (1998) 1-46
14. A. Ouangraoua, Distance multi-échelles entre structures secondaires d'ARN, Tech. rep., Université Bordeaux 1 - LaBRI, 2004
15. Ferraro P., and Godin C. An edit distance between quotiented trees. Algorithmica 36 (2003) 1-39
16. Smith T., and Waterman M. Identification of common molecular subsequences. Journal of Molecular Biology 147 (1981) 195-197
17. Vauchaussade M., and Viennot X. Enumeration of RNA secondary structures by complexity. Lecture Notes in Biomathematics 57 (1985) 360-365
18. Schmitt W., and Waterman M. Linear trees and RNA secondary structures. Discrete Applied Mathematics 51 (1994) 317-323
19. Dulucq S., and Tichit L. RNA secondary structure comparison: exact analysis of the Zhang-Shasha tree edit algorithm. Theoretical Computer Science 306 (2003) 471-484
20. M. Höchsmann, T. Töller, R. Giegerich, S. Kurtz, Local similarity in RNA secondary structures, in: Proceedings of Computational Systems Bioinformatics (CSB'03), 2003, pp. 159-168
21. Wang J.T., Shapiro B.A., Shasha D., Zhang K., and Currey K.M. An algorithm for finding the largest approximately common substructures of two trees. IEEE Transactions on Pattern Analysis and Machine Intelligence 20 (1998) 889-895
22. Wang J.T., Zhang K., and Chang C.Y. Identifying approximately common substructures in trees based on a restricted edit distance. Information Sciences 121 (1999) 367-386
23. C. Godin, Y. Guédon, E. Costes, Y. Caraglio, Measuring and analyzing plants with the amapmod software, in: M. Michalewicz (Ed.), Advances in Computational Life Sciences, vol I: Plants to Ecosystems, vol. January Csiro, Australia, 1997, pp. 63-94 (Chapter 4)
24. M. Vauchassade De Chaumont, X. Viennot, Polynômes orthogonaux et problèmes d'énumération en biologie moléculaire, in: Séminaire Lotharingien de Combinatoire, B08l, 1984, pp. 79-86
25. K. Zhang, Computing similarity between RNA secondary structures, in: Proceedings of IEEE International Joint Symposia on Intelligence and Systems Rockville, MD, 1998, pp. 126-132