扫描二维码关注“博士后招聘网”微信订阅号或微信搜一搜“博士后招聘网”关注我们。
当前位置: 博士后招聘网 > 国外博士后招聘 > 荷兰马斯特里赫特大学2020年招聘博士后职位(植物遗传学/算法优化)

荷兰马斯特里赫特大学2020年招聘博士后职位(植物遗传学/算法优化)

信息来源:未知 | 作者:admin | 时间:2020-09-11 09:36

【简介】博士后招聘网整理分享“荷兰马斯特里赫特大学2020年招聘博士后职位(植物遗传学/算法优化)”,浏览查询更多博士后招聘计划请访问博士后招聘网

荷兰马斯特里赫特大学2020年招聘博士后职位(植物遗传学/算法优化)

JOB DESCRIPTION

The successful candidate will conduct research into the application of kernelization to problems arising in the study of evolutionary trees. The project is primarily algorithmic-theoretical. Knowledge of biology or phylogenetics (which is the study of evolutionary trees) is not required.

Expressed simply, different methods for the inference of evolutionary trees often produce trees with conflicting topologies and we wish to rigorously quantify how dissimilar the trees truly are. A number of dissimilarity measures in the literature are computationally difficult (NP-hard) to compute and we wish to make computation of such distances easier. One approach is to systematically reduce the trees in size without damaging the information within them, in such a way that we can analytically derive bounds on the size of the reduced instances. This technique is called kernelization, which belongs to the wider field of parameterized complexity.

Recent research has shown that there is still much untapped potential for kernelization in the computation of phylogenetic dissimilarity measures. The primary goal of this project is therefore to develop deeper, more aggressive reduction rules, and to explore the theoretical limits of this technique: just how small can we make such trees? There is a primary focus on the much-studied (unrooted) maximum agreement forest problem. The successful candidate will also research branching algorithms, exponential-time algorithms and polynomial-time approximation algorithms, but kernelization is the main focus of this project.

The project, which is funded by the NWO KLEIN 1 grant “Deep kernelization for phylogenetic discordance”, will be embedded in the Algorithms, Complexity and Optimization (ALGOPT) group at Maastricht University’s Department of Data Science and Knowledge Engineering. Research within ALGOPT focuses on developing and analyzing algorithms with rigorous and verifiable performance guarantees. There is a strong focus on the design and analysis of exact, parameterized, approximation, online and randomized algorithms.

The full-time position is offered for a duration of four years, with yearly evaluations.

REQUIREMENTS

1. A master’s degree (completed, or to be completed shortly) in computer science, (applied) mathematics, operations research or a closely related field;

2. Affinity with algorithm design / combinatorial optimization. Prior knowledge of kernelization (or more generally, parameterized complexity) is a bonus but not essential;

3. Experience with writing mathematical proofs;

4. Programming skills are a bonus, but are by no means essential;

5. Excellent English language skills;

6. Good presentation, communication and organization skills.

请您在邮件申请时在标题注明信息来自:博士后招聘网-boshihoujob.com,电话咨询时说明从博士后招聘网(www.boshihoujob.com)看到的博士后招聘信息。

声明:凡本网注明“来源:XXX”的文/图等稿件,本网转载出于传递更多信息及方便产业探讨之目的,并不意味着本站赞同其观点或证实其内容的真实性,文章内容仅供参考。如其他媒体、网站或个人从本网站转载使用,须保留本网站注明的“来源”,并自负版权等法律责任。作者如果不希望被转载或者联系转载等事宜,请与我们联系。邮箱:boshihoujob@163.com。

博士后招聘网微信公众号

博士后招聘网微信公众号

扫描二维码关注公众号,ID:boshihoujob

发布博士后招聘信息 加入博士人才库

博士&博士后社群

  • 博士后招聘1号群
    799173148

  • 博士后招聘2号群
    373726562

  • 哲学博士群
    934079716

  • 经济学博士群
    945762011

  • 法学博士群
    934096817

  • 教育学博士群
    934118244

  • 文学博士群
    934106321

  • 历史学博士群
    945803407

  • 理学博士群
    934102752

  • 工学博士群
    945827064

  • 农学博士群
    114347294

  • 医学博士群
    729811942

  • 管理学博士群
    797229360

Copyright©2018-2023 博士后招聘网(boshihoujob.com) 版权所有 皖ICP备18007485号-1 皖公网安备 34070202000340号

本网站所有资讯内容、广告信息,未经书面同意,不得转载。

博士后招聘网(www.boshihoujob.com)专注服务于海内外博士后研究人员。

博士后招收信息发布请联系邮箱boshihoujob@163.com,QQ:878065319,微信号:bshjob001。
联系时请注明单位名称(如:单位名称+博士后招收信息发布)。