Skip to main content
. 2007 Nov 30;7:108. doi: 10.1186/1471-2180-7-108

Figure 8.

Figure 8

Placing read in phylogeny. Computing the most specific and confident placement of a read in the phylogenetic tree occurs in two stages. First, for each internal node we compute a score that is equal to the maximum of the scores of its children. Second, we traverse down the tree from the root until we find a node for which the child with the second maximum score is within a threshold T of the maximum score, or until we reach a leaf node.