Seedability: optimizing alignment parameters for sensitive sequence comparison.
Autor: | Ayad LAK; Department of Computer Science, Brunel University London, London UB8 3PH, UK., Chikhi R; G5 Sequence Bioinformatics, Institut Pasteur, Université Paris Cité, 75015 Paris, France., Pissis SP; Networks & Optimization, CWI, 1098 XG Amsterdam, The Netherlands.; Department of Computer Science, Vrije Universiteit, 1081 HV Amsterdam, The Netherlands. |
---|---|
Jazyk: | angličtina |
Zdroj: | Bioinformatics advances [Bioinform Adv] 2023 Aug 12; Vol. 3 (1), pp. vbad108. Date of Electronic Publication: 2023 Aug 12 (Print Publication: 2023). |
DOI: | 10.1093/bioadv/vbad108 |
Abstrakt: | Motivation: Most sequence alignment techniques make use of exact k -mer hits, called seeds, as anchors to optimize alignment speed. A large number of bioinformatics tools employing seed-based alignment techniques, such as Minimap2 , use a single value of k per sequencing technology, without a strong guarantee that this is the best possible value. Given the ubiquity of sequence alignment, identifying values of k that lead to more sensitive alignments is thus an important task. To aid this, we present Seedability , a seed-based alignment framework designed for estimating an optimal seed k -mer length (as well as a minimal number of shared seeds) based on a given alignment identity threshold. In particular, we were motivated to make Minimap2 more sensitive in the pairwise alignment of short sequences. Results: The experimental results herein show improved alignments of short and divergent sequences when using the parameter values determined by Seedability in comparison to the default values of Minimap2 . We also show several cases of pairs of real divergent sequences, where the default parameter values of Minimap2 yield no output alignments, but the values output by Seedability produce plausible alignments. Availability and Implementation: https://github.com/lorrainea/Seedability (distributed under GPL v3.0). Competing Interests: None declared. (© The Author(s) 2023. Published by Oxford University Press.) |
Databáze: | MEDLINE |
Externí odkaz: | |
Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |