Login / Signup
A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard.
Sébastien Roch
Published in:
CoRR (2005)
Keyphrases
</>
maximum parsimony
phylogenetic trees
maximum likelihood
tabu search
computational biology
tree structures
multiple sequence alignment
simulated annealing
machine learning
np hard
query language
multiple sequence alignments