.png){kind=icon}
.png){kind=icon}
Return
Seeded Tree Alignment
.png){kind=icon}
PRE
AI
DOI：10.1109/TCBB.2008.59.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. Here, we introduce a constrained form of this problem in which a partial mapping of a set of nodes (the seeds) 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 cospeciation and phylogeny reconciliation. The latter involves the solution of the planar tanglegram layout problem, for which a polynomial-time algorithm is given here.
Keywords:
RNA structure alignment
comparative phylogenetics
tree matching
tanglegram layout
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.4
Papers:
3.3K
Citations:
6.4K
View more organizations