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 *

108 related articles for article (PubMed ID: 31004473)

  • 1. A framework for space-efficient variable-order Markov models.
    Cunial F; Alanko J; Belazzougui D
    Bioinformatics; 2019 Nov; 35(22):4607-4616. PubMed ID: 31004473
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Higher-order Markov models for metagenomic sequence classification.
    Burks DJ; Azad RK
    Bioinformatics; 2020 Aug; 36(14):4130-4136. PubMed ID: 32516355
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Fast and compact matching statistics analytics.
    Cunial F; Denas O; Belazzougui D
    Bioinformatics; 2022 Mar; 38(7):1838-1845. PubMed ID: 35134833
    [TBL] [Abstract][Full Text] [Related]  

  • 5. FMtree: a fast locating algorithm of FM-indexes for genomic data.
    Cheng H; Wu M; Xu Y
    Bioinformatics; 2018 Feb; 34(3):416-424. PubMed ID: 28968761
    [TBL] [Abstract][Full Text] [Related]  

  • 6. emMAW: computing minimal absent words in external memory.
    Héliou A; Pissis SP; Puglisi SJ
    Bioinformatics; 2017 Sep; 33(17):2746-2749. PubMed ID: 28407038
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Sapling: accelerating suffix array queries with learned data models.
    Kirsche M; Das A; Schatz MC
    Bioinformatics; 2021 May; 37(6):744-749. PubMed ID: 33107913
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Index suffix-prefix overlaps by (w, k)-minimizer to generate long contigs for reads compression.
    Liu Y; Yu Z; Dinger ME; Li J
    Bioinformatics; 2019 Jun; 35(12):2066-2074. PubMed ID: 30407482
    [TBL] [Abstract][Full Text] [Related]  

  • 9. slaMEM: efficient retrieval of maximal exact matches using a sampled LCP array.
    Fernandes F; Freitas AT
    Bioinformatics; 2014 Feb; 30(4):464-71. PubMed ID: 24336412
    [TBL] [Abstract][Full Text] [Related]  

  • 10. FactorialHMM: fast and exact inference in factorial hidden Markov models.
    Schweiger R; Erlich Y; Carmi S
    Bioinformatics; 2019 Jun; 35(12):2162-2164. PubMed ID: 30445428
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Probabilistic suffix array: efficient modeling and prediction of protein families.
    Lin J; Adjeroh D; Jiang BH
    Bioinformatics; 2012 May; 28(10):1314-23. PubMed ID: 22522137
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Breaking the
    Kempa D; Kociumaka T
    Proc Annu ACM SIAM Symp Discret Algorithms; 2023; 2023():5122-5202. PubMed ID: 38835617
    [TBL] [Abstract][Full Text] [Related]  

  • 13. High efficiency referential genome compression algorithm.
    Shi W; Chen J; Luo M; Chen M
    Bioinformatics; 2019 Jun; 35(12):2058-2065. PubMed ID: 30407493
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Efficient Construction and Utilization of k-Ordered FM-indexes with kISS for Ultra-Fast Read Mapping in Large Genomes.
    Yang ZD; Kuo HY; Hsieh PW; Hung JH
    Bioinformatics; 2024 Jun; ():. PubMed ID: 38897667
    [TBL] [Abstract][Full Text] [Related]  

  • 15. sBWT: memory efficient implementation of the hardware-acceleration-friendly Schindler transform for the fast biological sequence mapping.
    Chang CH; Chou MT; Wu YC; Hong TW; Li YL; Yang CH; Hung JH
    Bioinformatics; 2016 Nov; 32(22):3498-3500. PubMed ID: 27412087
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Two C++ libraries for counting trees on a phylogenetic terrace.
    Biczok R; Bozsoky P; Eisenmann P; Ernst J; Ribizel T; Scholz F; Trefzer A; Weber F; Hamann M; Stamatakis A
    Bioinformatics; 2018 Oct; 34(19):3399-3401. PubMed ID: 29746618
    [TBL] [Abstract][Full Text] [Related]  

  • 17. KCMBT: a k-mer Counter based on Multiple Burst Trees.
    Mamun AA; Pal S; Rajasekaran S
    Bioinformatics; 2016 Sep; 32(18):2783-90. PubMed ID: 27283950
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Hammock: a hidden Markov model-based peptide clustering algorithm to identify protein-interaction consensus motifs in large datasets.
    Krejci A; Hupp TR; Lexa M; Vojtesek B; Muller P
    Bioinformatics; 2016 Jan; 32(1):9-16. PubMed ID: 26342231
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Fast motif matching revisited: high-order PWMs, SNPs and indels.
    Korhonen JH; Palin K; Taipale J; Ukkonen E
    Bioinformatics; 2017 Feb; 33(4):514-521. PubMed ID: 28011774
    [TBL] [Abstract][Full Text] [Related]  

  • 20. State aggregation for fast likelihood computations in molecular evolution.
    Davydov II; Robinson-Rechavi M; Salamin N
    Bioinformatics; 2017 Feb; 33(3):354-362. PubMed ID: 28172542
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.