These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
5. Cuttlefish: fast, parallel and low-memory compaction of de Bruijn graphs from large-scale genome collections. Khan J; Patro R Bioinformatics; 2021 Jul; 37(Suppl_1):i177-i186. PubMed ID: 34252958 [TBL] [Abstract][Full Text] [Related]
6. Comparing methods for constructing and representing human pangenome graphs. Andreace F; Lechat P; Dufresne Y; Chikhi R Genome Biol; 2023 Nov; 24(1):274. PubMed ID: 38037131 [TBL] [Abstract][Full Text] [Related]
12. Efficient short read mapping to a pangenome that is represented by a graph of ED strings. Büchler T; Olbrich J; Ohlebusch E Bioinformatics; 2023 May; 39(5):. PubMed ID: 37171844 [TBL] [Abstract][Full Text] [Related]
17. StLiter: A Novel Algorithm to Iteratively Build the Compacted de Bruijn Graph From Many Complete Genomes. Yu C; Mao K; Zhao Y; Chang C; Wang G IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(4):2471-2483. PubMed ID: 33630738 [TBL] [Abstract][Full Text] [Related]
18. Building large updatable colored de Bruijn graphs via merging. Muggli MD; Alipanahi B; Boucher C Bioinformatics; 2019 Jul; 35(14):i51-i60. PubMed ID: 31510647 [TBL] [Abstract][Full Text] [Related]