Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem
The maximum subarray problem (MSP) involves selection of a segment of consecutive array elements that has the largest possible sum over all other segments in a given array. The efficient algorithms for the MSP and related problems are expected to contribute to various applications in genomic sequenc...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
University of Canterbury. Computer Science and Software Engineering
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10092/1202 |