218 related articles for article (PubMed ID: 34525345)
21. On the representation of de Bruijn graphs.
Chikhi R; Limasset A; Jackman S; Simpson JT; Medvedev P
J Comput Biol; 2015 May; 22(5):336-52. PubMed ID: 25629448
[TBL] [Abstract][Full Text] [Related]
22. 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]
23. LongStitch: high-quality genome assembly correction and scaffolding using long reads.
Coombe L; Li JX; Lo T; Wong J; Nikolic V; Warren RL; Birol I
BMC Bioinformatics; 2021 Oct; 22(1):534. PubMed ID: 34717540
[TBL] [Abstract][Full Text] [Related]
24. Efficient High-Quality Metagenome Assembly from Long Accurate Reads using Minimizer-space de Bruijn Graphs.
Benoit G; Raguideau S; James R; Phillippy AM; Chikhi R; Quince C
bioRxiv; 2023 Jul; ():. PubMed ID: 37786716
[TBL] [Abstract][Full Text] [Related]
25. HyDA-Vista: towards optimal guided selection of k-mer size for sequence assembly.
Shariat B; Movahedi NS; Chitsaz H; Boucher C
BMC Genomics; 2014; 15 Suppl 10(Suppl 10):S9. PubMed ID: 25558875
[TBL] [Abstract][Full Text] [Related]
26. deBGR: an efficient and near-exact representation of the weighted de Bruijn graph.
Pandey P; Bender MA; Johnson R; Patro R
Bioinformatics; 2017 Jul; 33(14):i133-i141. PubMed ID: 28881995
[TBL] [Abstract][Full Text] [Related]
27. Coverage-preserving sparsification of overlap graphs for long-read assembly.
Jain C
Bioinformatics; 2023 Mar; 39(3):. PubMed ID: 36892439
[TBL] [Abstract][Full Text] [Related]
28. Pan-genome de Bruijn graph using the bidirectional FM-index.
Depuydt L; Renders L; Abeel T; Fostier J
BMC Bioinformatics; 2023 Oct; 24(1):400. PubMed ID: 37884897
[TBL] [Abstract][Full Text] [Related]
29. Velvet: algorithms for de novo short read assembly using de Bruijn graphs.
Zerbino DR; Birney E
Genome Res; 2008 May; 18(5):821-9. PubMed ID: 18349386
[TBL] [Abstract][Full Text] [Related]
30. Metagenome SNP calling via read-colored de Bruijn graphs.
Alipanahi B; Muggli MD; Jundi M; Noyes NR; Boucher C
Bioinformatics; 2021 Apr; 36(22-23):5275-5281. PubMed ID: 32049324
[TBL] [Abstract][Full Text] [Related]
31. BrownieAligner: accurate alignment of Illumina sequencing data to de Bruijn graphs.
Heydari M; Miclotte G; Van de Peer Y; Fostier J
BMC Bioinformatics; 2018 Sep; 19(1):311. PubMed ID: 30180801
[TBL] [Abstract][Full Text] [Related]
32. MetaVelvet-DL: a MetaVelvet deep learning extension for de novo metagenome assembly.
Liang KC; Sakakibara Y
BMC Bioinformatics; 2021 Jun; 22(Suppl 6):427. PubMed ID: 34078257
[TBL] [Abstract][Full Text] [Related]
33. 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]
34. 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]
35. Faucet: streaming de novo assembly graph construction.
Rozov R; Goldshlager G; Halperin E; Shamir R
Bioinformatics; 2018 Jan; 34(1):147-154. PubMed ID: 29036597
[TBL] [Abstract][Full Text] [Related]
36. Practical dynamic de Bruijn graphs.
Crawford VG; Kuhnle A; Boucher C; Chikhi R; Gagie T
Bioinformatics; 2018 Dec; 34(24):4189-4195. PubMed ID: 29939217
[TBL] [Abstract][Full Text] [Related]
37. Using 2kâ+â2 bubble searches to find single nucleotide polymorphisms in k-mer graphs.
Younsi R; MacLean D
Bioinformatics; 2015 Mar; 31(5):642-6. PubMed ID: 25344498
[TBL] [Abstract][Full Text] [Related]
38. FastEtch: A Fast Sketch-Based Assembler for Genomes.
Ghosh P; Kalyanaraman A
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1091-1106. PubMed ID: 28910776
[TBL] [Abstract][Full Text] [Related]
39. Evaluation of short read metagenomic assembly.
Charuvaka A; Rangwala H
BMC Genomics; 2011; 12 Suppl 2(Suppl 2):S8. PubMed ID: 21989307
[TBL] [Abstract][Full Text] [Related]
40. 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]
[Previous] [Next] [New Search]
