basic tree common ancestor

Download python source

Code

import baltic as bt
from baltic import bt_utils

import matplotlib as mpl
from matplotlib import pyplot as plt
from matplotlib.gridspec import GridSpec

mpl.use("Agg")

treestring = '((("A":1,"B":1):1,"C":2):1,"D":3);'
ll = bt.make_tree(treestring, 'divergence')
ll.treeStats()

fig = plt.figure(figsize=(5,5),facecolor='w')
gs = GridSpec(1,1)

ax = plt.subplot(gs[0])

descendants = []
for k in ll.get_branches():
    if k.is_leaf() and k.name in ['A', 'C']:
        descendants.append(k)

commonAncestor = ll.find_MRCA(descendants)

ll.plot_tree(ax)

def target_function(node):
    """
    Equivalent to anonymous function lambda k: k == commonAncestor
    """
    return node == commonAncestor

def text_function(node):
    """
    Equivalent to anonymous function lambda k: f"common ancestor of tips A and C"
    """
    return f"common ancestor\nof tips A and C"

ll.plot_text(ax, size = 26)
ll.plot_text(ax, targetFxn = target_function, textContentFxn = text_function, size = 12)
ll.plot_points(ax, targetFxn = target_function)

bt_utils.plot_scale_bar(ax, xy = (0.5, 0.1), tree = ll, style = 'fancy', textKwargs={'fontsize': 18})
bt_utils.clean_axes(ax)

plt.savefig('basic-tree-common-ancestor.png', bbox_inches='tight')