Alexandros Stamatakis

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 Kassian Kobert

> Home > Persons > Alexandros Stamatakis

Publications

2017
[j38]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/bioinformatics/KapliLZKPSF17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bioinformatics/KapliLZKPSF17
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)
[p1]
- view
  authority control:
- export record
  dblp key:
  - books/sp/17/FlouriZCKS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/books/sp/17/FlouriZCKS17
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
[c55]
- view
  authority control:
- export record
  dblp key:
  - conf/ipps/SchollKFS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipps/SchollKFS16
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
2014
[j34]
- view
  authority control:
- export record
  dblp key:
  - journals/bioinformatics/ZhangKFS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/bioinformatics/ZhangKFS14
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)
[j30]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/KobertHS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KobertHS14
Kassian Kobert, Jörg Hauser, Alexandros Stamatakis:
Is the Protein Model Assignment problem under linked branch lengths NP-hard? Theor. Comput. Sci. 524: 48-58 (2014)
[c52]
- view
  authority control:
- export record
  dblp key:
  - conf/wabi/KobertFAS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wabi/KobertFAS14
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
2013
[c47]
- view
  authority control:
- export record
  dblp key:
  - conf/isbra/HauserKIMMGS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isbra/HauserKIMMGS13
Jörg Hauser, Kassian Kobert, Fernando Izquierdo-Carrasco, Karen Meusemann, Bernhard Misof, Michael Gertz, Alexandros Stamatakis:
Heuristic Algorithms for the Protein Model Assignment Problem. ISBRA 2013: 137-148
[c46]
- view
  authority control:
- export record
  dblp key:
  - conf/iwoca/FlouriKPS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iwoca/FlouriKPS13
Tomás Flouri, Kassian Kobert, Solon P. Pissis, Alexandros Stamatakis:
An Optimal Algorithm for Computing All Subtree Repeats in Trees. IWOCA 2013: 269-282

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.