FastHN: a fast tool for minimum hybridization networks. This site provides programs for computing the hybridization number , a maximum acyclic agreement forest (MAAF) , or all maximum acyclic agreement forests (MAAFs) of two given phylogenetic trees. Once our programs find an MAAF, they also construct an optimal hybridization network .
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Chen, Zhi-Zhong; Machida, Eita; Wang, Lusheng: An improved approximation algorithm for rSPR distance (2016)
- Chen, Zhi-Zhong; Fan, Ying; Wang, Lusheng: Faster exact computation of rSPR distance (2015)