sog is a c-language program demonstrating an algorithm to find the most parsimoneous nucleotide phylogenetic tree along with the parsimony strength of grouping (or Bremer decay index) in one pass of a branch and bound algorithm.  This differs from the implementation in PAUP which uses a separate branch and bound search to find the strength of grouping for each group in the tree, using what I think is called the tree group exclusion option.  sog is a rather ugly hack which will be optimized and streamlined.  It IS ALPHA SOFTWARE, which means it has not been tested extensively on datasets other than our primate datasets.  It will compile and run on Linux and Nextstep for Intel systems.

John Czelusniak
jc@tree.roc.wayne.edu