COCOON: Ninth International Computing and Combinatorics Conference
2697 of Lecture Notes in Computer Science
This paper considers several variations of an optimization problem with potential applications in such areas as biomolecular sequence analysis and image processing. Given a sequence of items, each with a weight and a length, the goal is to find a subsequence of consecutive items of optimal value, where value is either total weight or total weight divided by total length. There may also be a specified lower and/or upper bound on the acceptable length of subsequences. This paper shows that all the variations of the problem are solvable in linear time and space even with non-uniform item lengths and divisible items, implying that run-length encoded sequences can be handled in time and space linear in the number of runs. Furthermore, some problem variations can be solved in constant space. Also, these time and space bounds suffice for certain problem variations in which we call for reporting of many “good” subsequences.
Ronald I. Greenberg. Fast and space-efficient location of heavy or dense segments in run-length encoded sequences. In COCOON: Ninth International Computing and Combinatorics Conference, volume 2697 of Lecture Notes in Computer Science, pages 528--536. Springer-Verlag, 2003.
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.