121 related articles for article (PubMed ID: 38060353)
1. MiniDBG: A Novel and Minimal De Bruijn Graph for Read Mapping.
Yu C; Zhao Y; Zhao C; Jin J; Mao K; Wang G
IEEE/ACM Trans Comput Biol Bioinform; 2024; 21(1):129-142. PubMed ID: 38060353
[TBL] [Abstract][Full Text] [Related]
2. Meta-colored compacted de Bruijn graphs.
Pibiri GE; Fan J; Patro R
bioRxiv; 2023 Nov; ():. PubMed ID: 37546988
[TBL] [Abstract][Full Text] [Related]
3. RMI-DBG algorithm: A more agile iterative de Bruijn graph algorithm in short read genome assembly.
Hosseini ZZ; Rahimi SK; Forouzan E; Baraani A
J Bioinform Comput Biol; 2021 Apr; 19(2):2150005. PubMed ID: 33866959
[TBL] [Abstract][Full Text] [Related]
4. Read mapping on de Bruijn graphs.
Limasset A; Cazaux B; Rivals E; Peterlongo P
BMC Bioinformatics; 2016 Jun; 17(1):237. PubMed ID: 27306641
[TBL] [Abstract][Full Text] [Related]
5. KSNP: a fast de Bruijn graph-based haplotyping tool approaching data-in time cost.
Zhou Q; Ji F; Lin D; Liu X; Zhu Z; Ruan J
Nat Commun; 2024 Apr; 15(1):3126. PubMed ID: 38605047
[TBL] [Abstract][Full Text] [Related]
6. Enhanced Compression of
Rossignolo E; Comin M
J Comput Biol; 2024 Jun; 31(6):524-538. PubMed ID: 38820168
[TBL] [Abstract][Full Text] [Related]
7. Compact representation of k-mer de Bruijn graphs for genome read assembly.
Rødland EA
BMC Bioinformatics; 2013 Oct; 14():313. PubMed ID: 24152242
[TBL] [Abstract][Full Text] [Related]
8. Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage.
Holley G; Wittler R; Stoye J
Algorithms Mol Biol; 2016; 11():3. PubMed ID: 27087830
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. An Efficient, Scalable, and Exact Representation of High-Dimensional Color Information Enabled Using de Bruijn Graph Search.
Almodaresi F; Pandey P; Ferdman M; Johnson R; Patro R
J Comput Biol; 2020 Apr; 27(4):485-499. PubMed ID: 32176522
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. Label-guided seed-chain-extend alignment on annotated De Bruijn graphs.
Mustafa H; Karasikov M; Mansouri Ghiasi N; Rätsch G; Kahles A
Bioinformatics; 2024 Jun; 40(Supplement_1):i337-i346. PubMed ID: 38940164
[TBL] [Abstract][Full Text] [Related]
13. Efficient Colored de Bruijn Graph for Indexing Reads.
Hasegawa N; Shimizu K
J Comput Biol; 2023 Jun; 30(6):648-662. PubMed ID: 37115583
[TBL] [Abstract][Full Text] [Related]
14. Assessing graph-based read mappers against a baseline approach highlights strengths and weaknesses of current methods.
Grytten I; Rand KD; Nederbragt AJ; Sandve GK
BMC Genomics; 2020 Apr; 21(1):282. PubMed ID: 32252628
[TBL] [Abstract][Full Text] [Related]
15. RResolver: efficient short-read repeat resolution within ABySS.
Nikolić V; Afshinfard A; Chu J; Wong J; Coombe L; Nip KM; Warren RL; Birol I
BMC Bioinformatics; 2022 Jun; 23(1):246. PubMed ID: 35729491
[TBL] [Abstract][Full Text] [Related]
16. deGSM: Memory Scalable Construction Of Large Scale de Bruijn Graph.
Guo H; Fu Y; Gao Y; Li J; Wang Y; Liu B
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2157-2166. PubMed ID: 31056509
[TBL] [Abstract][Full Text] [Related]
17. Sparse Binary Relation Representations for Genome Graph Annotation.
Karasikov M; Mustafa H; Joudaki A; Javadzadeh-No S; Rätsch G; Kahles A
J Comput Biol; 2020 Apr; 27(4):626-639. PubMed ID: 31891531
[TBL] [Abstract][Full Text] [Related]
18. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
[TBL] [Abstract][Full Text] [Related]
19. Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs.
Holley G; Melsted P
Genome Biol; 2020 Sep; 21(1):249. PubMed ID: 32943081
[TBL] [Abstract][Full Text] [Related]
20. 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]
[Next] [New Search]
