Publication no #2534   Type :   Html | Bib | Both
Created: 2016-02-15 19:08:43     Modified: 2016-02-15 19:09:00
2534
photo
Benjamin Albrecht. Fast computation of all maximum acyclic agreement forests for two rooted binary phylogenetic trees. 2015.
Keywords: agreement forest, explicit network, from rooted trees, phylogenetic network, phylogeny, Program Hybroscale, reconstruction, software.
Note: http://arxiv.org/abs/1512.05656.
       


@Misc{Albrecht2015b,
      AUTHOR = {Albrecht, Benjamin},
      TITLE = {Fast computation of all maximum acyclic agreement forests for two rooted binary phylogenetic trees},
      YEAR = {2015},
      NOTE = {http://arxiv.org/abs/1512.05656},
      KEYWORDS = {agreement forest, explicit network, from rooted trees, phylogenetic network, phylogeny, Program Hybroscale, reconstruction, software}
}