A linear-time algorithm for finding the longest segment which scores above a given threshold
<|reference_start|>A linear-time algorithm for finding the longest segment which scores above a given threshold: 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.<|reference_end|>
@article{csűrös2005a,
    title={A linear-time algorithm for finding the longest segment which scores
  above a given threshold},
    author={Mikl'os CsH{u}r"os},
    journal={arXiv preprint arXiv:cs/0512016},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0512016},
    primaryClass={cs.DS cs.CE}
}