Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Dmitry Kosolobov"'
Publikováno v:
Algorithms for Molecular Biology, Vol 14, Iss 1, Pp 1-15 (2019)
Abstract Background We study a preprocessing routine relevant in pan-genomic analyses: consider a set of aligned haplotype sequences of complete human chromosomes. Due to the enormous size of such data, one would like to represent this input set with
Externí odkaz:
https://doaj.org/article/f184131ea832445884b76629a936afa6
Autor:
Dmitry Kosolobov, Daniel Valenzuela
Publikováno v:
Algorithms, Vol 14, Iss 12, p 359 (2021)
The Lempel-Ziv parsing (LZ77) is a widely popular construction lying at the heart of many compression algorithms. These algorithms usually treat the data as a sequence of bytes, i.e., blocks of fixed length 8. Another common option is to view the dat
Externí odkaz:
https://doaj.org/article/281b95b91a7e48c3853687e0f446fc67
Publikováno v:
CPM 2021-32nd Annual Symposium on Combinatorial Pattern Matching
CPM 2021-32nd Annual Symposium on Combinatorial Pattern Matching, Jul 2021, Wroclaw, Poland. pp.1-13
Badkobeh, G, Charalampopoulos, P, Kosolobov, D & Pissis, S P 2022, ' Internal shortest absent word queries in constant time and linear space ', Theoretical Computer Science, vol. 922, pp. 271-282 . https://doi.org/10.1016/j.tcs.2022.04.029
32nd Annual Symposium on Combinatorial Pattern Matching (CPM)
32nd Annual Symposium on Combinatorial Pattern Matching (CPM), 2021, Wroclaw, Poland
Theoretical Computer Science
Theoretical Computer Science, 922, 271-282. Elsevier
NARCIS
arXiv.org e-Print Archive
Hal-Diderot
Mémoires en Sciences de l'Information et de la Communication
Institutional repository of Ural Federal University named after the first President of Russia B.N.Yeltsin
Vrije Universiteit Amsterdam (VU Amsterdam)-Institutional Repository
INRIA a CCSD electronic archive server
Datacite
ORCID
Theoretical Computer Science, 922, 271-282
CPM 2021-32nd Annual Symposium on Combinatorial Pattern Matching, Jul 2021, Wroclaw, Poland. pp.1-13
Badkobeh, G, Charalampopoulos, P, Kosolobov, D & Pissis, S P 2022, ' Internal shortest absent word queries in constant time and linear space ', Theoretical Computer Science, vol. 922, pp. 271-282 . https://doi.org/10.1016/j.tcs.2022.04.029
32nd Annual Symposium on Combinatorial Pattern Matching (CPM)
32nd Annual Symposium on Combinatorial Pattern Matching (CPM), 2021, Wroclaw, Poland
Theoretical Computer Science
Theoretical Computer Science, 922, 271-282. Elsevier
NARCIS
arXiv.org e-Print Archive
Hal-Diderot
Mémoires en Sciences de l'Information et de la Communication
Institutional repository of Ural Federal University named after the first President of Russia B.N.Yeltsin
Vrije Universiteit Amsterdam (VU Amsterdam)-Institutional Repository
INRIA a CCSD electronic archive server
Datacite
ORCID
Theoretical Computer Science, 922, 271-282
Comment: 13 pages, 1 figure, 4 tables
Given a string $T$ of length $n$ over an alphabet $\Sigma\subset \{1,2,\ldots,n^{O(1)}\}$ of size $\sigma$, we are to preprocess $T$ so that given a range $[i,j]$, we can return a representation of a shortes
Given a string $T$ of length $n$ over an alphabet $\Sigma\subset \{1,2,\ldots,n^{O(1)}\}$ of size $\sigma$, we are to preprocess $T$ so that given a range $[i,j]$, we can return a representation of a shortes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::904f48fbc81b6de749398a96836f8886
https://inria.hal.science/hal-03498358/file/2106.01763.pdf
https://inria.hal.science/hal-03498358/file/2106.01763.pdf
Autor:
Dmitry Kosolobov, Arseny M. Shur
Publikováno v:
Inf. Process. Lett.
Information Processing Letters
Information Processing Letters
We investigate the relations between different variants of the LZ77 parsing existing in the literature. All of them are defined as greedily constructed parsings encoding each phrase by reference to a string occurring earlier in the input. They differ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de5df621e9727ed3f5dc257808b0e0c5
https://doi.org/10.1016/j.ipl.2018.09.005
https://doi.org/10.1016/j.ipl.2018.09.005
Publikováno v:
LATIN 2020: Theoretical Informatics ISBN: 9783030617912
LATIN
LATIN
We study an ordered variant of the well-known strip packing problem, which is motivated by applications in visualization and typography. Our input consists of a maximum width W and an ordered list of n blocks (rectangles). The goal is to pack the blo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94001f750ded6daa52b5490e0d79ff0d
https://doi.org/10.1007/978-3-030-61792-9_21
https://doi.org/10.1007/978-3-030-61792-9_21
Autor:
Dmitry Kosolobov, Oleg Merkurev
Publikováno v:
Computer Science – Theory and Applications ISBN: 9783030500252
CSR
Lect. Notes Comput. Sci.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
CSR
Lect. Notes Comput. Sci.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A skeleton Huffman tree is a Huffman tree in which all disjoint maximal perfect subtrees are shrunk into leaves. Skeleton Huffman trees, besides saving storage space, are also used for faster decoding and for speeding up Huffman-shaped wavelet trees.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::171953e22c0c570b6f5f7c846505e70d
Publikováno v:
Proceedings of the Ecological-Socio-Economic Systems: Models of Competition and Cooperation (ESES 2019).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9506fc20bed15e0aa1dceb512c722199
https://doi.org/10.2991/assehr.k.200113.092
https://doi.org/10.2991/assehr.k.200113.092
Publikováno v:
Algorithms for Molecular Biology, Vol 14, Iss 1, Pp 1-15 (2019)
Algorithms for Molecular Biology : AMB
Algorithms for Molecular Biology
Algorithms for Molecular Biology : AMB
Algorithms for Molecular Biology
Background We study a preprocessing routine relevant in pan-genomic analyses: consider a set of aligned haplotype sequences of complete human chromosomes. Due to the enormous size of such data, one would like to represent this input set with a few fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba02374302bb476773a8a76df387ddd0
https://doi.org/10.1186/s13015-019-0147-6
https://doi.org/10.1186/s13015-019-0147-6
Publikováno v:
Algorithmica
Lempel-Ziv (LZ77 or, briefly, LZ) is one of the most effective and widely-used compressors for repetitive texts. However, the existing efficient methods computing the exact LZ parsing have to use linear or close to linear space to index the input tex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b5ec51d84ad012db72232f1151f6544
http://arxiv.org/abs/1903.01909
http://arxiv.org/abs/1903.01909
Publikováno v:
Lect. Notes Comput. Sci.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
String Processing and Information Retrieval ISBN: 9783030326852
SPIRE
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
String Processing and Information Retrieval ISBN: 9783030326852
SPIRE
We study a lossy compression scheme linked to the biological problem of founder reconstruction: The goal in founder reconstruction is to replace a set of strings with a smaller set of founders such that the original connections are maintained as well
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::163a803d2a668262a5216db5cff80e47
https://helda.helsinki.fi/bitstream/10138/322257/1/fragment_spire_final.pdf
https://helda.helsinki.fi/bitstream/10138/322257/1/fragment_spire_final.pdf