
Discrete character parsimony algorithm, version 3.7a

 5 species,   6  sites


Name         Sequences
----         ---------

Alpha        110110
Beta         ...00.
Gamma        .0....
Delta        001001
Epsilon      001...



     1 trees in all found


                            +Epsilon   
           +----------------3  
  +--------2                +-------------------------Delta     
  |        |  
  |        +Gamma     
  |  
  1----------------Beta      
  |  
  +Alpha     


requires a total of      8.000

  between      and       length
  -------      ---       ------
     1           2       1.000000
     2           3       2.000000
     3      Epsilon      0.000000
     3      Delta        3.000000
     2      Gamma        0.000000
     1      Beta         2.000000
     1      Alpha        0.000000

steps in each site:
         0   1   2   3   4   5   6   7   8   9
     r-----------------------------------------
    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                110110
   1      2         yes    100110
   2      3         yes    0.1...
   3   Epsilon      no     ......
   3   Delta        yes    ...001
   2   Gamma        no     ......
   1   Beta         yes    110000
   1   Alpha        yes    110110


