The optimal transformation of one tree into another by means of elementary edit operations is an important algorithmic problem that has several interesting applications to computational biology. We introduce a constrained form of this problem in which a partial mapping of a set of nodes in one tree to a corresponding set of nodes in the other tree is given, and present efficient algorithms for both ordered and unordered trees. Whereas ordered tree matching based on seeded nodes has applications in pattern matching of RNA structures, unordered tree matching based on seeded nodes has applications in co-speciation and phylogeny reconciliation. The latter involves the solution of the planar tanglegram layout problem, for which we give a polynomial-time algorithm. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Lozano, A., Pinter, R. Y., Rokhlenko, O., Valiente, G., & Ziv-Ukelson, M. (2007). Seeded tree alignment and planar tanglegram layout. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4645 LNBI, pp. 98–110). Springer Verlag. https://doi.org/10.1007/978-3-540-74126-8_10
Mendeley helps you to discover research relevant for your work.