arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.00306cs.DS
收藏

qPMS Sigma——一种用于植入式 $(l,d)$ 基序搜索问题的高效精确并行算法

qPMS Sigma -- An Efficient and Exact Parallel Algorithm for the Planted $(l, d)$ Motif Search Problem

Saurav Dhar, Amlan Saha, Dhiman Goswami, Md. Abul Kashem Mia

AI总结:

本文针对 DNA 序列中的 qPMS 问题,基于 qPMSPrune、qPMS7、TraverStringRef 和 PMS8,提出结合字符串压缩与位运算的精确算法 qPMS Sigma,并给出并行化思路,性能略优于现有精确算法。

摘要:

基序发现是检测一组 DNA 或蛋白质序列中发生的稀有事件的重要步骤。提取有关这些稀有事件的信息可以带来新的生物学发现。基序是一些重要的模式,具有众多应用,包括识别转录因子及其结合位点、复合调控模式、蛋白质家族之间的相似性等。尽管文献中已经研究了多种类型的基序搜索算法,但我们研究的是被称为 $(l,d)$-基序搜索或植入式基序搜索(Planted Motif Search,PMS)的版本。在 PMS 中,给定两个整数 $l$、$d$ 和 $n$ 条输入序列,我们尝试找出所有长度为 $l$、在每条输入序列中均出现且至多有 $d$ 个错配的模式。我们还在工作中讨论了 PMS 的法定人数版本,该版本寻找并非植入所有输入序列、而是至少植入其中 $q$ 条序列的基序。我们的算法主要基于 qPMSPrune、qPMS7、TraverStringRef 和 PMS8 算法。我们引入了若干技术来压缩输入字符串,并利用位运算实现字符串之间更快的比较。在解决 DNA 序列中的 qPMS 问题时,我们的算法表现略优于现有精确算法。我们还提出了一种并行实现该算法的思路。

英文摘要:

Motif finding is an important step for the detection of rare events occurring in a set of DNA or protein sequences. Extraction of information about these rare events can lead to new biological discoveries. Motifs are some important patterns that have numerous applications including the identification of transcription factors and their binding sites, composite regulatory patterns, similarity between families of proteins, etc. Although several flavors of motif searching algorithms have been studied in the literature, we study the version known as $ (l, d) $-motif search or Planted Motif Search (PMS). In PMS, given two integers $ l $, $ d $ and $ n $ input sequences we try to find all the patterns of length $ l $ that appear in each of the $ n $ input sequences with at most $ d $ mismatches. We also discuss the quorum version of PMS in our work that finds motifs that are not planted in all the input sequences but at least in $ q $ of the sequences. Our algorithm is mainly based on the algorithms qPMSPrune, qPMS7, TraverStringRef and PMS8. We introduce some techniques to compress the input strings and make faster comparison between strings with bitwise operations. Our algorithm performs a little better than the existing exact algorithms to solve the qPMS problem in DNA sequence. We have also proposed an idea for parallel implementation of our algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑