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 *

163 related articles for article (PubMed ID: 24564333)

  • 1. An efficient and scalable graph modeling approach for capturing information at different levels in next generation sequencing reads.
    Warnke JD; Ali HH
    BMC Bioinformatics; 2013; 14 Suppl 11(Suppl 11):S7. PubMed ID: 24564333
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Graph mining for next generation sequencing: leveraging the assembly graph for biological insights.
    Warnke-Sommer J; Ali H
    BMC Genomics; 2016 May; 17():340. PubMed ID: 27154001
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Improving the sensitivity of long read overlap detection using grouped short k-mer matches.
    Du N; Chen J; Sun Y
    BMC Genomics; 2019 Apr; 20(Suppl 2):190. PubMed ID: 30967123
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Information-optimal genome assembly via sparse read-overlap graphs.
    Shomorony I; Kim SH; Courtade TA; Tse DN
    Bioinformatics; 2016 Sep; 32(17):i494-i502. PubMed ID: 27587667
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. OGRE: Overlap Graph-based metagenomic Read clustEring.
    Balvert M; Luo X; Hauptfeld E; Schönhuth A; Dutilh BE
    Bioinformatics; 2021 May; 37(7):905-912. PubMed ID: 32871010
    [TBL] [Abstract][Full Text] [Related]  

  • 7. SeedsGraph: an efficient assembler for next-generation sequencing data.
    Wang C; Guo M; Liu X; Liu Y; Zou Q
    BMC Med Genomics; 2015; 8 Suppl 2(Suppl 2):S13. PubMed ID: 26044652
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. ClassGraph: Improving Metagenomic Read Classification with Overlap Graphs.
    Cavattoni M; Comin M
    J Comput Biol; 2023 Jun; 30(6):633-647. PubMed ID: 37023405
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. EC: an efficient error correction algorithm for short reads.
    Saha S; Rajasekaran S
    BMC Bioinformatics; 2015; 16 Suppl 17(Suppl 17):S2. PubMed ID: 26678663
    [TBL] [Abstract][Full Text] [Related]  

  • 12. EasyCluster2: an improved tool for clustering and assembling long transcriptome reads.
    Bevilacqua V; Pietroleonardo N; Giannino E; Stroppa F; Simone D; Pesole G; Picardi E
    BMC Bioinformatics; 2014; 15 Suppl 15(Suppl 15):S7. PubMed ID: 25474441
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Alignment-free clustering of UMI tagged DNA molecules.
    Orabi B; Erhan E; McConeghy B; Volik SV; Le Bihan S; Bell R; Collins CC; Chauve C; Hach F
    Bioinformatics; 2019 Jun; 35(11):1829-1836. PubMed ID: 30351359
    [TBL] [Abstract][Full Text] [Related]  

  • 14. RResolver: efficient short-read repeat resolution within ABySS.
    Nikolić V; Afshinfard A; Chu J; Wong J; Coombe L; Nip KM; Warren RL; Birol I
    BMC Bioinformatics; 2022 Jun; 23(1):246. PubMed ID: 35729491
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Coverage-preserving sparsification of overlap graphs for long-read assembly.
    Jain C
    Bioinformatics; 2023 Mar; 39(3):. PubMed ID: 36892439
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. LightAssembler: fast and memory-efficient assembly algorithm for high-throughput sequencing reads.
    El-Metwally S; Zakaria M; Hamza T
    Bioinformatics; 2016 Nov; 32(21):3215-3223. PubMed ID: 27412092
    [TBL] [Abstract][Full Text] [Related]  

  • 18. QColors: an algorithm for conservative viral quasispecies reconstruction from short and non-contiguous next generation sequencing reads.
    Huang A; Kantor R; DeLong A; Schreier L; Istrail S
    In Silico Biol; 2011-2012; 11(5-6):193-201. PubMed ID: 23202421
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Pseudo-Sanger sequencing: massively parallel production of long and near error-free reads using NGS technology.
    Ruan J; Jiang L; Chong Z; Gong Q; Li H; Li C; Tao Y; Zheng C; Zhai W; Turissini D; Cannon CH; Lu X; Wu CI
    BMC Genomics; 2013 Oct; 14(1):711. PubMed ID: 24134808
    [TBL] [Abstract][Full Text] [Related]  

  • 20. METAMVGL: a multi-view graph-based metagenomic contig binning algorithm by integrating assembly and paired-end graphs.
    Zhang Z; Zhang L
    BMC Bioinformatics; 2021 Jul; 22(Suppl 10):378. PubMed ID: 34294039
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.