您的位置:中国博士人才网 > 博士后招收 > 海外博士后招收 > 荷兰马斯特里赫特大学植物遗传学/算法优化博士后职位

关注微信

荷兰马斯特里赫特大学植物遗传学/算法优化博士后职位

时间:2020-09-11来源:中国博士人才网 作者:佚名

 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。

为防止简历投递丢失请抄送一份至:boshijob@126.com(邮件标题格式:应聘职位名称+姓名+学历+专业+中国博士人才网)

中国-博士人才网发布

声明提示:凡本网注明“来源:XXX”的文/图等稿件,本网转载出于传递更多信息及方便产业探讨之目的,并不意味着本站赞同其观点或证实其内容的真实性,文章内容仅供参考。

通博彩票计划群 怎么玩极速赛车能赢 山东11选5 传奇彩票计划群 威尼斯人彩票计划群 环球一号彩票计划群 财神彩票计划群 内蒙古11选5 上海11选5走势 贵州快3走势