default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomás Flouri
Person information
- unicode name: Tomáš Flouri
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j12]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): 4453-4455 (2019)- 2017
- [j11]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): 1630-1638 (2017) - [c20]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: 81-88 - [p1]Tomás Flouri, Jiajie Zhang, Lucas Czech, Kassian Kobert, Alexandros Stamatakis:
An Efficient Approach to Merging Paired-End Reads and Incorporation of Uncertainties. Algorithms for Next-Generation Sequencing Data 2017: 299-325 - 2016
- [c19]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: 408-417 - [c18]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: 1-6 - 2015
- [j10]Tomás Flouri, Emanuele Giaquinta, Kassian Kobert, Esko Ukkonen:
Longest common substrings with k mismatches. Inf. Process. Lett. 115(6-8): 643-647 (2015) - [j9]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: 1-16 (2015) - 2014
- [j8]Jiajie Zhang, Kassian Kobert, Tomás Flouri, Alexandros Stamatakis:
PEAR: a fast and accurate Illumina Paired-End reAd mergeR. Bioinform. 30(5): 614-620 (2014) - [c17]Kassian Kobert, Tomás Flouri, Andre J. Aberer, Alexandros Stamatakis:
The Divisible Load Balance Problem and Its Application to Phylogenetic Inference. WABI 2014: 204-216 - [i1]Tomás Flouri, Emanuele Giaquinta, Kassian Kobert, Esko Ukkonen:
Longest common substrings with k mismatches. CoRR abs/1409.1694 (2014) - 2013
- [j7]Nikolaos Alachiotis, Simon A. Berger, Tomás Flouri, Solon P. Pissis, Alexandros Stamatakis:
libgapmis: extending short-read alignments. BMC Bioinform. 14(S-11): S4 (2013) - [j6]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: 51-60 (2013) - [j5]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: 102-114 (2013) - [c16]Carl Barton, Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis:
GapsMis: flexible sequence alignment with a bounded number of gaps. BCB 2013: 402 - [c15]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: 530-538 - [c14]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: 539-548 - [c13]Tomás Flouri, Kassian Kobert, Solon P. Pissis, Alexandros Stamatakis:
An Optimal Algorithm for Computing All Subtree Repeats in Trees. IWOCA 2013: 269-282 - 2012
- [j4]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): 958-962 (2012) - [j3]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: 15-23 (2012) - [j2]Borivoj Melichar, Jan Janousek, Tomás Flouri:
Arbology: Trees and pushdown automata. Kybernetika 48(3): 402-428 (2012) - [c12]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: 688-695 - [c11]Tomás Flouri, Costas S. Iliopoulos, Kunsoo Park, Solon P. Pissis:
GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures. AIAI (2) 2012: 593-601 - [c10]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: 75-88 - 2011
- [c9]Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis:
DynMap: mapping short reads to multiple related genomes. BCB 2011: 330-334 - [c8]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: 490-492 - [c7]Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis:
Tree Indexing by Pushdown Automata and Repeats of Subtrees. FedCSIS 2011: 899-902 - [c6]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: 338-343 - [c5]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: 273-281 - 2010
- [j1]Tomás Flouri, Jan Janousek, Borivoj Melichar:
Subtree matching by pushdown automata. Comput. Sci. Inf. Syst. 7(2): 331-357 (2010) - [c4]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: 133-136 - [c3]Tomás Flouri, Borivoj Melichar, Jan Janousek:
Aho-Corasick like multiple subtree matching by pushdown automata. SAC 2010: 2157-2158
2000 – 2009
- 2009
- [c2]Tomás Flouri, Borivoj Melichar, Jan Janousek:
Subtree matching by deterministic pushdown automata. IMCSIT 2009: 659-666 - 2008
- [c1]Tomás Flouri, Costas S. Iliopoulos, Mohammad Sohel Rahman, Ladislav Vagner, Michal Vorácek:
Indexing Factors in DNA/RNA Sequences. BIRD 2008: 436-445
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
