All jobs in English

All jobs in Dutch

  • Title
  • List 2
  • List 2
  • Title
  • List 3
  • List 3
  • Title
  • List 4
  • List 4

Heb je het al gezien? Op verzoek van onze bezoekers vind je nu extra informatie bij onze vacatures of een zoekopdracht. En je kunt de resultaten makkelijk filteren met het nieuwe menu aan de linkerkant. Benieuwd? Verken deze nieuwe features nu!

Fijne feestdagen!

31-5-2017: website vanmiddag 31 mei niet beschikbaar in verband met gepland onderhoud
lees meer...
Vanmiddag 31 mei vanaf 16:30 uur tot 17:00 uur CET (UTC +1) is onderhoud voor deze website gepland.

De website zal gedurende deze periode niet beschikbaar zijn.

Wij adviseren u dringend rond en tijdens deze tijd niet te solliciteren op vacatures.

Onze excuses voor het ondervonden ongemak,
team AcademicTransfer.

Vacature - Postdoc position: algorithmic graph theory and phylogenetics HRS4R

Postdoc position: algorithmic graph theory and phylogenetics ath the Department Data Science and Knowledge Engineering at Maastricht University.

Specificaties - (uitleg)

Locatie Maastricht
FunctietypesPostdoc positions
Wetenschappelijke disciplineEngineering
Uren 38,0 uren per week
Salaris € 2532 - € 3997
Werk-/denkniveauDoctorate
Vacaturenummer AT2016.36
Vertalingen
About employer Maastricht University (UM)
Short link www.academictransfer.com/31782

Functiebeschrijving

This postdoc position, for a minimum of 2 years, seeks to explore the interface between algorithmic graph theory and phylogenetics. Phylogenetics is the science of inferring evolutionary trees and networks; a phylogenetic tree (network) is simply a tree (directed acyclic graph) in which the leaves are labelled by a set of species X.

The postdoc will be based at the Department of Data Science and Knowledge Engineering (DKE) at Maastricht University in the Netherlands, where the research will be embedded within the Networks and Strategic Optimization (NSO) research cluster of DKE. The main coordinator of the project is Dr. Steven Kelk. The project is made possible by an NWO TOP grant.

Functie-eisen

A completed PhD in a relevant field is required. Relevant keywords are phylogenetics, fixed parameter tractability, width parameters (particularly treewidth), (algorithmic) graph theory, combinatorial optimization and computational complexity. Candidates with expertise in any or all of these topics are encouraged to apply.

Experience with or knowledge of biology is not necessary. A willingness to work on the kind of NP-hard discrete optimization problems that arise in the area of phylogenetics is, however, essential.

One example of such a problem is that of constructing a Maximum Agreement Forest (MAF) of two phylogenetic trees. Informally, this is the problem of making as few edge deletions as possible in the two trees, such that the resulting subtrees are (essentially) isomorphic (see also Fundamentals of Parameterized Complexity by Downey and Fellows 2013, Chapter 4).

MAF and related problems are gaining an increasing amount of attention from the traditional algorithms community. The goal of this project is to consolidate and deepen the embedding of phylogenetics problems in the algorithmic literature, and a corresponding level of ambition is expected of the candidate.

Candidates should have an excellent command of English, both in terms of speaking and writing.

Arbeidsvoorwaarden

A temporary position for a minimum of two years as a researcher in the preliminary salary scale 10 (min. € 2532 and max. € 3997).

The terms of employment of MaastrichtUniversity are set out in the Collective Labour Agreement of Dutch Universities (CAO). Furthermore, local UM provisions also apply. For more information look at the website http://www.maastrichtuniversity.nl, employees, A-Z

 

Dienstverband: Temporary, two years

U kunt niet meer op deze vacature solliciteren / You cannot apply for this job anymore..

Meer informatie over en actuele vacatures van Maastricht University (UM) on AcademicTransfer.

More vacancies of function type: Postdoc positions;
of scientific field: Engineering.
bewaar

Postdoc position: algorithmic graph theory and phylogenetics ath the Department Data Science and Knowledge Engineering at Maastricht University.

Specificaties - (uitleg)

Locatie Maastricht
FunctietypesPostdoc positions
Wetenschappelijke disciplineEngineering
Uren 38,0 uren per week
Salaris € 2532 - € 3997
Werk-/denkniveauDoctorate
Vacaturenummer AT2016.36
Vertalingen
About employer Maastricht University (UM)
Short link www.academictransfer.com/31782

Functiebeschrijving

This postdoc position, for a minimum of 2 years, seeks to explore the interface between algorithmic graph theory and phylogenetics. Phylogenetics is the science of inferring evolutionary trees and networks; a phylogenetic tree (network) is simply a tree (directed acyclic graph) in which the leaves are labelled by a set of species X.

The postdoc will be based at the Department of Data Science and Knowledge Engineering (DKE) at Maastricht University in the Netherlands, where the research will be embedded within the Networks and Strategic Optimization (NSO) research cluster of DKE. The main coordinator of the project is Dr. Steven Kelk. The project is made possible by an NWO TOP grant.

Functie-eisen

A completed PhD in a relevant field is required. Relevant keywords are phylogenetics, fixed parameter tractability, width parameters (particularly treewidth), (algorithmic) graph theory, combinatorial optimization and computational complexity. Candidates with expertise in any or all of these topics are encouraged to apply.

Experience with or knowledge of biology is not necessary. A willingness to work on the kind of NP-hard discrete optimization problems that arise in the area of phylogenetics is, however, essential.

One example of such a problem is that of constructing a Maximum Agreement Forest (MAF) of two phylogenetic trees. Informally, this is the problem of making as few edge deletions as possible in the two trees, such that the resulting subtrees are (essentially) isomorphic (see also Fundamentals of Parameterized Complexity by Downey and Fellows 2013, Chapter 4).

MAF and related problems are gaining an increasing amount of attention from the traditional algorithms community. The goal of this project is to consolidate and deepen the embedding of phylogenetics problems in the algorithmic literature, and a corresponding level of ambition is expected of the candidate.

Candidates should have an excellent command of English, both in terms of speaking and writing.

Arbeidsvoorwaarden

A temporary position for a minimum of two years as a researcher in the preliminary salary scale 10 (min. € 2532 and max. € 3997).

The terms of employment of MaastrichtUniversity are set out in the Collective Labour Agreement of Dutch Universities (CAO). Furthermore, local UM provisions also apply. For more information look at the website http://www.maastrichtuniversity.nl, employees, A-Z

 

Dienstverband: Temporary, two years

Login met LinkedIn om je connecties te zien met:

Maastricht University (UM)