A linear-time algorithm for finding the longest segment which scores above a given threshold
数据结构与算法
2007-05-23 v2 计算工程、金融与科学
摘要
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.
引用
@article{arxiv.cs/0512016,
title = {A linear-time algorithm for finding the longest segment which scores above a given threshold},
author = {Miklós Csűrös},
journal= {arXiv preprint arXiv:cs/0512016},
year = {2007}
}