Methods to handle large genomic data sets

Carl Kingsford
Herbert A. Simon Professor of Computer Science



(2017). Improved search of large transcriptomic sequencing databases using split sequence bloom trees. International Conference on Research in Computational Molecular Biology, pages 257-271.

Preprint PDF Code Project

(2016). Compact universal k-mer hitting sets. International Workshop on Algorithms in Bioinformatics, pages 257-268.

PDF Project

(2015). Rapid, separable compression enables fast analyses of sequence alignments. Proceedings of the 6th ACM Conference on Bioinformatics, Computational Biology and Health Informatics, pages 194-201.

PDF Code Project