Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average

Let A be a sequence of n real numbers, L₁ and L₂ be two integers such that L₁ les L₂, and let R₁ and R₂ be two real numbers such that R₁ les R₂. An interval of A is feasible if its length is between L₁ and L₂, and its average is between R₁ and R₂. In this paper, we study the following problems: finding all feasible intervals of A, counting all feasible intervals of A, finding a maximum cardinality set of nonoverlapping feasible intervals of A, locating a longest feasible interval of A, and locating a shortest feasible interval of A. The problems are motivated from the problem of locating CpG islands in biomolecular sequences. In this paper, we first show that all the problems have an Omega (n log n)-time lower bound in the comparison model. Then, we use geometric approaches to design optimal algorithms for the problems. All the presented algorithms run in an online manner and use O(n) space.