Nadia Tahiri
3 months ago
This position has expired. You can find similar positions from the section below or browse our positions listing pages.
PhD, MSc, and Postdoc Opportunities in Algorithms for Bioinformatics and Phylogenetic Structures Université de Sherbrooke in Canada
Degree Level
Master's, PhD, Postdoc
Field of study
Computer Science
Funding
Funding is offered but listed as to be discussed. The lab page also notes support from the University of Sherbrooke, FRQNT, and NSERC, but no stipend amount or full funding details are specified.
Country
Canada
University
Université de Sherbrooke
How do I apply for this?
Sign in for free to reveal details, requirements, and source links.
Suggested positions
Keywords
About this position
Université de Sherbrooke is advertising MSc, PhD, internship, and postdoctoral opportunities in the Tahiri Lab with Nadia Tahiri, Associate Professor in Computer Science. The openings are centered on algorithms in bioinformatics, with a strong mix of theoretical computer science and applied computational biology.
The lab’s research focuses on phylogenetic structures, including phylogenetic trees and evolutionary networks, and on developing efficient methods and software for comparing these structures. Two specific projects are highlighted: Algorithms and Software for the Comparison of Phylogenetic Structures and Theoretical Foundations of Distances for Phylogenetic Structures. Research directions include algorithm design, data structures, complexity analysis, graph theory, combinatorial optimization, mathematical proofs, reproducible scientific software, and validation on simulated and real datasets.
For the MSc/PhD-oriented project, the university page says the position is intended for students with strong interest in algorithms and scientific software development, and it encourages internship students as well. Expected skills include solid algorithms/data structures, programming in Python or C++, and interest in efficient, robust software. For the theoretical project, a strong background in algorithms and discrete mathematics is recommended; interest in graph theory, computational complexity, and theoretical computer science is an asset. Bioinformatics or phylogenetics knowledge is welcome but not required for that project.
The post explicitly mentions MSc, PhD, and internship opportunities, and the university project pages also mention a postdoctoral stage for the theoretical project. Funding is listed as to be discussed, with the lab page noting support from the University of Sherbrooke, FRQNT, and NSERC, but no stipend amount is provided.
To apply, candidates should email [email protected] with a CV, recent transcripts, a statement of motivation, a recommendation letter, and two references. The post does not give a fixed deadline.
Funding details
Funding is offered but listed as to be discussed. The lab page also notes support from the University of Sherbrooke, FRQNT, and NSERC, but no stipend amount or full funding details are specified.
What's required
Applicants should be motivated students with a strong interest in algorithms in bioinformatics and both theoretical and applied research. For the comparison-of-phylogenetic-structures project, expected skills include solid foundations in algorithms and data structures, programming experience in Python, C++, or an equivalent scientific language, interest in software development and research tools, and ability to design efficient solutions. Helpful assets include knowledge of bioinformatics or phylogenetics, algorithmic optimization, and scientific software development. For the theoretical distances project, a strong background in algorithms and discrete mathematics is recommended, with interest in graph theory, computational complexity, mathematical proofs, and theoretical computer science. The MSc/PhD project is open to students in Computer Science, Mathematics, or related disciplines; interns are also encouraged to apply.
Ask ApplyKite AI
Professors
How do I apply for this?
Sign in for free to reveal details, requirements, and source links.