Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Tomás Flouri

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Simon A. Berger

> Home > Persons > Tomás Flouri

Publications

2013
[j7]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/bmcbi/AlachiotisBFPS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bmcbi/AlachiotisBFPS13
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)
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/ipps/Izquierdo-CarrascoABFPS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipps/Izquierdo-CarrascoABFPS13
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
2012
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/bibm/AlachiotisBFPS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/bibm/AlachiotisBFPS12
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

a service of

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.