Computing the Minimum λ-Cover in Weighted Sequences
Given a weighted sequence X of length n and an integer constant λ, the minimum λ-cover problem of weighted sequences is to find the sets of λ factors of X each of equal length such that the set covers X, and the length of each element in the set is minimum. By constructing the Equivalence Class Tree and iteratively computing the occurrences of a set of factors in weighted sequences, we tackle the problem in O(n 2) time for constant alphabet size.
KeywordsWeighted sequence the minimum λ-cover problem λ-combination Equivalence Class Tree
Unable to display preview. Download preview PDF.
- 3.Cole, R., Iliopoulos, C.S., Mohamed, M., Smith, W.F., Yang, L.: Computing the Minimum k-cover of a String. In: Proc. of the 2003 Prague Stringology Conference (PSC 2003), pp. 51–64 (2003)Google Scholar
- 6.Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)Google Scholar
- 10.Iliopoulos, C.S., Smith, W.F.: An On-line Algorithm of Computing a Minimum Set of k-covers of a String. In: Proc. of the Ninth Australian Workshop on Combinatorial Algorithms (AWOCA), pp. 97–106 (1998)Google Scholar
- 14.The Human Genome Project (HGP), http://www.nbgri.nih.gov/HGP/