Zobrazeno 1 - 10
of 912
pro vyhledávání: '"Compressed suffix array"'
Autor:
Dana Shapira, Shmuel T. Klein
Publikováno v:
DCC
We suggest the usage of Fibonacci Codes instead of Elias' C γ code. The implementation requires 1.44 n H k+n+o(n) bits of space, while retaining the searching functionalities. We used a less common variant of the Fibonacci code which was found to be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::decfe248f9088c7c885d13ac1427b8c5
https://doi.org/10.1109/dcc.2018.00068
https://doi.org/10.1109/dcc.2018.00068
Publikováno v:
International Journal of Information and Education Technology. :455-460
Abstract—As one of most popular technologies, audio fingerprinting has recently attracted much attention in music retrieval systems. In music retrieval methods based on audio fingerprints, a large database is required in order to compare the fi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dee10e419f6af1f3a5bc06350d4b49b0
https://doi.org/10.7763/ijiet.2013.v3.317
https://doi.org/10.7763/ijiet.2013.v3.317
Autor:
Xinkun Wang, Hongwei Huo, Jun Huan, Zhigang Sun, Shuangjiang Li, Qiang Yu, Jeffrey Scott Vitter
Publikováno v:
DCC
Next generation sequencing technologies generate normous amount of short reads, which poses a significant computational challenge for short read alignment. Furthermore, because of sequence polymorphisms in a population, repetitive sequences, and sequ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f79b3a0704b6b22337616cf76a510f20
https://doi.org/10.1109/dcc.2016.58
https://doi.org/10.1109/dcc.2016.58
Publikováno v:
Encyclopedia of Algorithms ISBN: 9783642278488
Encyclopedia of Algorithms
Encyclopedia of Algorithms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f997d72638dcb49e851c119a2b9fb9c
https://doi.org/10.1007/978-1-4939-2864-4_82
https://doi.org/10.1007/978-1-4939-2864-4_82
Publikováno v:
2nd Middle East Conference on Biomedical Engineering.
Compressed indices are important data structures in stringology. Compressed versions of many well-known data structures such as suffix tree and suffix array, which are used in string matching problems, have been studied and proposed. This paper takes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7678efde55da2c44bb26fac7e71b792
https://doi.org/10.1109/mecbme.2014.6783270
https://doi.org/10.1109/mecbme.2014.6783270
Publikováno v:
String Processing and Information Retrieval ISBN: 9783319119175
SPIRE
SPIRE
Temporal graphs represent vertexes and binary relations that change over time. In this paper we consider a temporal graph as a set of 4-tuples ( v s , v e , t s , t e ) indicating that an edge from a vertex v s to a vertex v e is active during the ti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4bddd3f3103ff983338096fbf5ee1067
https://doi.org/10.1007/978-3-319-11918-2_8
https://doi.org/10.1007/978-3-319-11918-2_8
Conference
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:
Kunihiko Sadakane
Publikováno v:
Algorithms and Computation ISBN: 9783540412557
ISAAC
ISAAC
A compressed text database based on the compressed suffix array is proposed. The compressed suffix array of Grossi and Vitter occupies only O(n) bits for a text of length n; however it also uses the text itself that occupies O(n log |Σ|) bits for th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9c3618a0dd3f793a68b6b3eb95f5e67
https://doi.org/10.1007/3-540-40996-3_35
https://doi.org/10.1007/3-540-40996-3_35
Conference
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.
Conference
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.