Остановите войну!
for scientists:
default search action
Sebastian Deorowicz
- > Home > Persons > Sebastian Deorowicz
Publications
- 2019
- [j32]Sebastian Deorowicz, Agnieszka Debudaj-Grabysz, Adam Gudys, Szymon Grabowski:
Whisper: read sorting allows robust mapping of DNA sequencing data. Bioinform. 35(12): 2043-2050 (2019) - 2017
- [c14]Szymon Grabowski, Marcin Raniszewski, Sebastian Deorowicz:
FM-index for Dummies. BDAS 2017: 189-201 - 2016
- [j26]Sebastian Deorowicz, Szymon Grabowski, Idoia Ochoa, Mikel Hernaez, Tsachy Weissman:
Comment on: 'ERGC: an efficient referential genome compression algorithm'. Bioinform. 32(7): 1115-1117 (2016) - 2015
- [j25]Szymon Grabowski, Sebastian Deorowicz, Lukasz Roguski:
Disk-based compression of data from genome sequencing. Bioinform. 31(9): 1389-1395 (2015) - [j24]Sebastian Deorowicz, Marek Kokot, Szymon Grabowski, Agnieszka Debudaj-Grabysz:
KMC 2: fast and resource-frugal k-mer counting. Bioinform. 31(10): 1569-1576 (2015) - [i10]Tomasz Marek Kowalski, Szymon Grabowski, Sebastian Deorowicz:
Indexing arbitrary-length k-mers in sequencing reads. CoRR abs/1502.01861 (2015) - [i8]Szymon Grabowski, Marcin Raniszewski, Sebastian Deorowicz:
FM-index for dummies. CoRR abs/1506.04896 (2015) - 2014
- [j22]Sebastian Deorowicz, Szymon Grabowski:
Efficient algorithms for the longest common subsequence in k-length substrings. Inf. Process. Lett. 114(11): 634-638 (2014) - [i6]Agnieszka Danek, Sebastian Deorowicz, Szymon Grabowski:
Indexing large genome collections on a PC. CoRR abs/1403.7481 (2014) - [i5]Szymon Grabowski, Sebastian Deorowicz, Lukasz Roguski:
Disk-based genome sequencing data compression. CoRR abs/1405.6874 (2014) - [i4]Sebastian Deorowicz, Marek Kokot, Szymon Grabowski, Agnieszka Debudaj-Grabysz:
KMC 2: Fast and resource-frugal k-mer counting. CoRR abs/1407.1507 (2014) - 2013
- [j21]Sebastian Deorowicz, Szymon Grabowski:
Data compression for sequencing data. Algorithms Mol. Biol. 8: 25 (2013) - [j20]Sebastian Deorowicz, Agnieszka Danek, Szymon Grabowski:
Genome compression: a novel approach for large collections. Bioinform. 29(20): 2572-2578 (2013) - [j19]Sebastian Deorowicz, Agnieszka Debudaj-Grabysz, Szymon Grabowski:
Disk-based k-mer counting on a PC. BMC Bioinform. 14: 160 (2013) - [c6]Sebastian Deorowicz, Szymon Grabowski:
Subcubic Algorithms for the Sequence Excluded LCS Problem. ICMMI 2013: 503-510 - [c5]Robert Susik, Szymon Grabowski, Sebastian Deorowicz:
Fast and Simple Circular Pattern Matching. ICMMI 2013: 537-544 - [i3]Sebastian Deorowicz, Szymon Grabowski:
Efficient algorithms for the longest common subsequence in $k$-length substrings. CoRR abs/1311.4552 (2013) - 2011
- [j13]Sebastian Deorowicz, Szymon Grabowski:
Compression of DNA sequence reads in FASTQ format. Bioinform. 27(6): 860-862 (2011) - [j12]Sebastian Deorowicz, Szymon Grabowski:
Robust relative compression of genomes with random access. Bioinform. 27(21): 2979-2986 (2011) - [i2]Szymon Grabowski, Sebastian Deorowicz:
Engineering Relative Compression of Genomes. CoRR abs/1103.2351 (2011) - 2009
- [j8]Sebastian Deorowicz, Szymon Grabowski:
A hybrid algorithm for the longest common transposition-invariant subsequence problem. Comput. Informatics 28(5): 729-744 (2009) - [c2]Sebastian Deorowicz, Szymon Grabowski:
On Two Variants of the Longest Increasing Subsequence Problem. ICMMI 2009: 541-549 - 2005
- [j4]Przemyslaw Skibinski, Szymon Grabowski, Sebastian Deorowicz:
Revisiting dictionary-based compression. Softw. Pract. Exp. 35(15): 1455-1476 (2005)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint