Bidirectional variable-order de bruijn graphs, LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, vol.9644, p.164, 2016. ,
Fully Dynamic de Bruijn Graphs, String Processing and Information Retrieval, pp.145-152, 2016. ,
Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, vol.13, issue.7, pp.422-426, 1970. ,
Variable-order de bruijn graphs, Data Compression Conference (DCC), pp.383-392, 2015. ,
Succinct de bruijn graphs, International Workshop on Algorithms in Bioinformatics, pp.225-235, 2012. ,
Space-efficient and exact de bruijn graph representation based on a bloom filter, Algorithms for Molecular Biology, vol.8, issue.1, p.22, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00753930
Efficient minimal perfect hashing in nearly minimal space, Annual Symposium on Theoretical Aspects of Computer Science, pp.317-326, 2001. ,
Efficient randomized patternmatching algorithms, IBM Journal of Research and Development, vol.31, issue.2, pp.249-260, 1987. ,
Fast and scalable minimal perfect hashing for massive key sets, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01566246
On dynamic range reporting in one dimension, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pp.104-111, 2005. ,
Scaling metagenome sequence assembly with probabilistic de bruijn graphs, Proceedings of the National Academy of Sciences, vol.109, issue.33, pp.13272-13277, 2012. ,
Using cascading bloom filters to improve the memory usage for de brujin graphs, Algorithms for Molecular Biology, vol.9, issue.1, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00824697