| PEAR: a fast and accurate Illumina Paired-End reAd mergeR J Zhang, K Kobert, T Flouri, A Stamatakis Bioinformatics 30 (5), 614-620, 2014 | 4329 | 2014 |
| 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 | 852 | 2017 |
| ExaBayes: massively parallel Bayesian tree inference for the whole-genome era AJ Aberer, K Kobert, A Stamatakis Molecular biology and evolution 31 (10), 2553-2556, 2014 | 452 | 2014 |
| Computing the internode certainty and related measures from partial gene trees K Kobert, L Salichos, A Rokas, A Stamatakis Molecular biology and evolution 33 (6), 1606-1617, 2016 | 81 | 2016 |
| Longest common substrings with k mismatches T Flouri, E Giaquinta, K Kobert, E Ukkonen Information Processing Letters 115 (6-8), 643-647, 2015 | 50 | 2015 |
| Efficient detection of repeating sites to accelerate phylogenetic likelihood calculations K Kobert, A Stamatakis, T Flouri Systematic biology 66 (2), 205-217, 2017 | 29 | 2017 |
| The divisible load balance problem and its application to phylogenetic inference K Kobert, T Flouri, A Aberer, A Stamatakis Algorithms in Bioinformatics: 14th International Workshop, WABI 2014 …, 2014 | 27 | 2014 |
| Adaptation to host cell environment during experimental evolution of Zika virus V Grass, E Hardy, K Kobert, SR Talemi, E Décembre, C Guy, PV Markov, ... Communications Biology 5 (1), 1115, 2022 | 11 | 2022 |
| An optimal algorithm for computing all subtree repeats in trees T Flouri, K Kobert, SP Pissis, A Stamatakis Combinatorial Algorithms: 24th International Workshop, IWOCA 2013, Rouen …, 2013 | 11 | 2013 |
| Are all global alignment algorithms and implementations correct? T Flouri, K Kobert, T Rognes, A Stamatakis bioRxiv, 031500, 2015 | 8 | 2015 |
| The divisible load balance problem with shared cost and its application to phylogenetic inference C Scholl, K Kobert, T Flouri, A Stamatakis 2016 IEEE International Parallel and Distributed Processing Symposium …, 2016 | 7 | 2016 |
| An optimal algorithm for computing all subtree repeats in trees T Flouri, K Kobert, SP Pissis, A Stamatakis Philosophical Transactions of the Royal Society A: Mathematical, Physical …, 2014 | 6 | 2014 |
| Heuristic algorithms for the protein model assignment problem J Hauser, K Kobert, F Izquierdo-Carrasco, K Meusemann, B Misof, ... Bioinformatics Research and Applications: 9th International Symposium, ISBRA …, 2013 | 4 | 2013 |
| Is the Protein Model Assignment problem under linked branch lengths NP-hard? K Kobert, J Hauser, A Stamatakis Theoretical Computer Science 524, 48-58, 2014 | 2 | 2014 |
| An Efficient Approach to Merging Paired-End Reads and Incorporation of Uncertainties T Flouri, J Zhang, L Czech, K Kobert, A Stamatakis Algorithms for Next-Generation Sequencing Data: Techniques, Approaches, and …, 2017 | 1 | 2017 |
| A simple method for computing all subtree repeats in unordered trees in linear time T Flouri, K Kobert, SP Pissis, A Stamatakis Festschrift for Borivoj Melichar, 145-152, 2012 | 1 | 2012 |
| Awesome Open Source Awesome Open Source Libpll T Flouri, D Darriba, K Kobert, MT Holder, A Kozlov, A Stamatakis, ... | | |
| Mathematical Problems in Molecular Evolution and Next Generation Sequencing K Kobert | | |
