Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:

Please note: This master’s thesis presentation will be given online.

Lindsey Tulloch, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Ian Goldberg

Please note: This master’s thesis presentation will be given online.

Rory Soiffer, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Shalev Ben-David

Quantum query complexity measures the minimum number of queries a quantum algorithm needs to make to some input string to compute a function of that input. Query complexity models are widely used throughout quantum computing, from setting limits on quantum algorithms to analyzing post-quantum cryptography.

Please note: This master’s thesis presentation will be given online.

John Abraham Premkumar, Master’s candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Florian Kerschbaum

Please note: This master’s thesis presentation will be given online.

Wanxin Li, Master’s candidate
David R. Cheriton School of Computer Science

Supervisors: Professors Lila Kari, Yaoliang Yu

Tuesday, May 17, 2022 10:30 am - 11:30 am EDT (GMT -04:00)

Seminar • Bioinformatics • Probabilistic Models of k-mer Frequencies

Please note: This seminar will be presented in person in DC 1304 as well as streamed online.

Broňa Brejová, Department of Computer Science
Comenius University in Bratislava, Slovakia

Many successful tools in bioinformatics are based on working with k-mers, substrings of length k of the input sequences. In this talk, we will discuss two less-known areas where k-mers can be used.