199 related articles for article (PubMed ID: 36450127)
21. Colored de Bruijn graphs and the genome halving problem.
Alekseyev MA; Pevzner PA
IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(1):98-107. PubMed ID: 17277417
[TBL] [Abstract][Full Text] [Related]
22. Applications of de Bruijn graphs in microbiome research.
Dufault-Thompson K; Jiang X
Imeta; 2022 Mar; 1(1):e4. PubMed ID: 38867733
[TBL] [Abstract][Full Text] [Related]
23. 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]
24. 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]
25. Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT.
Cracco A; Tomescu AI
Genome Res; 2023 Jul; 33(7):1198-1207. PubMed ID: 37253540
[TBL] [Abstract][Full Text] [Related]
26. 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]
27. 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]
28. 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]
29. Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform.
Baier U; Beller T; Ohlebusch E
Bioinformatics; 2016 Feb; 32(4):497-504. PubMed ID: 26504144
[TBL] [Abstract][Full Text] [Related]
30. Succinct colored de Bruijn graphs.
Muggli MD; Bowe A; Noyes NR; Morley PS; Belk KE; Raymond R; Gagie T; Puglisi SJ; Boucher C
Bioinformatics; 2017 Oct; 33(20):3181-3187. PubMed ID: 28200001
[TBL] [Abstract][Full Text] [Related]
31. Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2.
Khan J; Kokot M; Deorowicz S; Patro R
Genome Biol; 2022 Sep; 23(1):190. PubMed ID: 36076275
[TBL] [Abstract][Full Text] [Related]
32. 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]
33. Identifying similar transcripts in a related organism from de Bruijn graphs of RNA-Seq data, with applications to the study of salt and waterlogging tolerance in Melilotus.
Fu S; Chang PL; Friesen ML; Teakle NL; Tarone AM; Sze SH
BMC Genomics; 2019 Jun; 20(Suppl 5):425. PubMed ID: 31167652
[TBL] [Abstract][Full Text] [Related]
34. 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]
35. Paired de bruijn graphs: a novel approach for incorporating mate pair information into genome assemblers.
Medvedev P; Pham S; Chaisson M; Tesler G; Pevzner P
J Comput Biol; 2011 Nov; 18(11):1625-34. PubMed ID: 21999285
[TBL] [Abstract][Full Text] [Related]
36. Accurate determination of node and arc multiplicities in de bruijn graphs using conditional random fields.
Steyaert A; Audenaert P; Fostier J
BMC Bioinformatics; 2020 Sep; 21(1):402. PubMed ID: 32928110
[TBL] [Abstract][Full Text] [Related]
37. libFLASM: a software library for fixed-length approximate string matching.
Ayad LA; Pissis SP; Retha A
BMC Bioinformatics; 2016 Nov; 17(1):454. PubMed ID: 27832739
[TBL] [Abstract][Full Text] [Related]
38. 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]
39. Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants.
Qiu Y; Shen Y; Kingsford C
Algorithms Mol Biol; 2024 Apr; 19(1):17. PubMed ID: 38679703
[TBL] [Abstract][Full Text] [Related]
40. Finding maximal exact matches in graphs.
Rizzo N; Cáceres M; Mäkinen V
Algorithms Mol Biol; 2024 Mar; 19(1):10. PubMed ID: 38468275
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
