default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Deorowicz
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j41]Sebastian Deorowicz
, Adam Gudys:
Efficient protein structure archiving using ProteStAr. Bioinform. 40(7) (2024)- 2023
- [j40]Sebastian Deorowicz, Agnieszka Danek, Heng Li:
AGC: compact representation of assembled genomes with fast queries and updates. Bioinform. 39(3) (2023) - 2022
- [j39]Andrzej Zielezinski, Sebastian Deorowicz, Adam Gudys:
PHIST: fast and accurate prediction of prokaryotic hosts from metagenomic viral sequences. Bioinform. 38(5): 1447-1449 (2022) - [j38]Yoann Dufresne, Téo Lemane, Pierre Marijon, Pierre Peterlongo, Amatur Rahman, Marek Kokot, Paul Medvedev, Sebastian Deorowicz, Rayan Chikhi:
The K-mer File Format: a standardized and compact disk representation of sets of k-mers. Bioinform. 38(18): 4423-4425 (2022) - 2021
- [j37]Sebastian Deorowicz, Agnieszka Danek, Marek Kokot:
VCFShark: how to squeeze a VCF file. Bioinform. 37(19): 3358-3360 (2021) - [j36]Sebastian Deorowicz, Adam Gudys:
Whisper 2: Indel-sensitive short read mapping. SoftwareX 14: 100692 (2021) - 2020
- [e1]Aleksandra Gruca, Tadeusz Czachórski, Sebastian Deorowicz, Katarzyna Harezlak, Agnieszka Piotrowska:
Man-Machine Interactions 6 - 6th International Conference on Man-Machine Interactions, ICMMI 2019, Cracow, Poland, October 2-3, 2019. Advances in Intelligent Systems and Computing 1061, Springer 2020, ISBN 978-3-030-31963-2 [contents]
2010 – 2019
- 2019
- [j35]Sebastian Deorowicz, Adam Gudys, Maciej Dlugosz, Marek Kokot, Agnieszka Danek:
Kmer-db: instant evolutionary distance estimation. Bioinform. 35(1): 133-136 (2019) - [j34]Sebastian Deorowicz, Joanna Walczyszyn, Agnieszka Debudaj-Grabysz:
CoMSA: compression of protein multiple sequence alignment files. Bioinform. 35(2): 227-234 (2019) - [j33]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) - [j32]Sebastian Deorowicz, Agnieszka Danek:
GTShark: genotype compression in large projects. Bioinform. 35(22): 4791-4793 (2019) - 2018
- [j31]Agnieszka Danek, Sebastian Deorowicz:
GTC: how to maintain huge genotype collections in a compressed form. Bioinform. 34(11): 1834-1840 (2018) - [j30]Lukasz Roguski, Idoia Ochoa, Mikel Hernaez, Sebastian Deorowicz:
FaStore: a space-saving solution for raw sequencing data. Bioinform. 34(16): 2748-2756 (2018) - 2017
- [j29]Maciej Dlugosz, Sebastian Deorowicz:
RECKONER: read error corrector based on KMC. Bioinform. 33(7): 1086-1089 (2017) - [j28]Marek Kokot, Maciej Dlugosz, Sebastian Deorowicz:
KMC 3: counting and manipulating k-mer statistics. Bioinform. 33(17): 2759-2761 (2017) - [c14]Szymon Grabowski, Marcin Raniszewski, Sebastian Deorowicz:
FM-index for Dummies. BDAS 2017: 189-201 - [c13]Marek Kokot, Sebastian Deorowicz, Agnieszka Debudaj-Grabysz:
Sorting Data on Ultra-Large Scale with RADULS - New Incarnation of Radix Sort. BDAS 2017: 235-245 - [c12]Maciej Dlugosz, Sebastian Deorowicz, Marek Kokot:
Improvements in DNA Reads Correction. ICMMI 2017: 115-124 - [c11]Marek Kokot, Sebastian Deorowicz, Maciej Dlugosz:
Even Faster Sorting of (Not Only) Integers. ICMMI 2017: 481-491 - [i16]Marek Kokot, Maciej Dlugosz, Sebastian Deorowicz:
KMC 3: counting and manipulating k-mer statistics. CoRR abs/1701.08022 (2017) - [i15]Marek Kokot, Sebastian Deorowicz, Maciej Dlugosz:
Even faster sorting of (not only) integers. CoRR abs/1703.00687 (2017) - [i14]Maciej Dlugosz, Sebastian Deorowicz, Marek Kokot:
Even better correction of genome sequencing data. CoRR abs/1703.00690 (2017) - 2016
- [j27]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) - [i13]Maciej Dlugosz, Sebastian Deorowicz:
RECKONER: Read Error Corrector Based on KMC. CoRR abs/1602.03086 (2016) - [i12]Sebastian Deorowicz, Agnieszka Debudaj-Grabysz, Adam Gudys:
Aligning 415 519 proteins in less than two hours on PC. CoRR abs/1603.06958 (2016) - [i11]Marek Kokot, Sebastian Deorowicz, Agnieszka Debudaj-Grabysz:
Sorting Data on Ultra-Large Scale with RADULS. New Incarnation of Radix Sort. CoRR abs/1612.02557 (2016) - 2015
- [j26]Szymon Grabowski, Sebastian Deorowicz, Lukasz Roguski:
Disk-based compression of data from genome sequencing. Bioinform. 31(9): 1389-1395 (2015) - [j25]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) - [i9]Sebastian Deorowicz, Agnieszka Danek, Marcin Niemiec:
GDC 2: Compression of large collections of genomes. CoRR abs/1503.01624 (2015) - [i8]Szymon Grabowski, Marcin Raniszewski, Sebastian Deorowicz:
FM-index for dummies. CoRR abs/1506.04896 (2015) - [i7]Adam Gudys, Sebastian Deorowicz:
QuickProbs 2: towards rapid construction of high-quality alignments of large protein families. CoRR abs/1512.07437 (2015) - 2014
- [j24]Lukasz Roguski, Sebastian Deorowicz:
DSRC 2 - Industry-oriented compression of FASTQ files. Bioinform. 30(15): 2213-2215 (2014) - [j23]Sebastian Deorowicz, Szymon Grabowski:
Efficient algorithms for the longest common subsequence in k-length substrings. Inf. Process. Lett. 114(11): 634-638 (2014) - [c10]Bozena Wieczorek, Marcin Polomski, Piotr Pecka, Sebastian Deorowicz:
An Effective Way of Storing and Accessing Very Large Transition Matrices Using Multi-core CPU and GPU Architectures. BDAS 2014: 323-334 - [c9]Jolanta Kawulok, Sebastian Deorowicz:
An Improved Algorithm for Fast and Accurate Classification of Sequences. BDAS 2014: 335-344 - [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
- [j22]Sebastian Deorowicz, Szymon Grabowski:
Data compression for sequencing data. Algorithms Mol. Biol. 8: 25 (2013) - [j21]Sebastian Deorowicz, Agnieszka Danek, Szymon Grabowski:
Genome compression: a novel approach for large collections. Bioinform. 29(20): 2572-2578 (2013) - [j20]Sebastian Deorowicz, Agnieszka Debudaj-Grabysz, Szymon Grabowski:
Disk-based k-mer counting on a PC. BMC Bioinform. 14: 160 (2013) - [j19]Sebastian Deorowicz, Agnieszka Danek:
Bit-Parallel Algorithms for the Merged Longest Common Subsequence Problem. Int. J. Found. Comput. Sci. 24(8): 1281-1298 (2013) - [c8]Agnieszka Danek, Sebastian Deorowicz:
Bit-Parallel Algorithm for the Block Variant of the Merged Longest Common Subsequence Problem. ICMMI 2013: 173-181 - [c7]Sebastian Deorowicz, Agnieszka Debudaj-Grabysz, Adam Gudys:
Kalign-LCS - A More Accurate and Faster Variant of Kalign2 Algorithm for the Multiple Sequence Alignment Problem. ICMMI 2013: 495-502 - [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) - 2012
- [j18]Sebastian Deorowicz:
A Cover-Merging-Based Algorithm for the Longest Increasing Subsequence in a Sliding Window Problem. Comput. Informatics 31(6): 1217-1233 (2012) - [j17]Adam Gudys, Sebastian Deorowicz:
A Parallel Algorithm for the Constrained Multiple Sequence Alignment Problem Designed for GPUs. Int. J. Found. Comput. Sci. 23(4): 877-902 (2012) - [j16]Sebastian Deorowicz:
Quadratic-time algorithm for a string constrained LCS problem. Inf. Process. Lett. 112(11): 423-426 (2012) - [j15]Michal Wojciech Szczesniak, Sebastian Deorowicz, Jakub Gapski, Lukasz Kaczynski, Izabela Makalowska:
miRNEST database: an integrative approach in microRNA search and annotation. Nucleic Acids Res. 40(Database-Issue): 198-204 (2012) - 2011
- [j14]Sebastian Deorowicz, Szymon Grabowski:
Compression of DNA sequence reads in FASTQ format. Bioinform. 27(6): 860-862 (2011) - [j13]Sebastian Deorowicz, Szymon Grabowski:
Robust relative compression of genomes with random access. Bioinform. 27(21): 2979-2986 (2011) - [c4]Adam Gudys, Sebastian Deorowicz:
A Parallel GPU-Designed Algorithm for the Constrained Multiple Sequence Alignment Problem. ICMMI 2011: 361-368 - [c3]Piotr Pecka, Sebastian Deorowicz, Mateusz Nowak:
Efficient Representation of Transition Matrix in the Markov Process Modeling of Computer Networks. ICMMI 2011: 457-464 - [i2]Szymon Grabowski, Sebastian Deorowicz:
Engineering Relative Compression of Genomes. CoRR abs/1103.2351 (2011) - [i1]Sebastian Deorowicz:
Quadratic-time Algorithm for the String Constrained LCS Problem. CoRR abs/1106.6342 (2011) - 2010
- [j12]Sebastian Deorowicz, Joanna Obstój:
Constrained Longest Common Subsequence Computing Algorithms in Practice. Comput. Informatics 29(3): 427-445 (2010) - [j11]Sebastian Deorowicz:
Bit-Parallel Algorithm for the Constrained Longest Common Subsequence Problem. Fundam. Informaticae 99(4): 409-433 (2010) - [j10]Sebastian Deorowicz:
Solving longest common subsequence and related problems on graphical processing units. Softw. Pract. Exp. 40(8): 673-700 (2010)
2000 – 2009
- 2009
- [j9]Sebastian Deorowicz, Szymon Grabowski:
A hybrid algorithm for the longest common transposition-invariant subsequence problem. Comput. Informatics 28(5): 729-744 (2009) - [j8]Sebastian Deorowicz:
An algorithm for solving the longest increasing circular subsequence problem. Inf. Process. Lett. 109(12): 630-634 (2009) - [c2]Sebastian Deorowicz, Szymon Grabowski:
On Two Variants of the Longest Increasing Subsequence Problem. ICMMI 2009: 541-549 - [c1]Sebastian Deorowicz:
Computing the Longest Common Transposition-Invariant Subsequence with GPU. ICMMI 2009: 551-559 - 2008
- [j7]Sebastian Deorowicz, Szymon Grabowski:
Efficient Preprocessing for Web Log Compression. Int. J. Comput. 7(1): 35-42 (2008) - 2006
- [j6]Sebastian Deorowicz:
Speeding up transposition-invariant string matching. Inf. Process. Lett. 100(1): 14-20 (2006) - 2005
- [j5]Sebastian Deorowicz:
Context exhumation after the Burrows-Wheeler transform. Inf. Process. Lett. 95(1): 313-320 (2005) - [j4]Przemyslaw Skibinski, Szymon Grabowski, Sebastian Deorowicz:
Revisiting dictionary-based compression. Softw. Pract. Exp. 35(15): 1455-1476 (2005) - 2002
- [j3]Sebastian Deorowicz:
Second step algorithms in the Burrows-Wheeler compression algorithm. Softw. Pract. Exp. 32(2): 99-111 (2002) - 2001
- [j2]Marcin Ciura, Sebastian Deorowicz:
How to squeeze a lexicon. Softw. Pract. Exp. 31(11): 1077-1090 (2001) - 2000
- [j1]Sebastian Deorowicz:
Improvements to Burrows-Wheeler compression algorithm. Softw. Pract. Exp. 30(13): 1465-1483 (2000)
Coauthor Index
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-07-20 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
