Finds the directed adjacency matrix from BCT a horizontal vector (0: terminal, 1: continuation, 2: branch). The algorithm uses a stack (see introduction section “BCT formalism”). Proposes artificial metrics according to a circular dendrogram (see “xdend_tree”, but used as angles). This can be seen as an equivalent tree (electrotonically) to any real tree whose BCT string is known.

Example 1:

>> BCT_tree ([1 2 1 0 2 0 0])

TREES

Example 2:

>> dA = BCT_tree ([1 2 1 0 2 0 0], '-dA')
if options string contains 'dA' only the adjacency matrix is calculated.

TREES

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 License