82 results on '"Grabowski, Szymon"'
Search Results
2. copMEM2: Robust and scalable maximum exact match finding
3. Space-efficient Huffman codes revisited
4. FM-index for Dummies
5. Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings
6. The Cooperative Anti-Neoplastic Activity of Polyphenolic Phytochemicals on Human T-Cell Acute Lymphoblastic Leukemia Cell Line MOLT-4 In Vitro
7. Efficient and compact representations of some non-canonical prefix-free codes
8. Longest Common Abelian Factors and Large Alphabets
9. MBGC: Multiple Bacteria Genome Compressor
10. OFR: An Efficient Representation of RDF Datasets
11. Sampling the Suffix Array with Minimizers
12. VARIOUS APPROACHES TO PROCESSING AND ANALYSIS OF IMAGES OBTAINED FROM IMMUNOENZYMATIC VISUALIZATION OF SECRETORY ACTIVITY WITH ELISPOT METHOD
13. Subcubic Algorithms for the Sequence Excluded LCS Problem
14. Fast and Simple Circular Pattern Matching
15. Algorithms for all‐pairs Hamming distance based similarity
16. Motif Matching Using Gapped Patterns
17. MBGC: Multiple Bacteria Genome Compressor
18. Merging Adjacency Lists for Efficient Web Graph Compression
19. Nested Counters in Bit-Parallel String Matching
20. On Two Variants of the Longest Increasing Subsequence Problem
21. Fast Convolutions and Their Applications in Approximate String Matching
22. Engineering the Compression of Sequencing Reads
23. Preprocessing for Real-Time Handwritten Character Recognition
24. PgRC: pseudogenome-based read compressor
25. Efficient Algorithms for Pattern Matching with General Gaps and Character Classes
26. Efficient Bit-Parallel Algorithms for (δ,α)-Matching
27. Practical and Optimal String Matching
28. First Huffman, Then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index
29. Reducing the Computational Demands for Nearest Centroid Neighborhood Classifiers
30. NEAREST NEIGHBOR DECISION RULE FOR PIXEL CLASSIFICATION IN REMOTE SENSING
31. PgRC: Pseudogenome based Read Compressor
32. Revisiting Multiple Pattern Matching
33. Suffix Arrays with a Twist
34. Lightweight Fingerprints for Fast Approximate Keyword Matching Using Bitwise Operations
35. Viral Genome Deep Classifier
36. Whisper: read sorting allows robust mapping of DNA sequencing data
37. On Abelian Longest Common Factor with and without RLE
38. DeltaComp: Fast and efficient compression of astronomical timelines
39. copMEM: finding maximal exact matches via sampling both genomes
40. Faster range minimum queries
41. SOPanG: online text searching over a pan-genome
42. Rank and select: Another lesson learned
43. Whisper: Read sorting allows robust mapping of sequencing data
44. Sampled suffix array with minimizers
45. A Practical Index for Approximate Dictionary Matching with Few Mismatches
46. New tabulation and sparse dynamic programming based techniques for sequence similarity problems
47. A Bloom filter based semi-index on q -grams
48. Comment on: ‘ERGC: an efficient referential genome compression algorithm’
49. Indexing Arbitrary-Length k-Mers in Sequencing Reads
50. A note on the longest common substring with k-mismatches problem
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.