Kassian Kobert
Kassian Kobert
Verified email at univ-lyon1.fr
Title
Cited by
Cited by
Year
PEAR: a fast and accurate Illumina Paired-End reAd mergeR
J Zhang, K Kobert, T Flouri, A Stamatakis
Bioinformatics 30 (5), 614-620, 2014
26412014
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
3442017
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
2942014
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
602016
Longest common substrings with k mismatches
T Flouri, E Giaquinta, K Kobert, E Ukkonen
Information Processing Letters 115 (6), 643-647, 2015
362015
Efficient detection of repeating sites to accelerate phylogenetic likelihood calculations
K Kobert, A Stamatakis, T Flouri
Systematic biology 66 (2), 205-217, 2017
222017
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
212014
An optimal algorithm for computing all subtree repeats in trees
T Flouri, K Kobert, SP Pissis, A Stamatakis
International Workshop on Combinatorial Algorithms, 269-282, 2013
92013
The divisible load balance problem with shared cost and its application to phylogenetic inference
C Scholl, K Kobert, T Flouri, A Stamatakis
Parallel and Distributed Processing Symposium Workshops, 2016 IEEE …, 2016
72016
Are all global alignment algorithms and implementations correct?
T Flouri, K Kobert, T Rognes, A Stamatakis
bioRxiv, 031500, 2015
52015
An optimal algorithm for computing all subtree repeats in trees
T Flouri, K Kobert, SP Pissis, A Stamatakis
Philosophical Transactions of the Royal Society of London A: Mathematical …, 2014
52014
Heuristic algorithms for the protein model assignment problem
J Hauser, K Kobert, F Izquierdo-Carrasco, K Meusemann, B Misof, ...
International Symposium on Bioinformatics Research and Applications, 137-148, 2013
32013
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
22014
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, 299-325, 2017
12017
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
12012
Mathematical Problems in Molecular Evolution and Next Generation Sequencing
K Kobert
The system can't perform the operation now. Try again later.
Articles 1–16