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 *

196 related articles for article (PubMed ID: 30011247)

  • 1. Dynamic Alignment-Free and Reference-Free Read Compression.
    Holley G; Wittler R; Stoye J; Hach F
    J Comput Biol; 2018 Jul; 25(7):825-836. PubMed ID: 30011247
    [TBL] [Abstract][Full Text] [Related]  

  • 2. SCALCE: boosting sequence compression algorithms using locally consistent encoding.
    Hach F; Numanagic I; Alkan C; Sahinalp SC
    Bioinformatics; 2012 Dec; 28(23):3051-7. PubMed ID: 23047557
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Reference-based compression of short-read sequences using path encoding.
    Kingsford C; Patro R
    Bioinformatics; 2015 Jun; 31(12):1920-8. PubMed ID: 25649622
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Reference-free compression of high throughput sequencing data with a probabilistic de Bruijn graph.
    Benoit G; Lemaitre C; Lavenier D; Drezen E; Dayris T; Uricaru R; Rizk G
    BMC Bioinformatics; 2015 Sep; 16():288. PubMed ID: 26370285
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Data structures and compression algorithms for high-throughput sequencing technologies.
    Daily K; Rigor P; Christley S; Xie X; Baldi P
    BMC Bioinformatics; 2010 Oct; 11():514. PubMed ID: 20946637
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage.
    Holley G; Wittler R; Stoye J
    Algorithms Mol Biol; 2016; 11():3. PubMed ID: 27087830
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Optimal compressed representation of high throughput sequence data via light assembly.
    Ginart AA; Hui J; Zhu K; Numanagić I; Courtade TA; Sahinalp SC; Tse DN
    Nat Commun; 2018 Feb; 9(1):566. PubMed ID: 29422526
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Compressive biological sequence analysis and archival in the era of high-throughput sequencing technologies.
    Giancarlo R; Rombo SE; Utro F
    Brief Bioinform; 2014 May; 15(3):390-406. PubMed ID: 24347576
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Advances in high throughput DNA sequence data compression.
    Sardaraz M; Tahir M; Ikram AA
    J Bioinform Comput Biol; 2016 Jun; 14(3):1630002. PubMed ID: 26846812
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Efficient storage of high throughput DNA sequencing data using reference-based compression.
    Hsi-Yang Fritz M; Leinonen R; Cochrane G; Birney E
    Genome Res; 2011 May; 21(5):734-40. PubMed ID: 21245279
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Data-dependent bucketing improves reference-free compression of sequencing reads.
    Patro R; Kingsford C
    Bioinformatics; 2015 Sep; 31(17):2770-7. PubMed ID: 25910696
    [TBL] [Abstract][Full Text] [Related]  

  • 12. BdBG: a bucket-based method for compressing genome sequencing data with dynamic de Bruijn graphs.
    Wang R; Li J; Bai Y; Zang T; Wang Y
    PeerJ; 2018; 6():e5611. PubMed ID: 30364599
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Sketch distance-based clustering of chromosomes for large genome database compression.
    Tang T; Liu Y; Zhang B; Su B; Li J
    BMC Genomics; 2019 Dec; 20(Suppl 10):978. PubMed ID: 31888458
    [TBL] [Abstract][Full Text] [Related]  

  • 15. NeatFreq: reference-free data reduction and coverage normalization for De Novo sequence assembly.
    McCorrison JM; Venepally P; Singh I; Fouts DE; Lasken RS; Methé BA
    BMC Bioinformatics; 2014 Nov; 15(1):357. PubMed ID: 25407910
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Compression of genomic sequencing reads via hash-based reordering: algorithm and analysis.
    Chandak S; Tatwawadi K; Weissman T
    Bioinformatics; 2018 Feb; 34(4):558-567. PubMed ID: 29444237
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Pangenome Graphs.
    Eizenga JM; Novak AM; Sibbesen JA; Heumos S; Ghaffaari A; Hickey G; Chang X; Seaman JD; Rounthwaite R; Ebler J; Rautiainen M; Garg S; Paten B; Marschall T; Sirén J; Garrison E
    Annu Rev Genomics Hum Genet; 2020 Aug; 21():139-162. PubMed ID: 32453966
    [TBL] [Abstract][Full Text] [Related]  

  • 18. AFRESh: an adaptive framework for compression of reads and assembled sequences with random access functionality.
    Paridaens T; Van Wallendael G; De Neve W; Lambert P
    Bioinformatics; 2017 May; 33(10):1464-1472. PubMed ID: 28057687
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Sparse Binary Relation Representations for Genome Graph Annotation.
    Karasikov M; Mustafa H; Joudaki A; Javadzadeh-No S; Rätsch G; Kahles A
    J Comput Biol; 2020 Apr; 27(4):626-639. PubMed ID: 31891531
    [TBL] [Abstract][Full Text] [Related]  

  • 20. deBGA: read alignment with de Bruijn graph-based seed and extension.
    Liu B; Guo H; Brudno M; Wang Y
    Bioinformatics; 2016 Nov; 32(21):3224-3232. PubMed ID: 27378303
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.