default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSzymon Grabowski
Person information
- affiliation: Lodz University of Technology, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j48]Robert Susik
, Szymon Grabowski:
Keydrop: Dynamic Keyboard Layout for Faster Typing and Fewer Typos. Int. J. Hum. Comput. Interact. 40(17): 4576-4584 (2024)- 2023
- [j47]Szymon Grabowski, Wojciech Bieniecki:
copMEM2: robust and scalable maximum exact match finding. Bioinform. 39(5) (2023) - [j46]Szymon Grabowski, Dominik Köppl:
Space-efficient Huffman codes revisited. Inf. Process. Lett. 179: 106274 (2023) - 2022
- [j45]Antonio Fariña, Travis Gagie, Szymon Grabowski, Giovanni Manzini, Gonzalo Navarro, Alberto Ordóñez Pereira:
Efficient and compact representations of some non-canonical prefix-free codes. Theor. Comput. Sci. 907: 11-25 (2022) - 2021
- [j44]Szymon Grabowski, Tomasz Marek Kowalski:
Algorithms for all-pairs Hamming distance based similarity. Softw. Pract. Exp. 51(7): 1580-1590 (2021) - 2020
- [j43]Tomasz Marek Kowalski, Szymon Grabowski:
PgRC: pseudogenome-based read compressor. Bioinform. 36(7): 2082-2089 (2020) - 2019
- [j42]Anna Fabijanska, Szymon Grabowski:
Viral Genome Deep Classifier. IEEE Access 7: 81297-81307 (2019) - [j41]Szymon Grabowski, Wojciech Bieniecki:
copMEM: finding maximal exact matches via sampling both genomes. Bioinform. 35(4): 677-678 (2019) - [j40]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) - [j39]Aleksander Cislak, Szymon Grabowski:
Lightweight Fingerprints for Fast Approximate Keyword Matching Using Bitwise Operations. Comput. Informatics 38(2): 367-389 (2019) - [j38]Tomasz Marek Kowalski, Szymon Grabowski, Kimmo Fredriksson:
Suffix Arrays with a Twist. Comput. Informatics 38(3): 555-574 (2019) - [j37]Robert Susik, Szymon Grabowski, Kimmo Fredriksson:
Revisiting Multiple Pattern Matching. Comput. Informatics 38(4): 937-962 (2019) - 2018
- [j36]Aleksander Cislak, Szymon Grabowski, Jan Holub:
SOPanG: online text searching over a pan-genome. Bioinform. 34(24): 4290-4292 (2018) - [j35]Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski:
On Abelian Longest Common Factor with and without RLE. Fundam. Informaticae 163(3): 225-244 (2018) - [j34]Szymon Grabowski, Marcin Raniszewski:
Rank and select: Another lesson learned. Inf. Syst. 73: 25-34 (2018) - [j33]Tomasz Marek Kowalski, Szymon Grabowski:
Faster range minimum queries. Softw. Pract. Exp. 48(11): 2043-2060 (2018) - 2017
- [j32]Aleksander Cislak, Szymon Grabowski:
A Practical Index for Approximate Dictionary Matching with Few Mismatches. Comput. Informatics 36(5): 1088-1106 (2017) - [j31]Szymon Grabowski, Robert Susik, Marcin Raniszewski:
A Bloom filter based semi-index on q-grams. Softw. Pract. Exp. 47(6): 799-811 (2017) - [j30]Szymon Grabowski, Marcin Raniszewski:
Sampled suffix array with minimizers. Softw. Pract. Exp. 47(11): 1755-1771 (2017) - 2016
- [j29]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) - [j28]Szymon Grabowski:
New tabulation and sparse dynamic programming based techniques for sequence similarity problems. Discret. Appl. Math. 212: 96-103 (2016) - 2015
- [j27]Szymon Grabowski, Sebastian Deorowicz, Lukasz Roguski:
Disk-based compression of data from genome sequencing. Bioinform. 31(9): 1389-1395 (2015) - [j26]Sebastian Deorowicz, Marek Kokot, Szymon Grabowski, Agnieszka Debudaj-Grabysz:
KMC 2: fast and resource-frugal k-mer counting. Bioinform. 31(10): 1569-1576 (2015) - [j25]Szymon Grabowski:
A note on the longest common substring with k-mismatches problem. Inf. Process. Lett. 115(6-8): 640-642 (2015) - 2014
- [j24]Szymon Grabowski, Wojciech Bieniecki:
Tight and simple Web graph compression for forward and reverse neighbor queries. Discret. Appl. Math. 163: 298-306 (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) - [j22]Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen:
Motif matching using gapped patterns. Theor. Comput. Sci. 548: 1-13 (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) - [j18]Kimmo Fredriksson, Szymon Grabowski:
Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching. Eur. J. Comb. 34(1): 38-51 (2013) - [j17]Emanuele Giaquinta, Szymon Grabowski:
New algorithms for binary jumbled pattern matching. Inf. Process. Lett. 113(14-16): 538-542 (2013) - [j16]Emanuele Giaquinta, Szymon Grabowski, Kimmo Fredriksson:
Approximate pattern matching with k-mismatches in packed text. Inf. Process. Lett. 113(19-21): 693-697 (2013) - [j15]Emanuele Giaquinta, Szymon Grabowski, Esko Ukkonen:
Fast Matching of Transcription Factor Motifs Using Generalized Position Weight Matrix Models. J. Comput. Biol. 20(9): 621-630 (2013) - 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) - [j12]Szymon Grabowski, Simone Faro, Emanuele Giaquinta:
String matching with inversions and translocations in linear average time (most of the time). Inf. Process. Lett. 111(11): 516-520 (2011) - 2009
- [j11]Sebastian Deorowicz, Szymon Grabowski:
A hybrid algorithm for the longest common transposition-invariant subsequence problem. Comput. Informatics 28(5): 729-744 (2009) - [j10]Holger Petersen, Szymon Grabowski:
Range mode and range median queries in constant time and sub-quadratic space. Inf. Process. Lett. 109(4): 225-228 (2009) - [j9]Kimmo Fredriksson, Szymon Grabowski:
Average-optimal string matching. J. Discrete Algorithms 7(4): 579-594 (2009) - 2008
- [j8]Sebastian Deorowicz, Szymon Grabowski:
Efficient Preprocessing for Web Log Compression. Int. J. Comput. 7(1): 35-42 (2008) - [j7]Kimmo Fredriksson, Szymon Grabowski:
Efficient Algorithms for (delta, gamma, alpha) and (delta, kDelta, alpha)-Matching. Int. J. Found. Comput. Sci. 19(1): 163-183 (2008) - [j6]Szymon Grabowski, Kimmo Fredriksson:
Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time. Inf. Process. Lett. 105(5): 182-187 (2008) - [j5]Kimmo Fredriksson, Szymon Grabowski:
Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance. Inf. Retr. 11(4): 335-357 (2008) - [j4]Przemyslaw Skibinski, Szymon Grabowski, Jakub Swacha:
Effective asymmetric XML compression. Softw. Pract. Exp. 38(10): 1027-1047 (2008) - 2006
- [j3]Szymon Grabowski, Gonzalo Navarro, Rafal Przywarski, Alejandro Salinger, Veli Mäkinen:
A Simple Alphabet-independent Fm-index. Int. J. Found. Comput. Sci. 17(6): 1365-1384 (2006) - [j2]Kimmo Fredriksson, Szymon Grabowski:
A general compression algorithm that supports fast searching. Inf. Process. Lett. 100(6): 226-232 (2006) - 2005
- [j1]Przemyslaw Skibinski, Szymon Grabowski, Sebastian Deorowicz:
Revisiting dictionary-based compression. Softw. Pract. Exp. 35(15): 1455-1476 (2005)
Conference and Workshop Papers
- 2017
- [c28]Szymon Grabowski, Marcin Raniszewski, Sebastian Deorowicz:
FM-index for Dummies. BDAS 2017: 189-201 - [c27]Szymon Grabowski:
Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings. SPIRE 2017: 208-213 - [c26]Szymon Grabowski, Tomasz Marek Kowalski:
Faster Batched Range Minimum Queries. Stringology 2017: 85-95 - 2016
- [c25]Golnaz Badkobeh, Travis Gagie, Szymon Grabowski, Yuto Nakashima, Simon J. Puglisi, Shiho Sugimoto:
Longest Common Abelian Factors and Large Alphabets. SPIRE 2016: 254-259 - 2015
- [c24]Jakub Swacha, Szymon Grabowski:
OFR: An Efficient Representation of RDF Datasets. SLATE 2015: 224-235 - [c23]Szymon Grabowski, Marcin Raniszewski:
Sampling the Suffix Array with Minimizers. SPIRE 2015: 287-298 - 2014
- [c22]Aleksander Cislak, Szymon Grabowski:
Experimental evaluation of selected tree structures for exact and approximate k-nearest neighbor classification. FedCSIS 2014: 93-100 - [c21]Robert Susik, Szymon Grabowski, Kimmo Fredriksson:
Multiple Pattern Matching Revisited. Stringology 2014: 59-70 - [c20]Szymon Grabowski, Marcin Raniszewski:
Two Simple Full-Text Indexes Based on the Suffix Array. Stringology 2014: 179-191 - [c19]Szymon Grabowski:
New Tabulation and Sparse Dynamic Programming Based Techniques for Sequence Similarity Problems. Stringology 2014: 202-211 - 2013
- [c18]Sebastian Deorowicz, Szymon Grabowski:
Subcubic Algorithms for the Sequence Excluded LCS Problem. ICMMI 2013: 503-510 - [c17]Robert Susik, Szymon Grabowski, Sebastian Deorowicz:
Fast and Simple Circular Pattern Matching. ICMMI 2013: 537-544 - [c16]Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Esko Ukkonen:
Motif Matching Using Gapped Patterns. IWOCA 2013: 448-452 - 2011
- [c15]Szymon Grabowski, Wojciech Bieniecki:
Merging Adjacency Lists for Efficient Web Graph Compression. ICMMI 2011: 385-392 - 2010
- [c14]Szymon Grabowski, Wojciech Bieniecki:
Tight and Simple Web Graph Compression. Stringology 2010: 127-137 - 2009
- [c13]Sebastian Deorowicz, Szymon Grabowski:
On Two Variants of the Longest Increasing Subsequence Problem. ICMMI 2009: 541-549 - [c12]Kimmo Fredriksson, Szymon Grabowski:
Fast Convolutions and Their Applications in Approximate String Matching. IWOCA 2009: 254-265 - [c11]Kimmo Fredriksson, Szymon Grabowski:
Nested Counters in Bit-Parallel String Matching. LATA 2009: 338-349 - 2008
- [c10]Przemyslaw Skibinski, Jakub Swacha, Szymon Grabowski:
A Highly Efficient XML Compression Scheme for the Web. SOFSEM 2008: 766-777 - 2006
- [c9]Kimmo Fredriksson, Szymon Grabowski:
Efficient Algorithms for Pattern Matching with General Gaps and Character Classes. SPIRE 2006: 267-278 - [c8]Kimmo Fredriksson, Szymon Grabowski:
Efficient algorithms for (delta, gamma, alpha)-matching. Stringology 2006: 29-40 - [c7]Rafal Przywarski, Szymon Grabowski, Gonzalo Navarro, Alejandro Salinger:
FM-KZ: An even simpler alphabet-independent FM-index. Stringology 2006: 226-241 - [c6]Kimmo Fredriksson, Szymon Grabowski:
Efficient Bit-Parallel Algorithms for (delta, alpha)-Matching. WEA 2006: 170-181 - 2005
- [c5]Kimmo Fredriksson, Szymon Grabowski:
Practical and Optimal String Matching. SPIRE 2005: 376-387 - [c4]Szymon Grabowski, Veli Mäkinen, Gonzalo Navarro, Alejandro Salinger:
A simple alphabet-independent FM-index. Stringology 2005: 231-245 - 2004
- [c3]Przemyslaw Skibinski, Szymon Grabowski:
Variable-length contexts for PPM. Data Compression Conference 2004: 409-418 - [c2]Szymon Grabowski:
Reducing the Computational Demands for Nearest Centroid Neighborhood Classifiers. ICAISC 2004: 568-573 - [c1]Szymon Grabowski, Veli Mäkinen, Gonzalo Navarro:
First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index. SPIRE 2004: 210-211
Parts in Books or Collections
- 2008
- [p1]Bartosz Paszkowski, Wojciech Bieniecki, Szymon Grabowski:
Preprocessing for Real-Time Handwritten Character Recognition. Computer Recognition Systems 2 2008: 470-476
Informal and Other Publications
- 2021
- [i30]Szymon Grabowski, Dominik Köppl:
Space-Efficient Huffman Codes Revisited. CoRR abs/2108.05495 (2021) - 2020
- [i29]Aleksander Cislak, Szymon Grabowski:
SOPanG 2: online searching over a pan-genome without false positives. CoRR abs/2004.03033 (2020) - 2018
- [i28]Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski:
On Abelian Longest Common Factor with and without RLE. CoRR abs/1804.06809 (2018) - [i27]Szymon Grabowski, Wojciech Bieniecki:
copMEM: Finding maximal exact matches via sampling both genomes. CoRR abs/1805.08816 (2018) - 2017
- [i26]Szymon Grabowski, Tomasz Marek Kowalski:
Faster batched range minimum queries. CoRR abs/1706.06940 (2017) - [i25]Aleksander Cislak, Szymon Grabowski:
Lightweight Fingerprints for Fast Approximate Keyword Matching Using Bitwise Operations. CoRR abs/1711.08475 (2017) - [i24]Tomasz Marek Kowalski, Szymon Grabowski:
Faster range minimum queries. CoRR abs/1711.10385 (2017) - 2016
- [i23]Szymon Grabowski, Marcin Raniszewski:
Rank and select: Another lesson learned. CoRR abs/1605.01539 (2016) - [i22]Tomasz Marek Kowalski, Szymon Grabowski, Kimmo Fredriksson, Marcin Raniszewski:
Suffix arrays with a twist. CoRR abs/1607.08176 (2016) - 2015
- [i21]Aleksander Cislak, Szymon Grabowski:
A practical index for approximate dictionary matching with few mismatches. CoRR abs/1501.04948 (2015) - [i20]Tomasz Marek Kowalski, Szymon Grabowski, Sebastian Deorowicz:
Indexing arbitrary-length k-mers in sequencing reads. CoRR abs/1502.01861 (2015) - [i19]Szymon Grabowski:
A note on the longest common Abelian factor problem. CoRR abs/1503.01093 (2015) - [i18]Szymon Grabowski, Marcin Raniszewski, Sebastian Deorowicz:
FM-index for dummies. CoRR abs/1506.04896 (2015) - [i17]Szymon Grabowski, Robert Susik, Marcin Raniszewski:
A Bloom filter based semi-index on q-grams. CoRR abs/1507.02989 (2015) - [i16]Szymon Grabowski, Aleksander Cislak:
A bloated FM-index reducing the number of cache misses during the search. CoRR abs/1512.01996 (2015) - 2014
- [i15]Agnieszka Danek, Sebastian Deorowicz, Szymon Grabowski:
Indexing large genome collections on a PC. CoRR abs/1403.7481 (2014) - [i14]Robert Susik, Szymon Grabowski, Kimmo Fredriksson:
Multiple pattern matching revisited. CoRR abs/1405.5483 (2014) - [i13]Szymon Grabowski, Marcin Raniszewski:
Two simple full-text indexes based on the suffix array. CoRR abs/1405.5919 (2014) - [i12]Szymon Grabowski, Sebastian Deorowicz, Lukasz Roguski:
Disk-based genome sequencing data compression. CoRR abs/1405.6874 (2014) - [i11]Szymon Grabowski, Marcin Raniszewski:
Sampling the suffix array with minimizers. CoRR abs/1406.2348 (2014) - [i10]Sebastian Deorowicz, Marek Kokot, Szymon Grabowski, Agnieszka Debudaj-Grabysz:
KMC 2: Fast and resource-frugal k-mer counting. CoRR abs/1407.1507 (2014) - [i9]Szymon Grabowski:
A note on the longest common substring with $k$-mismatches problem. CoRR abs/1409.7217 (2014) - 2013
- [i8]Emanuele Giaquinta, Kimmo Fredriksson, Szymon Grabowski, Alexandru I. Tomescu, Esko Ukkonen:
Motif matching using gapped patterns. CoRR abs/1306.2483 (2013) - [i7]Sebastian Deorowicz, Szymon Grabowski:
Efficient algorithms for the longest common subsequence in $k$-length substrings. CoRR abs/1311.4552 (2013) - [i6]Szymon Grabowski:
New tabulation and sparse dynamic programming based techniques for sequence similarity problems. CoRR abs/1312.2217 (2013) - 2012
- [i5]Emanuele Giaquinta, Szymon Grabowski:
New algorithms for binary jumbled pattern matching. CoRR abs/1210.6176 (2012) - [i4]Emanuele Giaquinta, Szymon Grabowski, Kimmo Fredriksson:
Approximate pattern matching with k-mismatches in packed text. CoRR abs/1211.5433 (2012) - 2011
- [i3]Szymon Grabowski, Sebastian Deorowicz:
Engineering Relative Compression of Genomes. CoRR abs/1103.2351 (2011) - 2010
- [i2]Szymon Grabowski, Wojciech Bieniecki:
Tight and simple Web graph compression. CoRR abs/1006.0809 (2010) - [i1]Szymon Grabowski, Simone Faro, Emanuele Giaquinta:
String Matching with Inversions and Translocations in Linear Average Time (Most of the Time). CoRR abs/1012.0280 (2010)
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-09-21 23:43 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:
