Engaging the Dynamics of Trust in Computational Trust and Reputation Systems. - Agnieszka Danek; Joana Urbano; Ana Paula Rocha 001; Eugénio C. Oliveira (KES-AMSTA (1), 2010)

Application of the Burrows-Wheeler Transform for Searching for Approximate Tandem Repeats. - Agnieszka Danek; Rafal Pokrzywa; Izabela Makalowska; Andrzej Polanski (PRIB, 2012)

Bit-Parallel Algorithm for the Block Variant of the Merged Longest Common Subsequence Problem. - Agnieszka Danek; Sebastian Deorowicz (ICMMI, 2013)

Genome compression: a novel approach for large collections. - Sebastian Deorowicz; Agnieszka Danek; Szymon Grabowski (Bioinform., 2013)

Bit-Parallel Algorithms for the Merged Longest Common Subsequence Problem. - Sebastian Deorowicz; Agnieszka Danek (Int. J. Found. Comput. Sci., 2013)

Indexing large genome collections on a PC. - Agnieszka Danek; Sebastian Deorowicz; Szymon Grabowski (CoRR, 2014)

GDC 2: Compression of large collections of genomes. - Sebastian Deorowicz; Agnieszka Danek; Marcin Niemiec (CoRR, 2015)

GTC: how to maintain huge genotype collections in a compressed form. - Agnieszka Danek; Sebastian Deorowicz (Bioinform., 2018)

GTShark: genotype compression in large projects. - Sebastian Deorowicz; Agnieszka Danek (Bioinform., 2019)

Kmer-db: instant evolutionary distance estimation. - Sebastian Deorowicz; Adam Gudys; Maciej Dlugosz; Marek Kokot; Agnieszka Danek (Bioinform., 2019)

VCFShark: how to squeeze a VCF file. - Sebastian Deorowicz; Agnieszka Danek; Marek Kokot (Bioinform., 2021)

AGC: compact representation of assembled genomes with fast queries and updates. - Sebastian Deorowicz; Agnieszka Danek; Heng Li (Bioinform., 2023)