Zobrazeno 1 - 10
of 227
pro vyhledávání: '"Grabowski, Szymon"'
Autor:
Grabowski, Szymon, Köppl, Dominik
Canonical Huffman code is an optimal prefix-free compression code whose codewords enumerated in the lexicographical order form a list of binary words in non-decreasing lengths. Gagie et al. (2015) gave a representation of this coding capable to encod
Externí odkaz:
http://arxiv.org/abs/2108.05495
Autor:
Cisłak, Aleksander, Grabowski, Szymon
Motivation: The pan-genome can be stored as elastic-degenerate (ED) string, a recently introduced compact representation of multiple overlapping sequences. However, a search over the ED string does not indicate which individuals (if any) match the en
Externí odkaz:
http://arxiv.org/abs/2004.03033
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:
Grabowski, Szymon, Bieniecki, Wojciech
Genome-to-genome comparisons require designating anchor points, which are given by Maximum Exact Matches (MEMs) between their sequences. For large genomes this is a challenging problem and the performance of existing solutions, even in parallel regim
Externí odkaz:
http://arxiv.org/abs/1805.08816
We consider the Abelian longest common factor problem in two scenarios: when input strings are uncompressed and are of size $n$, and when the input strings are run-length encoded and their compressed representations have size at most $m$. The alphabe
Externí odkaz:
http://arxiv.org/abs/1804.06809
Autor:
Kowalski, Tomasz, Grabowski, Szymon
Range Minimum Query (RMQ) is an important building brick of many compressed data structures and string matching algorithms. Although this problem is essentially solved in theory, with sophisticated data structures allowing for constant time queries,
Externí odkaz:
http://arxiv.org/abs/1711.10385
Autor:
Cisłak, Aleksander, Grabowski, Szymon
We aim to speed up approximate keyword matching by storing a lightweight, fixed-size block of data for each string, called a fingerprint. These work in a similar way to hash values; however, they can be also used for matching with errors. They store
Externí odkaz:
http://arxiv.org/abs/1711.08475
Autor:
Grabowski, Szymon, Kowalski, Tomasz
Range Minimum Query (RMQ) is an important building brick of many compressed data structures and string matching algorithms. Although this problem is essentially solved in theory, with sophisticated data structures allowing for constant time queries,
Externí odkaz:
http://arxiv.org/abs/1706.06940
Autor:
Fariña, Antonio, Gagie, Travis, Grabowski, Szymon, Manzini, Giovanni, Navarro, Gonzalo, Ordóñez, Alberto
Publikováno v:
In Theoretical Computer Science 12 March 2022 907:11-25
Autor:
Susik, Robert1 (AUTHOR) rsusik@kis.p.lodz.pl, Grabowski, Szymon1 (AUTHOR)
Publikováno v:
International Journal of Human-Computer Interaction. Sep2024, Vol. 40 Issue 17, p4576-4584. 9p.