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.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

185 related articles for article (PubMed ID: 24152242)

  • 21. Minimizer-space de Bruijn graphs: Whole-genome assembly of long reads in minutes on a personal computer.
    Ekim B; Berger B; Chikhi R
    Cell Syst; 2021 Oct; 12(10):958-968.e6. PubMed ID: 34525345
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Querying large read collections in main memory: a versatile data structure.
    Philippe N; Salson M; Lecroq T; Léonard M; Commes T; Rivals E
    BMC Bioinformatics; 2011 Jun; 12():242. PubMed ID: 21682852
    [TBL] [Abstract][Full Text] [Related]  

  • 23. 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]  

  • 24. 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]  

  • 25. 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]  

  • 26. 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]  

  • 27. 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]  

  • 28. 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]  

  • 29. StLiter: A Novel Algorithm to Iteratively Build the Compacted de Bruijn Graph From Many Complete Genomes.
    Yu C; Mao K; Zhao Y; Chang C; Wang G
    IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(4):2471-2483. PubMed ID: 33630738
    [TBL] [Abstract][Full Text] [Related]  

  • 30. 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]  

  • 31. A hybrid and scalable error correction algorithm for indel and substitution errors of long reads.
    Das AK; Goswami S; Lee K; Park SJ
    BMC Genomics; 2019 Dec; 20(Suppl 11):948. PubMed ID: 31856721
    [TBL] [Abstract][Full Text] [Related]  

  • 32. 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]  

  • 33. Variable-order reference-free variant discovery with the Burrows-Wheeler Transform.
    Prezza N; Pisanti N; Sciortino M; Rosone G
    BMC Bioinformatics; 2020 Sep; 21(Suppl 8):260. PubMed ID: 32938358
    [TBL] [Abstract][Full Text] [Related]  

  • 34. String graph construction using incremental hashing.
    Ben-Bassat I; Chor B
    Bioinformatics; 2014 Dec; 30(24):3515-23. PubMed ID: 25183486
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Representation of
    Rahman A; Medevedev P
    J Comput Biol; 2021 Apr; 28(4):381-394. PubMed ID: 33290137
    [No Abstract]   [Full Text] [Related]  

  • 36. Scaling metagenome sequence assembly with probabilistic de Bruijn graphs.
    Pell J; Hintze A; Canino-Koning R; Howe A; Tiedje JM; Brown CT
    Proc Natl Acad Sci U S A; 2012 Aug; 109(33):13272-7. PubMed ID: 22847406
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Optimization of de novo transcriptome assembly from high-throughput short read sequencing data improves functional annotation for non-model organisms.
    Haznedaroglu BZ; Reeves D; Rismani-Yazdi H; Peccia J
    BMC Bioinformatics; 2012 Jul; 13():170. PubMed ID: 22808927
    [TBL] [Abstract][Full Text] [Related]  

  • 38. FSG: Fast String Graph Construction for De Novo Assembly.
    Bonizzoni P; Vedova GD; Pirola Y; Previtali M; Rizzi R
    J Comput Biol; 2017 Oct; 24(10):953-968. PubMed ID: 28715269
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Accurate self-correction of errors in long reads using de Bruijn graphs.
    Salmela L; Walve R; Rivals E; Ukkonen E
    Bioinformatics; 2017 Mar; 33(6):799-806. PubMed ID: 27273673
    [TBL] [Abstract][Full Text] [Related]  

  • 40. 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]  

    [Previous]   [Next]    [New Search]
    of 10.