Szymon Grabowski

110 papers B 2C 10Misc 9Journal 81Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	FFC: a scalable FASTA compressor. Bioinform. Szymon Grabowski, Tomasz Marek Kowalski, Robert Susik
2025	J	`jnl`	Boosting exact pattern matching with extreme gradient boosting (and more). J. Supercomput. Robert Susik, Szymon Grabowski
2025	J	`jnl`	PgRC2: engineering the compression of sequencing reads. Bioinform. Tomasz Marek Kowalski, Szymon Grabowski
2024	J	`jnl`	Keydrop: Dynamic Keyboard Layout for Faster Typing and Fewer Typos. Int. J. Hum. Comput. Interact. Robert Susik, Szymon Grabowski
2023	J	`jnl`	Space-efficient Huffman codes revisited. Inf. Process. Lett. Szymon Grabowski, Dominik Köppl
2023	J	`jnl`	copMEM2: robust and scalable maximum exact match finding. Bioinform. Szymon Grabowski, Wojciech Bieniecki
2022	J	`jnl`	Efficient and compact representations of some non-canonical prefix-free codes. Theor. Comput. Sci. Antonio Fariña, Travis Gagie, Szymon Grabowski, Giovanni Manzini, Gonzalo Navarro, Alberto Ordóñez Pereira
2021	J	`jnl`	Algorithms for all-pairs Hamming distance based similarity. Softw. Pract. Exp. Szymon Grabowski, Tomasz Marek Kowalski
2021	J	`jnl`	Space-Efficient Huffman Codes Revisited. CoRR Szymon Grabowski, Dominik Köppl
2020	J	`jnl`	PgRC: pseudogenome-based read compressor. Bioinform. Tomasz Marek Kowalski, Szymon Grabowski
2020	J	`jnl`	SOPanG 2: online searching over a pan-genome without false positives. CoRR Aleksander Cislak, Szymon Grabowski
2019	J	`jnl`	Lightweight Fingerprints for Fast Approximate Keyword Matching Using Bitwise Operations. Comput. Informatics Aleksander Cislak, Szymon Grabowski
2019	J	`jnl`	Revisiting Multiple Pattern Matching. Comput. Informatics Robert Susik, Szymon Grabowski, Kimmo Fredriksson
2019	J	`jnl`	Suffix Arrays with a Twist. Comput. Informatics Tomasz Marek Kowalski, Szymon Grabowski, Kimmo Fredriksson
2019	J	`jnl`	Viral Genome Deep Classifier. IEEE Access Anna Fabijanska, Szymon Grabowski
2019	J	`jnl`	Whisper: read sorting allows robust mapping of DNA sequencing data. Bioinform. Sebastian Deorowicz, Agnieszka Debudaj-Grabysz, Adam Gudys, Szymon Grabowski
2019	J	`jnl`	copMEM: finding maximal exact matches via sampling both genomes. Bioinform. Szymon Grabowski, Wojciech Bieniecki
2018	J	`jnl`	Faster range minimum queries. Softw. Pract. Exp. Tomasz Marek Kowalski, Szymon Grabowski
2018	J	`jnl`	On Abelian Longest Common Factor with and without RLE. CoRR Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski
2018	J	`jnl`	On Abelian Longest Common Factor with and without RLE. Fundam. Informaticae Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski
2018	J	`jnl`	Rank and select: Another lesson learned. Inf. Syst. Szymon Grabowski, Marcin Raniszewski
2018	J	`jnl`	SOPanG: online text searching over a pan-genome. Bioinform. Aleksander Cislak, Szymon Grabowski, Jan Holub
2018	J	`jnl`	copMEM: Finding maximal exact matches via sampling both genomes. CoRR Szymon Grabowski, Wojciech Bieniecki
2017	J	`jnl`	A Bloom filter based semi-index on Softw. Pract. Exp. Szymon Grabowski, Robert Susik, Marcin Raniszewski
2017	J	`jnl`	A Practical Index for Approximate Dictionary Matching with Few Mismatches. Comput. Informatics Aleksander Cislak, Szymon Grabowski
2017	—	`conf`	FM-index for Dummies. BDAS Szymon Grabowski, Marcin Raniszewski, Sebastian Deorowicz
2017	Misc	`conf`	Faster Batched Range Minimum Queries. PSC Szymon Grabowski, Tomasz Marek Kowalski
2017	J	`jnl`	Faster batched range minimum queries. CoRR Szymon Grabowski, Tomasz Marek Kowalski
2017	J	`jnl`	Faster range minimum queries. CoRR Tomasz Marek Kowalski, Szymon Grabowski
2017	J	`jnl`	Lightweight Fingerprints for Fast Approximate Keyword Matching Using Bitwise Operations. CoRR Aleksander Cislak, Szymon Grabowski
2017	C	`conf`	Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings. SPIRE Szymon Grabowski
2017	J	`jnl`	Sampled suffix array with minimizers. Softw. Pract. Exp. Szymon Grabowski, Marcin Raniszewski
2016	J	`jnl`	Comment on: 'ERGC: an efficient referential genome compression algorithm'. Bioinform. Sebastian Deorowicz, Szymon Grabowski, Idoia Ochoa, Mikel Hernaez, Tsachy Weissman
2016	C	`conf`	Longest Common Abelian Factors and Large Alphabets. SPIRE Golnaz Badkobeh, Travis Gagie, Szymon Grabowski, Yuto Nakashima, Simon J. Puglisi, Shiho Sugimoto
2016	J	`jnl`	New tabulation and sparse dynamic programming based techniques for sequence similarity problems. Discret. Appl. Math. Szymon Grabowski
2016	J	`jnl`	Rank and select: Another lesson learned. CoRR Szymon Grabowski, Marcin Raniszewski
2016	J	`jnl`	Suffix arrays with a twist. CoRR Tomasz Marek Kowalski, Szymon Grabowski, Kimmo Fredriksson, Marcin Raniszewski
2015	J	`jnl`	A Bloom filter based semi-index on q-grams. CoRR Szymon Grabowski, Robert Susik, Marcin Raniszewski
2015	J	`jnl`	A bloated FM-index reducing the number of cache misses during the search. CoRR Szymon Grabowski, Aleksander Cislak
2015	J	`jnl`	A note on the longest common Abelian factor problem. CoRR Szymon Grabowski
2015	J	`jnl`	A note on the longest common substring with k-mismatches problem. Inf. Process. Lett. Szymon Grabowski
2015	J	`jnl`	A practical index for approximate dictionary matching with few mismatches. CoRR Aleksander Cislak, Szymon Grabowski
2015	J	`jnl`	Disk-based compression of data from genome sequencing. Bioinform. Szymon Grabowski, Sebastian Deorowicz, Lukasz Roguski
2015	J	`jnl`	FM-index for dummies. CoRR Szymon Grabowski, Marcin Raniszewski, Sebastian Deorowicz
2015	J	`jnl`	Indexing arbitrary-length k-mers in sequencing reads. CoRR Tomasz Marek Kowalski, Szymon Grabowski, Sebastian Deorowicz
2015	J	`jnl`	KMC 2: fast and resource-frugal Bioinform. Sebastian Deorowicz, Marek Kokot, Szymon Grabowski, Agnieszka Debudaj-Grabysz
2015	—	`conf`	OFR: An Efficient Representation of RDF Datasets. SLATE Jakub Swacha, Szymon Grabowski
2015	C	`conf`	Sampling the Suffix Array with Minimizers. SPIRE Szymon Grabowski, Marcin Raniszewski
2014	J	`jnl`	A note on the longest common substring with $k$-mismatches problem. CoRR Szymon Grabowski
2014	J	`jnl`	Disk-based genome sequencing data compression. CoRR Szymon Grabowski, Sebastian Deorowicz, Lukasz Roguski
2014	J	`jnl`	Efficient algorithms for the longest common subsequence in k-length substrings. Inf. Process. Lett. Sebastian Deorowicz, Szymon Grabowski
2014	C	`conf`	Experimental evaluation of selected tree structures for exact and approximate k-nearest neighbor classification. FedCSIS Aleksander Cislak, Szymon Grabowski
2014	J	`jnl`	Indexing large genome collections on a PC. CoRR Agnieszka Danek, Sebastian Deorowicz, Szymon Grabowski
2014	J	`jnl`	KMC 2: Fast and resource-frugal k-mer counting. CoRR Sebastian Deorowicz, Marek Kokot, Szymon Grabowski, Agnieszka Debudaj-Grabysz
2014	J	`jnl`	Motif matching using gapped patterns. Theor. Comput. Sci. Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen
2014	Misc	`conf`	Multiple Pattern Matching Revisited. PSC Robert Susik, Szymon Grabowski, Kimmo Fredriksson
2014	J	`jnl`	Multiple pattern matching revisited. CoRR Robert Susik, Szymon Grabowski, Kimmo Fredriksson
2014	Misc	`conf`	New Tabulation and Sparse Dynamic Programming Based Techniques for Sequence Similarity Problems. PSC Szymon Grabowski
2014	J	`jnl`	Sampling the suffix array with minimizers. CoRR Szymon Grabowski, Marcin Raniszewski
2014	J	`jnl`	Tight and simple Web graph compression for forward and reverse neighbor queries. Discret. Appl. Math. Szymon Grabowski, Wojciech Bieniecki
2014	Misc	`conf`	Two Simple Full-Text Indexes Based on the Suffix Array. PSC Szymon Grabowski, Marcin Raniszewski
2014	J	`jnl`	Two simple full-text indexes based on the suffix array. CoRR Szymon Grabowski, Marcin Raniszewski
2013	J	`jnl`	Approximate pattern matching with k-mismatches in packed text. Inf. Process. Lett. Emanuele Giaquinta, Szymon Grabowski, Kimmo Fredriksson
2013	J	`jnl`	Data compression for sequencing data. Algorithms Mol. Biol. Sebastian Deorowicz, Szymon Grabowski
2013	J	`jnl`	Disk-based k-mer counting on a PC. BMC Bioinform. Sebastian Deorowicz, Agnieszka Debudaj-Grabysz, Szymon Grabowski
2013	J	`jnl`	Efficient algorithms for the longest common subsequence in $k$-length substrings. CoRR Sebastian Deorowicz, Szymon Grabowski
2013	J	`jnl`	Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching. Eur. J. Comb. Kimmo Fredriksson, Szymon Grabowski
2013	J	`jnl`	Fast Matching of Transcription Factor Motifs Using Generalized Position Weight Matrix Models. J. Comput. Biol. Emanuele Giaquinta, Szymon Grabowski, Esko Ukkonen
2013	—	`conf`	Fast and Simple Circular Pattern Matching. ICMMI Robert Susik, Szymon Grabowski, Sebastian Deorowicz
2013	J	`jnl`	Genome compression: a novel approach for large collections. Bioinform. Sebastian Deorowicz, Agnieszka Danek, Szymon Grabowski
2013	C	`conf`	Motif Matching Using Gapped Patterns. IWOCA Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Esko Ukkonen
2013	J	`jnl`	Motif matching using gapped patterns. CoRR Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen
2013	J	`jnl`	New algorithms for binary jumbled pattern matching. Inf. Process. Lett. Emanuele Giaquinta, Szymon Grabowski
2013	J	`jnl`	New tabulation and sparse dynamic programming based techniques for sequence similarity problems. CoRR Szymon Grabowski
2013	—	`conf`	Subcubic Algorithms for the Sequence Excluded LCS Problem. ICMMI Sebastian Deorowicz, Szymon Grabowski
2012	J	`jnl`	Approximate pattern matching with k-mismatches in packed text CoRR Emanuele Giaquinta, Szymon Grabowski, Kimmo Fredriksson
2012	J	`jnl`	New algorithms for binary jumbled pattern matching CoRR Emanuele Giaquinta, Szymon Grabowski
2011	J	`jnl`	Compression of DNA sequence reads in FASTQ format. Bioinform. Sebastian Deorowicz, Szymon Grabowski
2011	J	`jnl`	Engineering Relative Compression of Genomes CoRR Szymon Grabowski, Sebastian Deorowicz
2011	—	`conf`	Merging Adjacency Lists for Efficient Web Graph Compression. ICMMI Szymon Grabowski, Wojciech Bieniecki
2011	J	`jnl`	Robust relative compression of genomes with random access. Bioinform. Sebastian Deorowicz, Szymon Grabowski
2011	J	`jnl`	String matching with inversions and translocations in linear average time (most of the time). Inf. Process. Lett. Szymon Grabowski, Simone Faro, Emanuele Giaquinta
2010	J	`jnl`	String Matching with Inversions and Translocations in Linear Average Time (Most of the Time) CoRR Szymon Grabowski, Simone Faro, Emanuele Giaquinta
2010	Misc	`conf`	Tight and Simple Web Graph Compression. PSC Szymon Grabowski, Wojciech Bieniecki
2010	J	`jnl`	Tight and simple Web graph compression CoRR Szymon Grabowski, Wojciech Bieniecki
2009	J	`jnl`	A hybrid algorithm for the longest common transposition-invariant subsequence problem. Comput. Informatics Sebastian Deorowicz, Szymon Grabowski
2009	J	`jnl`	Average-optimal string matching. J. Discrete Algorithms Kimmo Fredriksson, Szymon Grabowski
2009	C	`conf`	Fast Convolutions and Their Applications in Approximate String Matching. IWOCA Kimmo Fredriksson, Szymon Grabowski
2009	C	`conf`	Nested Counters in Bit-Parallel String Matching. LATA Kimmo Fredriksson, Szymon Grabowski
2009	—	`conf`	On Two Variants of the Longest Increasing Subsequence Problem. ICMMI Sebastian Deorowicz, Szymon Grabowski
2009	J	`jnl`	Range mode and range median queries in constant time and sub-quadratic space. Inf. Process. Lett. Holger Petersen, Szymon Grabowski
2008	B	`conf`	A Highly Efficient XML Compression Scheme for the Web. SOFSEM Przemyslaw Skibinski, Jakub Swacha, Szymon Grabowski
2008	J	`jnl`	Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time. Inf. Process. Lett. Szymon Grabowski, Kimmo Fredriksson
2008	J	`jnl`	Effective asymmetric XML compression. Softw. Pract. Exp. Przemyslaw Skibinski, Szymon Grabowski, Jakub Swacha
2008	J	`jnl`	Efficient Algorithms for (delta, gamma, alpha) and (delta, k Int. J. Found. Comput. Sci. Kimmo Fredriksson, Szymon Grabowski
2008	J	`jnl`	Efficient Preprocessing for Web Log Compression. Int. J. Comput. Sebastian Deorowicz, Szymon Grabowski
2008	J	`jnl`	Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance. Inf. Retr. Kimmo Fredriksson, Szymon Grabowski
2008	—	`ch.`	Preprocessing for Real-Time Handwritten Character Recognition. Computer Recognition Systems 2 Bartosz Paszkowski, Wojciech Bieniecki, Szymon Grabowski
2006	J	`jnl`	A Simple Alphabet-independent Fm-index. Int. J. Found. Comput. Sci. Szymon Grabowski, Gonzalo Navarro, Rafal Przywarski, Alejandro Salinger, Veli Mäkinen
2006	J	`jnl`	A general compression algorithm that supports fast searching. Inf. Process. Lett. Kimmo Fredriksson, Szymon Grabowski
2006	C	`conf`	Efficient Algorithms for Pattern Matching with General Gaps and Character Classes. SPIRE Kimmo Fredriksson, Szymon Grabowski
2006	—	`conf`	Efficient Bit-Parallel Algorithms for ( WEA Kimmo Fredriksson, Szymon Grabowski
2006	Misc	`conf`	Efficient algorithms for (delta, gamma, alpha)-matching. PSC Kimmo Fredriksson, Szymon Grabowski
2006	Misc	`conf`	FM-KZ: An even simpler alphabet-independent FM-index. PSC Rafal Przywarski, Szymon Grabowski, Gonzalo Navarro, Alejandro Salinger
2005	Misc	`conf`	A simple alphabet-independent FM-index. PSC Szymon Grabowski, Veli Mäkinen, Gonzalo Navarro, Alejandro Salinger
2005	C	`conf`	Practical and Optimal String Matching. SPIRE Kimmo Fredriksson, Szymon Grabowski
2005	J	`jnl`	Revisiting dictionary-based compression. Softw. Pract. Exp. Przemyslaw Skibinski, Szymon Grabowski, Sebastian Deorowicz
2004	C	`conf`	First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index. SPIRE Szymon Grabowski, Veli Mäkinen, Gonzalo Navarro
2004	Misc	`conf`	Reducing the Computational Demands for Nearest Centroid Neighborhood Classifiers. ICAISC Szymon Grabowski
2004	B	`conf`	Variable-length contexts for PPM. Data Compression Conference Przemyslaw Skibinski, Szymon Grabowski