261 related articles for article (PubMed ID: 25364472)
1. AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS.
Kundeti V; Rajasekaran S; Dinh H
Discrete Math Algorithms Appl; 2010; 1():184-196. PubMed ID: 25364472
[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. On the Hardness of Sequence Alignment on De Bruijn Graphs.
Gibney D; Thankachan SV; Aluru S
J Comput Biol; 2022 Dec; 29(12):1377-1396. PubMed ID: 36450127
[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. 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]
6. Maximum likelihood genome assembly.
Medvedev P; Brudno M
J Comput Biol; 2009 Aug; 16(8):1101-16. PubMed ID: 19645596
[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. 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]
9. 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]
10. 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]
11. 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]
12. Compression Algorithm for Colored de Bruijn Graphs.
Rahman A; Dufresne Y; Medvedev P
Lebniz Int Proc Inform; 2023 Sep; 273():. PubMed ID: 38712341
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. Multiplex de Bruijn graphs enable genome assembly from long, high-fidelity reads.
Bankevich A; Bzikadze AV; Kolmogorov M; Antipov D; Pevzner PA
Nat Biotechnol; 2022 Jul; 40(7):1075-1081. PubMed ID: 35228706
[TBL] [Abstract][Full Text] [Related]
15. Assembly of long error-prone reads using de Bruijn graphs.
Lin Y; Yuan J; Kolmogorov M; Shen MW; Chaisson M; Pevzner PA
Proc Natl Acad Sci U S A; 2016 Dec; 113(52):E8396-E8405. PubMed ID: 27956617
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. Inference of viral quasispecies with a paired de Bruijn graph.
Freire B; Ladra S; Paramá JR; Salmela L
Bioinformatics; 2021 May; 37(4):473-481. PubMed ID: 32926162
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. MBG: Minimizer-based sparse de Bruijn Graph construction.
Rautiainen M; Marschall T
Bioinformatics; 2021 Aug; 37(16):2476-2478. PubMed ID: 33475133
[TBL] [Abstract][Full Text] [Related]
20. A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.
Dinh H; Rajasekaran S
Bioinformatics; 2011 Jul; 27(14):1901-7. PubMed ID: 21636593
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
