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.
202 related articles for article (PubMed ID: 36450127)
41. Revisiting the Complexity of and Algorithms for the Graph Traversal Edit Distance and Its Variants. Qiu Y; Shen Y; Kingsford C ArXiv; 2023 Nov; ():. PubMed ID: 37292475 [TBL] [Abstract][Full Text] [Related]
42. 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]
43. Using 2kâ+â2 bubble searches to find single nucleotide polymorphisms in k-mer graphs. Younsi R; MacLean D Bioinformatics; 2015 Mar; 31(5):642-6. PubMed ID: 25344498 [TBL] [Abstract][Full Text] [Related]
44. Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Zerbino DR; Birney E Genome Res; 2008 May; 18(5):821-9. PubMed ID: 18349386 [TBL] [Abstract][Full Text] [Related]
50. TraRECo: a greedy approach based de novo transcriptome assembler with read error correction using consensus matrix. Yoon S; Kim D; Kang K; Park WJ BMC Genomics; 2018 Sep; 19(1):653. PubMed ID: 30180798 [TBL] [Abstract][Full Text] [Related]
51. 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]
52. What is the difference between the breakpoint graph and the de Bruijn graph? Lin Y; Nurk S; Pevzner PA BMC Genomics; 2014; 15 Suppl 6(Suppl 6):S6. PubMed ID: 25572416 [TBL] [Abstract][Full Text] [Related]
53. 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]
54. De Bruijn Superwalk with Multiplicities Problem is NP-hard. Kapun E; Tsarev F BMC Bioinformatics; 2013; 14 Suppl 5(Suppl 5):S7. PubMed ID: 23734822 [TBL] [Abstract][Full Text] [Related]
55. Improved Node and Arc Multiplicity Estimation in De Bruijn Graphs Using Approximate Inference in Conditional Random Fields. Steyaert A; Audenaert P; Fostier J IEEE/ACM Trans Comput Biol Bioinform; 2023; 20(3):1995-2006. PubMed ID: 37015543 [TBL] [Abstract][Full Text] [Related]
56. 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]
57. Compression algorithm for colored de Bruijn graphs. Rahman A; Dufresne Y; Medvedev P Algorithms Mol Biol; 2024 May; 19(1):20. PubMed ID: 38797858 [TBL] [Abstract][Full Text] [Related]
58. A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. Beller T; Ohlebusch E Algorithms Mol Biol; 2016; 11():20. PubMed ID: 27437028 [TBL] [Abstract][Full Text] [Related]
59. 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]
60. A memory-efficient algorithm to obtain splicing graphs and de novo expression estimates from de Bruijn graphs of RNA-Seq data. Sze SH; Tarone AM BMC Genomics; 2014; 15 Suppl 5(Suppl 5):S6. PubMed ID: 25082000 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]