Minimizer-space computation

As the volume of DNA sequencing data increases, the need for algorithmic advances to efficiently handle the data arises. One such concept is minimizers, which are genomic substrings that allow for reduced representations of larger DNA sequences. In this thesis, we introduce minimizer-space computation as a new algorithmic paradigm for DNA sequence analysis. Instead of DNA nucleotides, we consider minimizers as the letters of an extended alphabet in which algorithms operate. We present several techniques on how to efficiently construct these extended alphabets, demonstrate how to develop approaches that use these alphabets and consequently use only a fraction of sequence data, and show how fundamental biological tasks, such as genome assembly and read mapping, can be significantly accelerated over state-of-the-art methods.

Name thesis:degree_name

Doctoral

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2025

Author dc:creator

• Ekim, Barış C.

Advisor dc:contributor.advisor

• Berger, Bonnie

Statement dc:rights

• Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
• Copyright retained by author(s)

Licence dc:rights.uri

• https://creativecommons.org/licenses/by-nc-nd/4.0/

Handle dc:identifier.uri

https://hdl.handle.net/1721.1/164050

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/164050