Login / Signup
Fast computation of all maximum acyclic agreement forests for two rooted binary phylogenetic trees.
Benjamin Albrecht
Published in:
CoRR (2015)
Keyphrases
</>
phylogenetic trees
np hard
computational biology
information extraction
partial order