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

D. Barker*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Summary: The program LVB seeks parsimonious phylogenies from nucleotide alignments, using the simulated annealing heuristic. LVB runs fast and gives high quality results.

Original languageEnglish
Pages (from-to)274-275
Number of pages2
JournalBioinformatics
Volume20
Issue number2
DOIs
Publication statusPublished - 22 Jan 2004

Fingerprint

Dive into the research topics of 'LVB: Parsimony and simulated annealing in the search for phylogenetic trees'. Together they form a unique fingerprint.

Cite this