Zobrazeno 1 - 10
of 1 376
pro vyhledávání: '"compressed data structures"'
Autor:
Kempa, Dominik, Kociumaka, Tomasz
In the last decades, the necessity to process massive amounts of textual data fueled the development of compressed text indexes: data structures efficiently answering queries on a given text while occupying space proportional to the compressed repres
Externí odkaz:
http://arxiv.org/abs/2308.03635
Publikováno v:
IEEE Access 8, pp. 25949-25963 (2020)
Binary relations are commonly used in Computer Science for modeling data. In addition to classical representations using matrices or lists, some compressed data structures have recently been proposed to represent binary relations in compact space, su
Externí odkaz:
http://arxiv.org/abs/2002.09041
Publikováno v:
In Computers and Operations Research January 2018 89:82-93
Autor:
Munro, J. Ian, Nekrich, Yakov
We consider the problem of storing a dynamic string $S$ over an alphabet $\Sigma=\{\,1,\ldots,\sigma\,\}$ in compressed form. Our representation supports insertions and deletions of symbols and answers three fundamental queries: $\mathrm{access}(i,S)
Externí odkaz:
http://arxiv.org/abs/1507.06866
Publikováno v:
IEEE Access, Vol 8, Pp 25949-25963 (2020)
Binary relations are commonly used in Computer Science for modeling data. In addition to classical representations using matrices or lists, some compressed data structures have recently been proposed to represent binary relations in compact space, su
Externí odkaz:
https://doaj.org/article/f99901dcf0f84039af1e53de4763da09
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Sana Kashgouli, Dominik Köppl, Massimiliano Rossi
The positional Burrows–Wheeler Transform (PBWT) was presented in 2014 by Durbin as a means to find all maximal haplotype matches inhsequences containingwvariation sites in 𝒪(hw)-time. This time complexity of finding maximal haplotype matches usi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa8a9a15adfac262522be64c31c3ea01
https://doi.org/10.1101/2022.09.16.508250
https://doi.org/10.1101/2022.09.16.508250
Publikováno v:
In Theoretical Computer Science 2007 387(3):313-331
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.