Now showing items 1-1 of 1

  • 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 ...

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