| PEAR: a fast and accurate Illumina Paired-End reAd mergeR J Zhang, K Kobert, T Flouri, A Stamatakis Bioinformatics 30 (5), 614-620, 2013 | 1640 | 2013 |
| Phylogenomics resolves the timing and pattern of insect evolution B Misof, S Liu, K Meusemann, RS Peters, A Donath, C Mayer, ... Science 346 (6210), 763-767, 2014 | 1243 | 2014 |
| VSEARCH: a versatile open source tool for metagenomics T Rognes, T Flouri, B Nichols, C Quince, F Mahé PeerJ 4, e2584, 2016 | 1240 | 2016 |
| Multi-rate Poisson tree processes for single-locus species delimitation under maximum likelihood and Markov chain Monte Carlo P Kapli, S Lutteropp, J Zhang, K Kobert, P Pavlidis, A Stamatakis, T Flouri Bioinformatics 33 (11), 1630-1638, 2017 | 148 | 2017 |
| VSEARCH: a versatile open source tool for metagenomics. PeerJ 4: e2584 T Rognes, T Flouri, B Nichols, C Quince, F Mahé | 123 | 2016 |
| RAxML-NG: A fast, scalable, and user-friendly tool for maximum likelihood phylogenetic inference A Kozlov, D Darriba, T Flouri, B Morel, A Stamatakis bioRxiv, 447110, 2019 | 73 | 2019 |
| The phylogenetic likelihood library T Flouri, F Izquierdo-Carrasco, D Darriba, AJ Aberer, LT Nguyen, BQ Minh, ... Systematic biology 64 (2), 356-362, 2014 | 56 | 2014 |
| Response to Comment on “Phylogenomics resolves the timing and pattern of insect evolution" KM Kjer, JL Ware, A Blanke, A Donath, T Flouri, PB Frandsen, P Kapli, ... Science 349 (6247), 487, 2015 | 50 | 2015 |
| Longest common substrings with k mismatches T Flouri, E Giaquinta, K Kobert, E Ukkonen Information Processing Letters 115 (6-8), 643-647, 2015 | 24 | 2015 |
| Species tree inference with BPP using genomic sequences and the multispecies coalescent T Flouri, X Jiao, B Rannala, Z Yang Molecular biology and evolution 35 (10), 2585-2593, 2018 | 22 | 2018 |
| Enhanced string covering T Flouri, CS Iliopoulos, T Kociumaka, SP Pissis, SJ Puglisi, WF Smyth, ... Theoretical Computer Science 506, 102-114, 2013 | 22 | 2013 |
| EPA-ng: massively parallel evolutionary placement of genetic sequences P Barbera, AM Kozlov, L Czech, B Morel, D Darriba, T Flouri, ... Systematic biology 68 (2), 365-369, 2018 | 21 | 2018 |
| Subtree matching by pushdown automata. T Flouri, J Janousek, B Melichar Comput. Sci. Inf. Syst. 7 (2), 331-357, 2010 | 19 | 2010 |
| The divisible load balance problem and its application to phylogenetic inference K Kobert, T Flouri, A Aberer, A Stamatakis International Workshop on Algorithms in Bioinformatics, 204-216, 2014 | 18 | 2014 |
| Subtree matching by deterministic pushdown automata T Flouri, B Melichar, J Janoušek 2009 International Multiconference on Computer Science and Information …, 2009 | 18 | 2009 |
| The state of software for evolutionary biology D Darriba, T Flouri, A Stamatakis Molecular biology and evolution 35 (5), 1037-1046, 2018 | 15 | 2018 |
| Efficient detection of repeating sites to accelerate phylogenetic likelihood calculations K Kobert, A Stamatakis, T Flouri Systematic biology 66 (2), 205-217, 2017 | 14 | 2017 |
| MPBoot: fast phylogenetic maximum parsimony tree inference and bootstrap approximation DT Hoang, LS Vinh, T Flouri, A Stamatakis, A von Haeseler, BQ Minh BMC evolutionary biology 18 (1), 11, 2018 | 13 | 2018 |
| Boosting the performance of bayesian divergence time estimation with the phylogenetic likelihood library D Darriba, A Aberer, T Flouri, TA Heath, F Izquierdo-Carrasco, ... 2013 IEEE International Symposium on Parallel & Distributed Processing …, 2013 | 13 | 2013 |
| Bioinformatics. 2014 J Zhang, K Kobert, T Flouri, A Stamatakis PEAR: a fast and accurate Illumina Paired-End reAd mergeR, 614-620, 0 | 13 | |
Alexandros StamatakisHeidelberg Institute for Theoretical Studies and Karlsruhe Institute of TechnologyVerified email at h-its.org
