202 related articles for article (PubMed ID: 30072337)
1. Fast de Bruijn Graph Compaction in Distributed Memory Environments.
Pan T; Nihalani R; Aluru S
IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(1):136-148. PubMed ID: 30072337
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. Benchmarking of de novo assembly algorithms for Nanopore data reveals optimal performance of OLC approaches.
Cherukuri Y; Janga SC
BMC Genomics; 2016 Aug; 17 Suppl 7(Suppl 7):507. PubMed ID: 27556636
[TBL] [Abstract][Full Text] [Related]
4. 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]
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. 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]
7. Integrating long-range connectivity information into de Bruijn graphs.
Turner I; Garimella KV; Iqbal Z; McVean G
Bioinformatics; 2018 Aug; 34(15):2556-2565. PubMed ID: 29554215
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. Compacting de Bruijn graphs from sequencing data quickly and in low memory.
Chikhi R; Limasset A; Medvedev P
Bioinformatics; 2016 Jun; 32(12):i201-i208. PubMed ID: 27307618
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. Scalable De Novo Genome Assembly Using a Pregel-Like Graph-Parallel System.
Guo G; Chen H; Yan D; Cheng J; Chen JY; Chong Z
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(2):731-744. PubMed ID: 31180898
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. 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]
14. Simplitigs as an efficient and scalable representation of de Bruijn graphs.
Břinda K; Baym M; Kucherov G
Genome Biol; 2021 Apr; 22(1):96. PubMed ID: 33823902
[TBL] [Abstract][Full Text] [Related]
15. Integration of string and de Bruijn graphs for genome assembly.
Huang YT; Liao CF
Bioinformatics; 2016 May; 32(9):1301-7. PubMed ID: 26755626
[TBL] [Abstract][Full Text] [Related]
16. Minimizer-space de Bruijn graphs: Whole-genome assembly of long reads in minutes on a personal computer.
Ekim B; Berger B; Chikhi R
Cell Syst; 2021 Oct; 12(10):958-968.e6. PubMed ID: 34525345
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. 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]
19. An efficient algorithm for DNA fragment assembly in MapReduce.
Xu B; Gao J; Li C
Biochem Biophys Res Commun; 2012 Sep; 426(3):395-8. PubMed ID: 22960169
[TBL] [Abstract][Full Text] [Related]
20. 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]
[Next] [New Search]
