A linear-time algorithm for finding the longest segment which scores above a given threshold
| dc.creator | Csűrös, Miklós | |
| dc.date | 2005-12-04 | |
| dc.date | 2006-03-12 | |
| dc.date.accessioned | 2026-07-07T06:53:47Z | |
| dc.date.available | 2026-07-07T06:53:47Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/0512016 | |
| dc.identifier | http://arxiv.org/abs/cs/0512016 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/105713 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | Computational Engineering, Finance, and Science | |
| dc.subject | F.2.2; G.2; J.3 | |
| dc.title | A linear-time algorithm for finding the longest segment which scores above a given threshold | |
| dc.type | text |