Heuristic Algorithms for the Protein Model Assignment Problem. - Jörg Hauser; Kassian Kobert; Fernando Izquierdo-Carrasco; Karen Meusemann; Bernhard Misof; Michael Gertz 001; Alexandros Stamatakis (ISBRA, 2013)

An Optimal Algorithm for Computing All Subtree Repeats in Trees. - Tomás Flouri; Kassian Kobert; Solon P. Pissis; Alexandros Stamatakis (IWOCA, 2013)

The Divisible Load Balance Problem and Its Application to Phylogenetic Inference. - Kassian Kobert; Tomás Flouri; Andre J. Aberer; Alexandros Stamatakis (WABI, 2014)

PEAR: a fast and accurate Illumina Paired-End reAd mergeR. - Jiajie Zhang; Kassian Kobert; Tomás Flouri; Alexandros Stamatakis (Bioinform., 2014)

Is the Protein Model Assignment problem under linked branch lengths NP-hard? - Kassian Kobert; Jörg Hauser; Alexandros Stamatakis (Theor. Comput. Sci., 2014)

Longest common substrings with k mismatches. - Tomás Flouri; Emanuele Giaquinta; Kassian Kobert; Esko Ukkonen (Inf. Process. Lett., 2015)

The Divisible Load Balance Problem with Shared Cost and Its Application to Phylogenetic Inference. - Constantin Scholl; Kassian Kobert; Tomás Flouri; Alexandros Stamatakis (IPDPS Workshops, 2016)

Mathematical Problems in Molecular Evolution and Next Generation Sequencing - Kassian Kobert (2016)

An Efficient Approach to Merging Paired-End Reads and Incorporation of Uncertainties. - Tomás Flouri; Jiajie Zhang; Lucas Czech; Kassian Kobert; Alexandros Stamatakis (Algorithms for Next-Generation Sequencing Data, 2017)

Multi-rate Poisson tree processes for single-locus species delimitation under maximum likelihood and Markov chain Monte Carlo. - Paschalia Kapli; Sarah Lutteropp; Jiajie Zhang; Kassian Kobert; Pavlos Pavlidis; Alexandros Stamatakis; Tomás Flouri (Bioinform., 2017)