323 related articles for article (PubMed ID: 31368484)
1. Sequence tube maps: making graph genomes intuitive to commuters.
Beyer W; Novak AM; Hickey G; Chan J; Tan V; Paten B; Zerbino DR
Bioinformatics; 2019 Dec; 35(24):5318-5320. PubMed ID: 31368484
[TBL] [Abstract][Full Text] [Related]
2. Distance indexing and seed clustering in sequence graphs.
Chang X; Eizenga J; Novak AM; Sirén J; Paten B
Bioinformatics; 2020 Jul; 36(Suppl_1):i146-i153. PubMed ID: 32657356
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. Haplotype-aware graph indexes.
Sirén J; Garrison E; Novak AM; Paten B; Durbin R
Bioinformatics; 2020 Jan; 36(2):400-407. PubMed ID: 31406990
[TBL] [Abstract][Full Text] [Related]
5. ODGI: understanding pangenome graphs.
Guarracino A; Heumos S; Nahnsen S; Prins P; Garrison E
Bioinformatics; 2022 Jun; 38(13):3319-3326. PubMed ID: 35552372
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. 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]
8. Unbiased pangenome graphs.
Garrison E; Guarracino A
Bioinformatics; 2023 Jan; 39(1):. PubMed ID: 36448683
[TBL] [Abstract][Full Text] [Related]
9. BubbleGun: enumerating bubbles and superbubbles in genome graphs.
Dabbaghie F; Ebler J; Marschall T
Bioinformatics; 2022 Sep; 38(17):4217-4219. PubMed ID: 35799353
[TBL] [Abstract][Full Text] [Related]
10. Coordinates and intervals in graph-based reference genomes.
Rand KD; Grytten I; Nederbragt AJ; Storvik GO; Glad IK; Sandve GK
BMC Bioinformatics; 2017 May; 18(1):263. PubMed ID: 28521770
[TBL] [Abstract][Full Text] [Related]
11. Nubeam-dedup: a fast and RAM-efficient tool to de-duplicate sequencing reads without mapping.
Dai H; Guan Y
Bioinformatics; 2020 May; 36(10):3254-3256. PubMed ID: 32091581
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. The effect of genome graph expressiveness on the discrepancy between genome graph distance and string set distance.
Qiu Y; Kingsford C
Bioinformatics; 2022 Jun; 38(Suppl 1):i404-i412. PubMed ID: 35758819
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. NextPolish: a fast and efficient genome polishing tool for long-read assembly.
Hu J; Fan J; Sun Z; Liu S
Bioinformatics; 2020 Apr; 36(7):2253-2255. PubMed ID: 31778144
[TBL] [Abstract][Full Text] [Related]
16. Bandage: interactive visualization of de novo genome assemblies.
Wick RR; Schultz MB; Zobel J; Holt KE
Bioinformatics; 2015 Oct; 31(20):3350-2. PubMed ID: 26099265
[TBL] [Abstract][Full Text] [Related]
17. Bit-parallel sequence-to-graph alignment.
Rautiainen M; Mäkinen V; Marschall T
Bioinformatics; 2019 Oct; 35(19):3599-3607. PubMed ID: 30851095
[TBL] [Abstract][Full Text] [Related]
18. Toward perfect reads: self-correction of short reads via mapping on de Bruijn graphs.
Limasset A; Flot JF; Peterlongo P
Bioinformatics; 2020 Mar; 36(5):1374-1381. PubMed ID: 30785192
[TBL] [Abstract][Full Text] [Related]
19. deBWT: parallel construction of Burrows-Wheeler Transform for large collection of genomes with de Bruijn-branch encoding.
Liu B; Zhu D; Wang Y
Bioinformatics; 2016 Jun; 32(12):i174-i182. PubMed ID: 27307614
[TBL] [Abstract][Full Text] [Related]
20. Efficient dynamic variation graphs.
Eizenga JM; Novak AM; Kobayashi E; Villani F; Cisar C; Heumos S; Hickey G; Colonna V; Paten B; Garrison E
Bioinformatics; 2021 Jan; 36(21):5139-5144. PubMed ID: 33040146
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
