164 related articles for article (PubMed ID: 26315905)
1. EPGA2: memory-efficient de novo assembler.
Luo J; Wang J; Li W; Zhang Z; Wu FX; Li M; Pan Y
Bioinformatics; 2015 Dec; 31(24):3988-90. PubMed ID: 26315905
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. MegaGTA: a sensitive and accurate metagenomic gene-targeted assembler using iterative de Bruijn graphs.
Li D; Huang Y; Leung CM; Luo R; Ting HF; Lam TW
BMC Bioinformatics; 2017 Oct; 18(Suppl 12):408. PubMed ID: 29072142
[TBL] [Abstract][Full Text] [Related]
4. 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]
5. Efficient de novo assembly of large genomes using compressed data structures.
Simpson JT; Durbin R
Genome Res; 2012 Mar; 22(3):549-56. PubMed ID: 22156294
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. LightAssembler: fast and memory-efficient assembly algorithm for high-throughput sequencing reads.
El-Metwally S; Zakaria M; Hamza T
Bioinformatics; 2016 Nov; 32(21):3215-3223. PubMed ID: 27412092
[TBL] [Abstract][Full Text] [Related]
8. NeatFreq: reference-free data reduction and coverage normalization for De Novo sequence assembly.
McCorrison JM; Venepally P; Singh I; Fouts DE; Lasken RS; Methé BA
BMC Bioinformatics; 2014 Nov; 15(1):357. PubMed ID: 25407910
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. 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]
11. Clover: a clustering-oriented de novo assembler for Illumina sequences.
Hsieh MF; Lu CL; Tang CY
BMC Bioinformatics; 2020 Nov; 21(1):528. PubMed ID: 33203354
[TBL] [Abstract][Full Text] [Related]
12. SCOP: a novel scaffolding algorithm based on contig classification and optimization.
Li M; Tang L; Wu FX; Pan Y; Wang J
Bioinformatics; 2019 Apr; 35(7):1142-1150. PubMed ID: 30184046
[TBL] [Abstract][Full Text] [Related]
13. BOSS: a novel scaffolding algorithm based on an optimized scaffold graph.
Luo J; Wang J; Zhang Z; Li M; Wu FX
Bioinformatics; 2017 Jan; 33(2):169-176. PubMed ID: 27634951
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references.
Bao E; Jiang T; Girke T
Bioinformatics; 2014 Jun; 30(12):i319-i328. PubMed ID: 24932000
[TBL] [Abstract][Full Text] [Related]
16. Squeakr: an exact and approximate k-mer counting system.
Pandey P; Bender MA; Johnson R; Patro R; Berger B
Bioinformatics; 2018 Feb; 34(4):568-575. PubMed ID: 29444235
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. ntCard: a streaming algorithm for cardinality estimation in genomics data.
Mohamadi H; Khan H; Birol I
Bioinformatics; 2017 May; 33(9):1324-1330. PubMed ID: 28453674
[TBL] [Abstract][Full Text] [Related]
19. QuorUM: An Error Corrector for Illumina Reads.
Marçais G; Yorke JA; Zimin A
PLoS One; 2015; 10(6):e0130821. PubMed ID: 26083032
[TBL] [Abstract][Full Text] [Related]
20. A general near-exact k-mer counting method with low memory consumption enables de novo assembly of 106× human sequence data in 2.7 hours.
Shi CH; Yip KY
Bioinformatics; 2020 Dec; 36(Suppl_2):i625-i633. PubMed ID: 33381843
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
