id: 06105259
dt: a
an: 06105259
au: Zhang, Hui; Guo, Qing; Iliopoulos, Costas S.
ti: Computing the minimum $λ$-cover in weighted sequences.
so: Huang, De-Shuang (ed.) et al., Intelligent computing technology. 8th
    international conference, ICIC 2012, Huangshan, China, July 25‒29,
    2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31587-9/pbk).
    Lecture Notes in Computer Science 7389, 120-127 (2012).
py: 2012
pu: Berlin: Springer
la: EN
cc: 
ut: weighted sequence; the minimum $λ$-cover problem; $λ$-combination;
    equivalence class tree
ci: 
li: doi:10.1007/978-3-642-31588-6_16
ab: Summary: 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.
rv: