LVB 1.0: new program for reconstructing evolution

Daniel Barker sokal at
Wed Jul 30 12:38:31 EST 1997

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

Daniel Barker,
Institute of Cell and Molecular Biology,
University of Edinburgh,
Daniel Rutherford Building,
King's Buildings,
Mayfield Road,

More information about the Comp-bio mailing list