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.
3. 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]
4. A space and time-efficient index for the compacted colored de Bruijn graph. Almodaresi F; Sarkar H; Srivastava A; Patro R Bioinformatics; 2018 Jul; 34(13):i169-i177. PubMed ID: 29949982 [TBL] [Abstract][Full Text] [Related]
6. 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]
7. Aligning optical maps to de Bruijn graphs. Mukherjee K; Alipanahi B; Kahveci T; Salmela L; Boucher C Bioinformatics; 2019 Sep; 35(18):3250-3256. PubMed ID: 30698651 [TBL] [Abstract][Full Text] [Related]
17. The Practical Haplotype Graph, a platform for storing and using pangenomes for imputation. Bradbury PJ; Casstevens T; Jensen SE; Johnson LC; Miller ZR; Monier B; Romay MC; Song B; Buckler ES Bioinformatics; 2022 Aug; 38(15):3698-3702. PubMed ID: 35748708 [TBL] [Abstract][Full Text] [Related]
19. TwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes. Minkin I; Pham S; Medvedev P Bioinformatics; 2017 Dec; 33(24):4024-4032. PubMed ID: 27659452 [TBL] [Abstract][Full Text] [Related]