Exact Sketch-Based Read Mapping

Schulz T, Medvedev P (2023)
In: 23rd International Workshop on Algorithms in Bioinformatics. Belazzougui D, Ouangraoua A, Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH (Eds); Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Konferenzbeitrag | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Schulz, TizianUniBi ; Medvedev, Paul
Herausgeber*in
Belazzougui, Djamal; Ouangraoua, Aïda
herausgebende Körperschaft
Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH
Abstract / Bemerkung
Given a sequencing read, the broad goal of read mapping is to find the location(s) in the reference genome that have a "similar sequence". Traditionally, "similar sequence" was defined as having a high alignment score and read mappers were viewed as heuristic solutions to this well-defined problem. For sketch-based mappers, however, there has not been a problem formulation to capture what problem an exact sketch-based mapping algorithm should solve. Moreover, there is no sketch-based method that can find all possible mapping positions for a read above a certain score threshold. In this paper, we formulate the problem of read mapping at the level of sequence sketches. We give an exact dynamic programming algorithm that finds all hits above a given similarity threshold. It runs in {O}(|t| + |p| + 𝓁²) time and Θ(𝓁²) space, where |t| is the number of k-mers inside the sketch of the reference, |p| is the number of k-mers inside the read’s sketch and 𝓁 is the number of times that k-mers from the pattern sketch occur in the sketch of the text. We evaluate our algorithm’s performance in mapping long reads to the T2T assembly of human chromosome Y, where ampliconic regions make it desirable to find all good mapping positions. For an equivalent level of precision as minimap2, the recall of our algorithm is 0.88, compared to only 0.76 of minimap2.
Erscheinungsjahr
2023
Titel des Konferenzbandes
23rd International Workshop on Algorithms in Bioinformatics
Page URI
https://pub.uni-bielefeld.de/record/2982645

Zitieren

Schulz T, Medvedev P. Exact Sketch-Based Read Mapping. In: Belazzougui D, Ouangraoua A, Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, eds. 23rd International Workshop on Algorithms in Bioinformatics. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023.
Schulz, T., & Medvedev, P. (2023). Exact Sketch-Based Read Mapping. In D. Belazzougui, A. Ouangraoua, & Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH (Eds.), 23rd International Workshop on Algorithms in Bioinformatics Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.WABI.2023.14
Schulz, Tizian, and Medvedev, Paul. 2023. “Exact Sketch-Based Read Mapping”. In 23rd International Workshop on Algorithms in Bioinformatics, ed. Djamal Belazzougui, Aïda Ouangraoua, and Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Schulz, T., and Medvedev, P. (2023). “Exact Sketch-Based Read Mapping” in 23rd International Workshop on Algorithms in Bioinformatics, Belazzougui, D., Ouangraoua, A., and Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH eds. (Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik).
Schulz, T., & Medvedev, P., 2023. Exact Sketch-Based Read Mapping. In D. Belazzougui, A. Ouangraoua, & Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, eds. 23rd International Workshop on Algorithms in Bioinformatics. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
T. Schulz and P. Medvedev, “Exact Sketch-Based Read Mapping”, 23rd International Workshop on Algorithms in Bioinformatics, D. Belazzougui, A. Ouangraoua, and Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, eds., Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
Schulz, T., Medvedev, P.: Exact Sketch-Based Read Mapping. In: Belazzougui, D., Ouangraoua, A., and Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH (eds.) 23rd International Workshop on Algorithms in Bioinformatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl (2023).
Schulz, Tizian, and Medvedev, Paul. “Exact Sketch-Based Read Mapping”. 23rd International Workshop on Algorithms in Bioinformatics. Ed. Djamal Belazzougui, Aïda Ouangraoua, and Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar