Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint

DOI10.1016/J.IPL.2005.08.006zbMath1184.68208OpenAlexW2048631281MaRDI QIDQ1044737

Kun-Mao Chao, Kuan-Yu Chen

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/154523/1/07.pdf

zbMATH Keywords

algorithmssequence analysislongest segmentshortest segment

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (6)

On the range maximum-sum segment query problem ⋮ Cache oblivious algorithms for the RMQ and the RMSQ problems ⋮ Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence ⋮ Detecting regular visit patterns ⋮ Improved algorithms for the \(k\) maximum-sums problems ⋮ MINKOWSKI SUM SELECTION AND FINDING

Uses Software

• MAVG
• SEGID

Cites Work

• Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
• Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
• An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics
• An Optimal Algorithm for the Maximum-Density Segment Problem
• Algorithms and Computation

This page was built for publication: Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint