z-logo
open-access-imgOpen Access
LVB: parsimony and simulated annealing in the search for phylogenetic trees
Author(s) -
Daniel Barker
Publication year - 2004
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btg402
Subject(s) - maximum parsimony , phylogenetic tree , simulated annealing , computer science , biology , evolutionary biology , mathematics , algorithm , genetics , clade , gene
The program LVB seeks parsimonious phylogenies from nucleotide alignments, using the simulated annealing heuristic. LVB runs fast and gives high quality results.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom