Tomás Flouri

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