Ondřej Sladký

About Me

I'm a first year Master's student of computer science at ETH Zürich. I obtained my Bachelor's degree in general computer science at Charles University.

Alongside my studies, I currently work at the Computer Science Institute of Charles University with Pavel Veselý and Karel Břinda on bioinformatics research projects of efficient representions and data structures for k-mer sets.

Previously, I interned at Eligo Bioscience, at DIMACS at Rutgers University, in Site Reliability Engineering (SRE) team at Google in Munich and in the CIMRA research group at the University of West Bohemia.

Co-creator of AiAiEyes, a mobile application to help the visually impaired to distinguish specific everyday objects. In past, I developed games on Android in the Whizzmot group.

Formerly, I participated in voluntary organization of Czech Olympiad in Informatics, a high school computer science competition Korespondenční Seminář z Programování. I was also a scientific comitee member of the Central European Olympiad in Informatics 2024.

Although my primary domain is theoretical computer science, my academic interests range from mathematics, computer science and artificial intelligence to software engineering, site reliability engineering and applied fields such as bioinformatics, genomics, finance and physics.

My personal interests are also broad, from various sports to playing the clarinet and reading. With a friend we've been writing a fantasy book.

Publications and preprints

FroM Superstring to Indexing: a space-efficient index for unconstrained k-mer sets using the Masked Burrows-Wheeler Transform (MBWT), with Pavel Veselý and Karel Břinda. [preprint] [software]

Towards efficient k-mer set operations via function-assigned masked superstrings, with Pavel Veselý and Karel Břinda. [preprint]

Masked superstrings as a unified framework for textual k-mer set representations, with Pavel Veselý and Karel Břinda. [preprint] [software]

Talks

Invited talk at Inria, Rennes, 2024: Masked superstrings as a datatype for k-mer sets

Sequences 2024, London: Masked superstrings as a unified framework for textual k-mer set representations

RECOMB-seq 2023, Istanbul: Masked superstrings as a unified framework for textual k-mer set representations (see the recording on YouTube)

Invited talk at Charles University in Prague, 2023: Masked superstrings as a unified framework for textual k-mer set representations