Efficient Detection of Repeating Sites to Accelerate Phylogenetic Likelihood Calculations

por Kobert, K., Stamatakis, A., Flouri, T.
Publicado 2017

An optimal algorithm for computing all subtree repeats in trees

por Flouri, T., Kobert, K., Pissis, S. P., Stamatakis, A.
Publicado 2014

Multi-rate Poisson tree processes for single-locus species delimitation under maximum likelihood and Markov chain Monte Carlo

por Kapli, P, Lutteropp, S, Zhang, J, Kobert, K, Pavlidis, P, Stamatakis, A, Flouri, T
Publicado 2017

RAxML-Light: a tool for computing terabyte phylogenies

por Stamatakis, A., Aberer, A.J., Goll, C., Smith, S.A., Berger, S.A., Izquierdo-Carrasco, F.
Publicado 2012

The Phylogenetic Likelihood Library

por Flouri, T., Izquierdo-Carrasco, F., Darriba, D., Aberer, A.J., Nguyen, L.-T., Minh, B.Q., Von Haeseler, A., Stamatakis, A.
Publicado 2015

Two C++ libraries for counting trees on a phylogenetic terrace

por Biczok, R, Bozsoky, P, Eisenmann, P, Ernst, J, Ribizel, T, Scholz, F, Trefzer, A, Weber, F, Hamann, M, Stamatakis, A
Publicado 2018