Sequence Covering Similarity for Symbolic Sequence Comparison
Texte intégral
Figure
Documents relatifs
férents motifs géométriques, de même que le lissage des couvertures en laine et, en poils de chameaux à rayures et motifs berbères très variés. I.a teint tire des laines,
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des
Assuming that the covering potential information given with any element is the name of the larger set containing it (in the final instance) we show that the competitive ratio of
More precisely, in the convex case, Quadratic Set Covering is approximable within ratio O (log 2 ( |C| )) by a randomized algorithm, and f 2 approximable (by a deterministic
A common core sequence is shared by the consensus sequence of the 3 minisatellites (msl, ms2, ms3), and shows a high homology with the consensus sequence of the tandem repeats
We also obtain results for the mean and variance of the number of overlapping occurrences of a word in a finite discrete time semi-Markov sequence of letters under certain
We show that the generic problem is NP-hard and that a greedy heuristic using dynamic programming at each step achieves an approximation ratio of ln d, where d is the maximum number
Local minima were obtained by performing a zero-temperature Monte-Carlo simulation with the energy function in Eq (2), starting from initial conditions corresponding to