一种线性时间算法,用于查找得分高于给定阈值的最长段
A linear-time algorithm for finding the longest segment which scores above a given threshold
摘要:
本文描述了一种线性时间算法,该算法在一个实数序列(“分数”)中找到最长的拉伸,其中总和超过输入参数。该算法还解决了找到平均分数高于固定阈值的最长间隔的问题。这个问题起源于分子序列分析:例如,该算法可以用于识别DNA序列中长的GC富集区域。该算法也可用于在全基因组组装的预处理步骤中修剪鸟枪序列的低质量末端。
英文摘要:
This paper describes a linear-time algorithm that finds the longest stretch in a sequence of real numbers (``scores'') in which the sum exceeds an input parameter. The algorithm also solves the problem of finding the longest interval in which the average of the scores is above a fixed threshold. The problem originates from molecular sequence analysis: for instance, the algorithm can be employed to identify long GC-rich regions in DNA sequences. The algorithm can also be used to trim low-quality ends of shotgun sequences in a preprocessing step of whole-genome assembly.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。