The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
Please acknowledge your use of Quartet and cite the tqDist algorithm. For example, 'Quartet divergence (Smith 2019a) was calculated using the tqDist algorithm (Sand et al. 2014) implemented in the R package Quartet v 1.2.7 (Smith 2019b).
Smith MR (2019). Quartet: comparison of phylogenetic trees using quartet and split measures. doi:10.5281/zenodo.2536318, R package version 1.2.7.
Sand A, Holt MK, Johansen J, Brodal GS, Mailund T, Pedersen CNS (2014). “tqDist: a library for computing the quartet and triplet distances between binary or general trees.” Bioinformatics, 30(14), 2079–2080. doi:10.1093/bioinformatics/btu157.
Smith MR (2019). “Bayesian and parsimony approaches reconstruct informative trees from simulated morphological datasets.” Biology Letters, 15(2), 20180632. doi:10.1098/rsbl.2018.0632.
Corresponding BibTeX entries:
@Manual{Quartet, title = {Quartet: comparison of phylogenetic trees using quartet and split measures}, author = {Martin R. Smith}, note = {R package version 1.2.7}, year = {2019}, doi = {10.5281/zenodo.2536318}, }
@Article{Sand2014, author = {Andreas Sand and Morten K. Holt and Jens Johansen and Gerth S. Brodal and Thomas Mailund and Christian N. S. Pedersen}, doi = {10.1093/bioinformatics/btu157}, journal = {Bioinformatics}, number = {14}, pages = {2079--2080}, title = {tqDist: a library for computing the quartet and triplet distances between binary or general trees}, volume = {30}, year = {2014}, }
@Article{Smith2019, author = {Martin R. Smith}, doi = {10.1098/rsbl.2018.0632}, journal = {Biology Letters}, title = {Bayesian and parsimony approaches reconstruct informative trees from simulated morphological datasets}, volume = {15}, number = {2}, pages = {20180632}, year = {2019}, }
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.