
Penny algorithm, version 3.7a
 branch-and-bound to find all most parsimonious trees

 7 species,   6 characters
Wagner parsimony method


Name         Characters
----         ----------

Alpha1       11011 0
Alpha2       11011 0
Beta1        11000 0
Beta2        11000 0
Gamma1       10011 0
Delta        00100 1
Epsilon      00111 0



requires a total of              8.000

    3 trees in all found




  +-----------------Alpha1    
  !  
  !              +--Delta     
  !           +--3  
--1     +-----6  +--Epsilon   
  !     !     !  
  !  +--4     +-----Gamma1    
  !  !  !  
  !  !  !        +--Beta2     
  +--2  +--------5  
     !           +--Beta1     
     !  
     +--------------Alpha2    

  remember: this is an unrooted tree!


steps in each character:
         0   1   2   3   4   5   6   7   8   9
     *-----------------------------------------
    0!       1   1   1   2   2   1            

From    To     Any Steps?    State at upper node
                             ( . means same as in the node below it on tree)

          1                11011 0
  1    Alpha1       no     ..... .
  1       2         no     ..... .
  2       4         no     ..... .
  4       6         yes    .0... .
  6       3         yes    0.1.. .
  3    Delta        yes    ...00 1
  3    Epsilon      no     ..... .
  6    Gamma1       no     ..... .
  4       5         yes    ...00 .
  5    Beta2        no     ..... .
  5    Beta1        no     ..... .
  2    Alpha2       no     ..... .




  +-----------------Alpha1    
  !  
  !              +--Delta     
--1           +--3  
  !  +--------6  +--Epsilon   
  !  !        !  
  !  !        +-----Gamma1    
  +--2  
     !           +--Beta2     
     !        +--5  
     +--------4  +--Beta1     
              !  
              +-----Alpha2    

  remember: this is an unrooted tree!


steps in each character:
         0   1   2   3   4   5   6   7   8   9
     *-----------------------------------------
    0!       1   1   1   2   2   1            

From    To     Any Steps?    State at upper node
                             ( . means same as in the node below it on tree)

          1                11011 0
  1    Alpha1       no     ..... .
  1       2         no     ..... .
  2       6         yes    .0... .
  6       3         yes    0.1.. .
  3    Delta        yes    ...00 1
  3    Epsilon      no     ..... .
  6    Gamma1       no     ..... .
  2       4         no     ..... .
  4       5         yes    ...00 .
  5    Beta2        no     ..... .
  5    Beta1        no     ..... .
  4    Alpha2       no     ..... .




  +-----------------Alpha1    
  !  
  !              +--Delta     
  !           +--3  
--1        +--6  +--Epsilon   
  !        !  !  
  !  +-----2  +-----Gamma1    
  !  !     !  
  +--4     +--------Alpha2    
     !  
     !           +--Beta2     
     +-----------5  
                 +--Beta1     

  remember: this is an unrooted tree!


steps in each character:
         0   1   2   3   4   5   6   7   8   9
     *-----------------------------------------
    0!       1   1   1   2   2   1            

From    To     Any Steps?    State at upper node
                             ( . means same as in the node below it on tree)

          1                11011 0
  1    Alpha1       no     ..... .
  1       4         no     ..... .
  4       2         no     ..... .
  2       6         yes    .0... .
  6       3         yes    0.1.. .
  3    Delta        yes    ...00 1
  3    Epsilon      no     ..... .
  6    Gamma1       no     ..... .
  2    Alpha2       no     ..... .
  4       5         yes    ...00 .
  5    Beta2        no     ..... .
  5    Beta1        no     ..... .

