| Genome compression: a novel approach for large collections S Deorowicz, A Danek, S Grabowski Bioinformatics 29 (20), 2572-2578, 2013 | 67 | 2013 |
| GDC 2: Compression of large collections of genomes S Deorowicz, A Danek, M Niemiec Scientific reports 5, 2015 | 60 | 2015 |
| Indexes of large genome collections on a PC A Danek, S Deorowicz, S Grabowski PloS one 9 (10), e109384, 2014 | 54 | 2014 |
| Evaluation and integration of functional annotation pipelines for newly sequenced organisms: the potato genome as a test case D Amar, I Frades, A Danek, T Goldberg, SK Sharma, PE Hedley, ... BMC Plant Biology 14 (1), 329, 2014 | 27 | 2014 |
| Engaging the dynamics of trust in computational trust and reputation systems A Danek, J Urbano, AP Rocha, E Oliveira KES International Symposium on Agent and Multi-Agent Systems: Technologies …, 2010 | 23 | 2010 |
| Kmer-db: instant evolutionary distance estimation S Deorowicz, A Gudyś, M Długosz, M Kokot, A Danek Bioinformatics 35 (1), 133-136, 2018 | 21 | 2018 |
| GTC: how to maintain huge genotype collections in a compressed form A Danek, S Deorowicz Bioinformatics 34 (11), 1834-1840, 2018 | 21 | 2018 |
| GTShark: genotype compression in large projects S Deorowicz, A Danek Bioinformatics 35 (22), 4791-4793, 2019 | 11 | 2019 |
| Inter-population Differences in Retrogene Loss and Expression in Humans M Kabza, MR Kubiak, A Danek, W Rosikiewicz, S Deorowicz, A Polański, ... PLOS Genet 11 (10), e1005579, 2015 | 11 | 2015 |
| Application of the burrows-wheeler transform for searching for approximate tandem repeats A Danek, R Pokrzywa, I Makałowska, A Polański IAPR International Conference on Pattern Recognition in Bioinformatics, 255-266, 2012 | 7 | 2012 |
| AGC: compact representation of assembled genomes with fast queries and updates S Deorowicz, A Danek, H Li Bioinformatics 39 (3), btad097, 2023 | 5 | 2023 |
| VCFShark: how to squeeze a VCF file S Deorowicz, A Danek, M Kokot Bioinformatics 37 (19), 3358-3360, 2021 | 4 | 2021 |
| Bit-parallel algorithms for the merged longest common subsequence problem S Deorowicz, A Danek International Journal of Foundations of Computer Science 24 (08), 1281-1298, 2013 | 4 | 2013 |
| Finding Approximate Tandem Repeats with the Burrows-Wheeler Transform A Danek, R Pokrzywa International Journal of Medical and Biological Sciences 6, 8-12, 2012 | 3 | 2012 |
| Bit-Parallel Algorithm for the Block Variant of the Merged Longest Common Subsequence Problem A Danek, S Deorowicz Man-Machine Interactions 3, 173-181, 2014 | 2 | 2014 |
| Algorithms for analysis of genomic data in compressed domain A Danek | | |
| Supplementary information GDC 2: Compression of large collections of genomes S Deorowicz, A Danek, M Niemiec | | |
