Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Adler, Enno"'
Constructing the Burrows-Wheeler transform (BWT) for long strings poses significant challenges regarding construction time and memory usage. We use a prefix of the suffix array to partition a long string into shorter substrings, thereby enabling the
Externí odkaz:
http://arxiv.org/abs/2406.10610
Neighborhood queries and triple queries are the most common queries on graphs; thus, it is desirable to answer them efficiently on compressed data structures. We present a compression scheme called Incidence-Type-RePair (ITR) for graphs with labeled
Externí odkaz:
http://arxiv.org/abs/2306.01028
Neighborhood queries are the most common queries on graphs; thus, it is desirable to answer them efficiently on compressed data structures. We present a compression scheme called Incidence-Type-RePair (ITR) for graphs with labeled nodes and labeled e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ee5bff33d6bd6d920b8a10296a02d9c
http://arxiv.org/abs/2306.01028
http://arxiv.org/abs/2306.01028