These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
165 related articles for article (PubMed ID: 39073829)
21. Efficient DNA-based data storage using shortmer combinatorial encoding. Preuss I; Rosenberg M; Yakhini Z; Anavy L Sci Rep; 2024 Apr; 14(1):7731. PubMed ID: 38565928 [TBL] [Abstract][Full Text] [Related]
22. Study on DNA Storage Encoding Based IAOA under Innovation Constraints. Du H; Zhou S; Yan W; Wang S Curr Issues Mol Biol; 2023 Apr; 45(4):3573-3590. PubMed ID: 37185757 [TBL] [Abstract][Full Text] [Related]
23. Design of Constraint Coding Sets for Archive DNA Storage. Yin Q; Zheng Y; Wang B; Zhang Q IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(6):3384-3394. PubMed ID: 34762590 [TBL] [Abstract][Full Text] [Related]
24. Combinatorial constraint coding based on the EORS algorithm in DNA storage. Xiaoru L; Ling G PLoS One; 2021; 16(7):e0255376. PubMed ID: 34324571 [TBL] [Abstract][Full Text] [Related]
25. Levy Equilibrium Optimizer algorithm for the DNA storage code set. Zhang J PLoS One; 2022; 17(11):e0277139. PubMed ID: 36395269 [TBL] [Abstract][Full Text] [Related]
26. 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]
27. 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]
29. Overcoming the High Error Rate of Composite DNA Letters-Based Digital Storage through Soft-Decision Decoding. Xu Y; Ding L; Wu S; Ruan J Adv Sci (Weinh); 2024 Aug; 11(30):e2402951. PubMed ID: 38874370 [TBL] [Abstract][Full Text] [Related]
30. 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]
31. 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]
32. DNA-QLC: an efficient and reliable image encoding scheme for DNA storage. Zheng Y; Cao B; Zhang X; Cui S; Wang B; Zhang Q BMC Genomics; 2024 Mar; 25(1):266. PubMed ID: 38461245 [TBL] [Abstract][Full Text] [Related]
34. 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]
35. 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]
36. High Net Information Density DNA Data Storage by the MOPE Encoding Algorithm. Zheng Y; Cao B; Wu J; Wang B; Zhang Q IEEE/ACM Trans Comput Biol Bioinform; 2023; 20(5):2992-3000. PubMed ID: 37015121 [TBL] [Abstract][Full Text] [Related]
37. Iterative Soft Decoding Algorithm for DNA Storage Using Quality Score and Redecoding. Jeong J; Park H; Kwak HY; No JS; Jeon H; Lee JW; Kim JW IEEE Trans Nanobioscience; 2024 Jan; 23(1):81-90. PubMed ID: 37294652 [TBL] [Abstract][Full Text] [Related]
38. 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]
39. 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]
40. Lossless indexing with counting de Bruijn graphs. Karasikov M; Mustafa H; Rätsch G; Kahles A Genome Res; 2022 Sep; 32(9):1754-1764. PubMed ID: 35609994 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]