Zobrazeno 1 - 10
of 218
pro vyhledávání: '"Szymon Grabowski"'
Autor:
Anna Fabijanska, Szymon Grabowski
Publikováno v:
IEEE Access, Vol 7, Pp 81297-81307 (2019)
The task of virus classification into subtypes is an important concern in many categorization studies, e.g., in virology or epidemiology. Therefore, the problem of virus subtyping has been a subject of considerable interest in the last decade. Althou
Externí odkaz:
https://doaj.org/article/03ecf87ca7c54a4a986ae3e9ae6851b7
Autor:
Patrycja Koszałka, Grzegorz Stasiłojć, Natalia Miękus-Purwin, Maciej Niedźwiecki, Maciej Purwin, Szymon Grabowski, Tomasz Bączek
Publikováno v:
International Journal of Molecular Sciences, Vol 23, Iss 9, p 4753 (2022)
Acute lymphoblastic leukemia (ALL) is the most common hematological malignancy affecting pediatric patients. ALL treatment regimens with cytostatics manifest substantial toxicity and have reached the maximum of well-tolerated doses. One potential app
Externí odkaz:
https://doaj.org/article/725c05004e034be6a847bc5609598b4e
Autor:
Szymon Grabowski, Wojciech Bieniecki
Publikováno v:
Bioinformatics. 39
Summary Finding Maximum Exact Matches, i.e. matches between two strings that cannot be further extended to the left or right, is a classic string problem with applications in genome-to-genome comparisons. The existing tools rarely explicitly address
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1274ff2567f76ee77fb97c7a9715672
https://doi.org/10.1093/bioinformatics/btad313
https://doi.org/10.1093/bioinformatics/btad313
Publikováno v:
Software: Practice and Experience. 51:1580-1590
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::360011f8485aae2442b734a2dd18c9bd
https://doi.org/10.1002/spe.2978
https://doi.org/10.1002/spe.2978
Publikováno v:
GigaScience. 11
Background Genomes within the same species reveal large similarity, exploited by specialized multiple genome compressors. The existing algorithms and tools are however targeted at large, e.g., mammalian, genomes, and their performance on bacteria str
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c314bece252b60a6cc720af53287f047
https://doi.org/10.1093/gigascience/giab099
https://doi.org/10.1093/gigascience/giab099
Publikováno v:
Bioinformatics. 36:2082-2089
Motivation The amount of sequencing data from high-throughput sequencing technologies grows at a pace exceeding the one predicted by Moore’s law. One of the basic requirements is to efficiently store and transmit such huge collections of data. Desp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::158f9946843a857ce73545681044cbc7
https://doi.org/10.1093/bioinformatics/btz919
https://doi.org/10.1093/bioinformatics/btz919
Publikováno v:
PLoS ONE, Vol 10, Iss 7, p e0133198 (2015)
We propose a lightweight data structure for indexing and querying collections of NGS reads data in main memory. The data structure supports the interface proposed in the pioneering work by Philippe et al. for counting and locating k-mers in sequencin
Externí odkaz:
https://doaj.org/article/83354a9789d04f799fadce52bc5037c0
Publikováno v:
PLoS ONE, Vol 10, Iss 5, p e0128172 (2015)
Externí odkaz:
https://doaj.org/article/df521533cc3046f4bc863115e47060d4
Autor:
Szymon Grabowski, Dominik Köppl
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4e5d5614c8c03e7aa79ac201aa38cee
http://arxiv.org/abs/2108.05495
http://arxiv.org/abs/2108.05495
Publikováno v:
COMPUTING AND INFORMATICS; Vol. 38 No. 3 (2019): Computing and Informatics; 555-574
The suffix array is a classic full-text index, combining effectiveness with simplicity. We discuss three approaches aiming to improve its efficiency even more: changes to the navigation, data layout and adding extra data. In short, we show that i) th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dfbce3d7696267779cd70d1c1a14e6f8
https://doi.org/10.31577/cai_2019_3_555
https://doi.org/10.31577/cai_2019_3_555