Skip to main content

Advertisement

Fig. 3 | Algorithms for Molecular Biology

Fig. 3

From: Towards sub-quadratic time and space complexity solutions for the dated tree reconciliation problem

Fig. 3

Tanglegram instance and the matrix which corresponds to the optimal map presented in Fig. 1. The tanglegram (left) first presented in Fig.  1 along with the dynamic programming matrix (right) generated in the process of solving this tanglegram instance using the Improved Node Mapping algorithm. What is of interest is that only 19 of the possible 45 (42 %) elements in the matrix are populated to solve this particular example. It is this gap, number of unpopulated elements within the dynamic programming matrix, which is exploited within this analysis

Back to article page