CERIST Digital Library est le dépôt institutionnel du Centre de Recherche sur l'Information Scientifique et Technique qui donne accès à toute la production du CERIST: articles de conférence, rapports techniques ou de recherche, thèses, supports de cours, etc. .

Dans CERIST DL, vous pouvez :

Parcourir la production scientifique du CERIST par communautés, collections, auteurs, etc.

Rechercher par : Titre, Auteur, Mots clés, Date de publication, Date de soumission, etc.

Consulter les différents articles et produits. Il est à noter que certains articles sont soumis à une restriction d'accès.

Recevoir des alertes sur les nouveaux articles et items et cela, en vous abonnant à une ou plusieurs collections.

Select a community to browse its collections.

  • Fast Label Extraction in the CDAWG 

    Belazzougui, Djamal; Cunial, Fabio
    In : (Springer, Palerme, Italie, 2017-09-06)
    The compact directed acyclic word graph (CDAWG) of a string T of length n takes space proportional just to the number e of right extensions of the maximal repeats of T, and it is thus an appealing index for highly repetitive datasets, like collections of genomes from similar species, in which e grows significantly more ...
  • A Framework for Space-Efficient String Kernels 

    Belazzougui, Djamal; Cunial, Fabio
    In : (Springer, 2017-02-17)
    String kernels are typically used to compare genome-scale sequences whose length makes alignment impractical, yet their computation is based on data structures that are either space-inefficient, or incur large slowdowns. We show that a number of exact kernels on pairs of strings of total length n, like the k-mer kernel, ...
  • Flexible Indexing of Repetitive Collections 

    Belazzougui, Djamal; Cunial, Fabio; Gagie, Travis; Prezza, Nicola; Raffinot, Mathieu
    In : (Springer, Turku, Finlande., 2017-06-07)
    Highly repetitive strings are increasingly being amassed by genome sequencing experiments, and by versioned archives of source code and webpages. We describe practical data structures that support count- ing and locating all the exact occurrences of a pattern in a repetitive text, by combining the run-length encoded ...
  • Representing the Suffix Tree with the CDAWG 

    Belazzougui, Djamal; Cunial, Fabio
    In : (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Varsovie, 2017-07-04)
    Given a string T, it is known that its suffix tree can be represented using the compact directed acyclic word graph (CDAWG) with e_T arcs, taking overall O(e_T+e_REV(T)) words of space, where REV(T) is the reverse of T, and supporting some key operations in time between O(1) and O(log(log(n))) in the worst case. This ...
  • New Technique to Deal With Verbose Queries in Social Book Search 

    Chaa, Messaoud; Nouali, Omar; Bellot, Patrice
    In : Rapports de recherche internes, (CERIST, Alger, 2017)
    Verbose query reduction and query term weighting are automatic techniques to deal with verbose queries.

View more


Tous les documents dans CERIST DIGITAL LIBRARY sont protégés par copyright, avec tous droits réservés. copyright © 2013-2015  CERIST
Powered by 
@mire NV