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 *

113 related articles for article (PubMed ID: 32703211)

  • 21. Arioc: GPU-accelerated alignment of short bisulfite-treated reads.
    Wilton R; Li X; Feinberg AP; Szalay AS
    Bioinformatics; 2018 Aug; 34(15):2673-2675. PubMed ID: 29554207
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Short Read Alignment Based on Maximal Approximate Match Seeds.
    Quan W; Guan D; Quan G; Liu B; Wang Y
    Front Mol Biosci; 2020; 7():572934. PubMed ID: 33251246
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A simple refined DNA minimizer operator enables 2-fold faster computation.
    Pan C; Reinert K
    Bioinformatics; 2024 Feb; 40(2):. PubMed ID: 38269626
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Fast detection of maximal exact matches via fixed sampling of query K-mers and Bloom filtering of index K-mers.
    Liu Y; Zhang LY; Li J
    Bioinformatics; 2019 Nov; 35(22):4560-4567. PubMed ID: 30994891
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Fast read alignment with incorporation of known genomic variants.
    Guo H; Liu B; Guan D; Fu Y; Wang Y
    BMC Med Inform Decis Mak; 2019 Dec; 19(Suppl 6):265. PubMed ID: 31856811
    [TBL] [Abstract][Full Text] [Related]  

  • 26. A Long Fragment Aligner called ALFALFA.
    Vyverman M; Baets BD; Fack V; Dawyndt P
    BMC Bioinformatics; 2015 May; 16(1):159. PubMed ID: 25971785
    [TBL] [Abstract][Full Text] [Related]  

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

  • 28. Finding maximal exact matches in graphs.
    Rizzo N; Cáceres M; Mäkinen V
    Algorithms Mol Biol; 2024 Mar; 19(1):10. PubMed ID: 38468275
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Efficient computation of spaced seed hashing with block indexing.
    Girotto S; Comin M; Pizzi C
    BMC Bioinformatics; 2018 Nov; 19(Suppl 15):441. PubMed ID: 30497364
    [TBL] [Abstract][Full Text] [Related]  

  • 30. High speed BLASTN: an accelerated MegaBLAST search tool.
    Chen Y; Ye W; Zhang Y; Xu Y
    Nucleic Acids Res; 2015 Sep; 43(16):7762-8. PubMed ID: 26250111
    [TBL] [Abstract][Full Text] [Related]  

  • 31. LAMSA: fast split read alignment with long approximate matches.
    Liu B; Gao Y; Wang Y
    Bioinformatics; 2017 Jan; 33(2):192-201. PubMed ID: 27667793
    [TBL] [Abstract][Full Text] [Related]  

  • 32. MICA: A fast short-read aligner that takes full advantage of Many Integrated Core Architecture (MIC).
    Luo R; Cheung J; Wu E; Wang H; Chan SH; Law WC; He G; Yu C; Liu CM; Zhou D; Li Y; Li R; Wang J; Zhu X; Peng S; Lam TW
    BMC Bioinformatics; 2015; 16 Suppl 7(Suppl 7):S10. PubMed ID: 25952019
    [TBL] [Abstract][Full Text] [Related]  

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

  • 34. Aligner optimization increases accuracy and decreases compute times in multi-species sequence data.
    Robinson KM; Hawkins AS; Santana-Cruz I; Adkins RS; Shetty AC; Nagaraj S; Sadzewicz L; Tallon LJ; Rasko DA; Fraser CM; Mahurkar A; Silva JC; Dunning Hotopp JC
    Microb Genom; 2017 Sep; 3(9):e000122. PubMed ID: 29114401
    [TBL] [Abstract][Full Text] [Related]  

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

  • 36. Rapid and precise alignment of raw reads against redundant databases with KMA.
    Clausen PTLC; Aarestrup FM; Lund O
    BMC Bioinformatics; 2018 Aug; 19(1):307. PubMed ID: 30157759
    [TBL] [Abstract][Full Text] [Related]  

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

  • 38. Fast and efficient short read mapping based on a succinct hash index.
    Zhang H; Chan Y; Fan K; Schmidt B; Liu W
    BMC Bioinformatics; 2018 Mar; 19(1):92. PubMed ID: 29523083
    [TBL] [Abstract][Full Text] [Related]  

  • 39. E-MEM: efficient computation of maximal exact matches for very large genomes.
    Khiste N; Ilie L
    Bioinformatics; 2015 Feb; 31(4):509-14. PubMed ID: 25399029
    [TBL] [Abstract][Full Text] [Related]  

  • 40. BatMis: a fast algorithm for k-mismatch mapping.
    Tennakoon C; Purbojati RW; Sung WK
    Bioinformatics; 2012 Aug; 28(16):2122-8. PubMed ID: 22689389
    [TBL] [Abstract][Full Text] [Related]  

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