LVB 1.0: reconstructing evolution using parsimony and simulated annealing
This uses the familiar criterion of unweighted reversible parsimony, with
simulated annealing to search for parsimonious trees. This will be better
than hill-climbing (steepest descent) when the data matrix is large (e.g.
over 50 objects).
The program and manual are free. They are available from
http://www.icmb.ed.ac.uk/sokal.html
Daniel Barker,
Institute of Cell and Molecular Biology,
University of Edinburgh,
Daniel Rutherford Building,
King's Buildings,
Mayfield Road,
Edinburgh
EH9 3JR
