Tomás Flouri

Publication Activity (10 Years)

Years Active: 2008-2019
Publications (10 Years): 5

Top Topics

Maximum Likelihood

Sequence Alignment

Top Venues

IPDPS Workshops

J. Discrete Algorithms

Theor. Comput. Sci.

Publications

Alexey M. Kozlov, Diego Darriba, Tomás Flouri, Benoit Morel, Alexandros Stamatakis
RAxML-NG: a fast, scalable and user-friendly tool for maximum likelihood phylogenetic inference. Bioinform. 35 (21) (2019)
Benoit Morel, Tomás Flouri, Alexandros Stamatakis
A Novel Heuristic for Data Distribution in Massively Parallel Phylogenetic Inference Using Site Repeats. HPCC/SmartCity/DSS (2017)
Paschalia Kapli, Sarah Lutteropp, Jiajie Zhang, Kassian Kobert, Pavlos Pavlidis, Alexandros Stamatakis, Tomás Flouri
Multi-rate Poisson tree processes for single-locus species delimitation under maximum likelihood and Markov chain Monte Carlo. Bioinform. 33 (11) (2017)
Diep Thi Hoang, Le Sy Vinh, Tomás Flouri, Alexandros Stamatakis, Arndt von Haeseler, Bui Quang Minh
A new phylogenetic tree sampling method for maximum parsimony bootstrapping and proof-of-concept implementation. KSE (2016)
Constantin Scholl, Kassian Kobert, Tomás Flouri, Alexandros Stamatakis
The Divisible Load Balance Problem with Shared Cost and Its Application to Phylogenetic Inference. IPDPS Workshops (2016)
Tomás Flouri, Emanuele Giaquinta, Kassian Kobert, Esko Ukkonen
Longest common substrings with k mismatches. Inf. Process. Lett. 115 (6-8) (2015)
Carl Barton, Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis
Global and local sequence alignment with a bounded number of gaps. Theor. Comput. Sci. 582 (2015)
Tomás Flouri, Emanuele Giaquinta, Kassian Kobert, Esko Ukkonen
Longest common substrings with k mismatches. CoRR (2014)
Kassian Kobert, Tomás Flouri, Andre J. Aberer, Alexandros Stamatakis
The Divisible Load Balance Problem and Its Application to Phylogenetic Inference. WABI (2014)
Jiajie Zhang, Kassian Kobert, Tomás Flouri, Alexandros Stamatakis
PEAR: a fast and accurate Illumina Paired-End reAd mergeR. Bioinform. 30 (5) (2014)
Michalis Christou, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis, Jan Zdárek
Tree template matching in unranked ordered trees. J. Discrete Algorithms 20 (2013)
Nikolaos Alachiotis, Simon A. Berger, Tomás Flouri, Solon P. Pissis, Alexandros Stamatakis
libgapmis: extending short-read alignments. BMC Bioinform. 14 (S-11) (2013)
Diego Darriba, Andre J. Aberer, Tomás Flouri, Tracy A. Heath, Fernando Izquierdo-Carrasco, Alexandros Stamatakis
Boosting the Performance of Bayesian Divergence Time Estimation with the Phylogenetic Likelihood Library. IPDPS Workshops (2013)
Tomás Flouri, Kassian Kobert, Solon P. Pissis, Alexandros Stamatakis
An Optimal Algorithm for Computing All Subtree Repeats in Trees. IWOCA (2013)
Fernando Izquierdo-Carrasco, Nikolaos Alachiotis, Simon A. Berger, Tomás Flouri, Solon P. Pissis, Alexandros Stamatakis
A Generic Vectorization Scheme and a GPU Kernel for the Phylogenetic Likelihood Library. IPDPS Workshops (2013)
Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W. F. Smyth, Wojciech Tyczynski
Enhanced string covering. Theor. Comput. Sci. 506 (2013)
Carl Barton, Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis
GapsMis: flexible sequence alignment with a bounded number of gaps. BCB (2013)
Nikolaos Alachiotis, Simon A. Berger, Tomás Flouri, Solon P. Pissis, Alexandros Stamatakis
Libgapmis: An ultrafast library for short-read single-gap alignment. BIBM Workshops (2012)
Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
Tree template matching in ranked ordered trees by pushdown automata. J. Discrete Algorithms 17 (2012)
Tomás Flouri, Costas S. Iliopoulos, Kunsoo Park, Solon P. Pissis
GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures. AIAI (2) (2012)
Borivoj Melichar, Jan Janousek, Tomás Flouri
Arbology: Trees and pushdown automata. Kybernetika 48 (3) (2012)
Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
Computing all subtree repeats in ordered trees. Inf. Process. Lett. 112 (24) (2012)
Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, William F. Smyth, Wojciech Tyczynski
New and Efficient Approaches to the Quasiperiodic Characterisation of a String. Stringology (2012)
Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis
Computing All Subtree Repeats in Ordered Ranked Trees. SPIRE (2011)
Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis
Tree Indexing by Pushdown Automata and Repeats of Subtrees. FedCSIS (2011)
Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis
DynMap: mapping short reads to multiple related genomes. BCB (2011)
Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata. CIAA (2011)
Tomás Flouri, Kunsoo Park, Kimon Frousios, Solon P. Pissis, Costas S. Iliopoulos, German Tischler
Approximate string-matching with a single gap for sequence alignment. BCB (2011)
Tomás Flouri, Borivoj Melichar, Jan Janousek
Aho-Corasick like multiple subtree matching by pushdown automata. SAC (2010)
Tomás Flouri, Jan Holub, Costas S. Iliopoulos, Solon P. Pissis
An algorithm for mapping short reads to a dynamically changing genomic sequence. BIBM (2010)
Tomás Flouri, Jan Janousek, Borivoj Melichar
Subtree matching by pushdown automata. Comput. Sci. Inf. Syst. 7 (2) (2010)
Tomás Flouri, Borivoj Melichar, Jan Janousek
Subtree matching by deterministic pushdown automata. IMCSIT (2009)
Tomás Flouri, Costas S. Iliopoulos, Mohammad Sohel Rahman, Ladislav Vagner, Michal Vorácek
Indexing Factors in DNA/RNA Sequences. BIRD (2008)