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.
       

  Authors  Community  Keywords  Publications  Software  Browse  Basket  Account  Contribute!  About  Help   

Website based on BibAdmin - forked on GitHub.
More details on the people involved in the development of the website available here.

In accordance with the European General Data Protection Regulation, you may
request information about your personal data processed on this website, or demand its correction or deletion
by contacting Philippe Gambette, the administrator of this website.

To refer to this website, please cite:
Tushar Agarwal, Philippe Gambette & David Morrison (2016),
Who is Who in Phylogenetic Networks: Articles, Authors and Programs,
https://arxiv.org/abs/1610.01674, website available at http://phylnet.univ-mlv.fr.