Minimal Discriminating Words Problem Revisited - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Minimal Discriminating Words Problem Revisited

Résumé

We revisit two variants of the problem of computing minimal discriminating words studied in [5]. Given a pattern P and a threshold d, we want to report (i) all shortest extensions of P which occur in less than d documents, and (ii) all shortest extensions of P which occur only in d selected documents. For the first problem, we give an optimal solution with constant time per output word. For the second problem, we propose an algorithm with running time O(|P|+d (1+output)) improving the solution of [5].

Dates et versions

hal-00824740 , version 1 (22-05-2013)

Identifiants

Citer

Pawel Gawrychowski, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya. Minimal Discriminating Words Problem Revisited. 20th International Symposium on String Processing and Information Retrieval (SPIRE 2013), Oct 2013, Jerusalem, Israel. pp.129-140, ⟨10.1007/978-3-319-02432-5_17⟩. ⟨hal-00824740⟩
487 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More