LVB: parsimony and simulated annealing in the search for phylogenetic trees

Authors:
D. Barker
Affiliations:
School of Animal and Microbial Sciences, University of Reading, Whiteknights, P.O. Box 228, Reading, Berkshire, RG6 6AJ, UK
Venue:
Bioinformatics
Year:
2004

Citing 0
Cited 4

An Efficient Program for Phylogenetic Inference Using Simulated Annealing

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 7 - Volume 08
Parallel multiple sequence alignment with local phylogeny search by simulated annealing

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
On the application of evolutionary algorithms to the consensus tree problem

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Local search for the maximum parsimony problem

ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III

Quantified Score

Hi-index	3.85

Visualization

Abstract

Summary: The program LVB seeks parsimonious phylogenies from nucleotide alignments, using the simulated annealing heuristic. LVB runs fast and gives high quality results. Availability: The software is available at http://www.rubic.reading.ac.uk/lvb/ Supplementary information: Supplementary information may be downloaded from http://www.rubic.reading.ac.uk/~daniel/