Penny algorithm for DNA, version 3.573c
 branch-and-bound to find all most parsimonious trees



requires a total of           1014.000

One most parsimonious tree found:




  +--------------------------------------A-tumefaci
  !  
  !                                   +--B-spp-Deer
  !                                +--7  
  !     +--------------------------5  +--B--weissii
  !     !                          !  
  !     !                          +-----B-bacillif
  !     !  
  !     !           +--------------------B-henselae
--1     !           !  
  !  +--2        +-10  +-----------------B--doshiae
  !  !  !        !  !  !  
  !  !  !        !  !  !           +-----B-vinsonii
  !  !  !        !  +-13  +-------12  
  !  !  !        !     !  !        !  +--B-arupensi
  !  !  !        !     !  !        +-11  
  !  !  !        !     +--9           +--B-berhoffi
  !  !  +--------3        !  
  +--4           !        !        +-----B-birtlesi
     !           !        +--------6  
     !           !                 !  +--B-grahamii
     !           !                 +--8  
     !           !                    +--B-elizabet
     !           !  
     !           +-----------------------B-quintana
     !  
     +-----------------------------------B-clarridg

  remember: (although rooted by outgroup) this is an unrooted tree!