We study a fundamental sequence algorithm arising from bioinformatics. Given two integers L and U and a sequence A of n numbers, the maximum-sum segment problem is to find a segment A[i, j] of A with L less than or equal to j-i+1 less than or equal to U t
關聯:
IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS
