New program for reconstructing evolution

[Daniel Barker]

LVB 1.0: reconstructing evolution with parsimony and simulated annealing

This new program and its manual are free. They may be obtained from:

http://www.icmb.ed.ac.uk/sokal.html

Simulated annealing is a search method that will often find shorter trees
than a hill-climbing (steepest descent) search, if the data matrix is
large (e.g. has over 50 objects). Note that LVB will give poor results
compared to other parsimony programs if the matrix has few objects. 


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