Protein parsimony algorithm, version 3.56c
One most parsimonious tree found:
+-----------cox2_tborr
--4
! +--------Cox2_bsalt
+--3
! +-----cox2_trybb
+--2
! +--cox2_crifa
+--1
+--cox2_leita
remember: (although rooted by outgroup) this is an unrooted tree!
requires a total of 147.000
Please note that only one most parsimonious tree was found and that the total tree required a minimum of 147 steps or mutations. The tree was rooted by using the T. borreli sequence as an outgroup.
created by :Fred Opperdoes
Last updated: 25 August 1997.