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 *

203 related articles for article (PubMed ID: 35134833)

  • 21. PERF: an exhaustive algorithm for ultra-fast and efficient identification of microsatellites from large DNA sequences.
    Avvaru AK; Sowpati DT; Mishra RK
    Bioinformatics; 2018 Mar; 34(6):943-948. PubMed ID: 29121165
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 24. BinDash, software for fast genome distance estimation on a typical personal laptop.
    Zhao X
    Bioinformatics; 2019 Feb; 35(4):671-673. PubMed ID: 30052763
    [TBL] [Abstract][Full Text] [Related]  

  • 25. chainCleaner improves genome alignment specificity and sensitivity.
    Suarez HG; Langer BE; Ladde P; Hiller M
    Bioinformatics; 2017 Jun; 33(11):1596-1603. PubMed ID: 28108446
    [TBL] [Abstract][Full Text] [Related]  

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

  • 27. deBWT: parallel construction of Burrows-Wheeler Transform for large collection of genomes with de Bruijn-branch encoding.
    Liu B; Zhu D; Wang Y
    Bioinformatics; 2016 Jun; 32(12):i174-i182. PubMed ID: 27307614
    [TBL] [Abstract][Full Text] [Related]  

  • 28. SOPanG: online text searching over a pan-genome.
    Cislak A; Grabowski S; Holub J
    Bioinformatics; 2018 Dec; 34(24):4290-4292. PubMed ID: 29939210
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Fast de Bruijn Graph Compaction in Distributed Memory Environments.
    Pan T; Nihalani R; Aluru S
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(1):136-148. PubMed ID: 30072337
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Phylonium: fast estimation of evolutionary distances from large samples of similar genomes.
    Klötzl F; Haubold B
    Bioinformatics; 2020 Apr; 36(7):2040-2046. PubMed ID: 31790149
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Sequence tube maps: making graph genomes intuitive to commuters.
    Beyer W; Novak AM; Hickey G; Chan J; Tan V; Paten B; Zerbino DR
    Bioinformatics; 2019 Dec; 35(24):5318-5320. PubMed ID: 31368484
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 34. Shouji: a fast and efficient pre-alignment filter for sequence alignment.
    Alser M; Hassan H; Kumar A; Mutlu O; Alkan C
    Bioinformatics; 2019 Nov; 35(21):4255-4263. PubMed ID: 30923804
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Ψ-RA: a parallel sparse index for genomic read alignment.
    Oğuzhan Külekci M; Hon WK; Shah R; Scott Vitter J; Xu B
    BMC Genomics; 2011; 12 Suppl 2(Suppl 2):S7. PubMed ID: 21989248
    [TBL] [Abstract][Full Text] [Related]  

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

  • 37. Optimal gap-affine alignment in O(s) space.
    Marco-Sola S; Eizenga JM; Guarracino A; Paten B; Garrison E; Moreto M
    Bioinformatics; 2023 Feb; 39(2):. PubMed ID: 36749013
    [TBL] [Abstract][Full Text] [Related]  

  • 38. A fast and memory efficient MLCS algorithm by character merging for DNA sequences alignment.
    Liu S; Wang Y; Tong W; Wei S
    Bioinformatics; 2020 Feb; 36(4):1066-1073. PubMed ID: 31584616
    [TBL] [Abstract][Full Text] [Related]  

  • 39. A spectral algorithm for fast de novo layout of uncorrected long nanopore reads.
    Recanati A; Brüls T; d'Aspremont A
    Bioinformatics; 2017 Oct; 33(20):3188-3194. PubMed ID: 28605450
    [TBL] [Abstract][Full Text] [Related]  

  • 40. BGSA: a bit-parallel global sequence alignment toolkit for multi-core and many-core architectures.
    Zhang J; Lan H; Chan Y; Shang Y; Schmidt B; Liu W
    Bioinformatics; 2019 Jul; 35(13):2306-2308. PubMed ID: 30445566
    [TBL] [Abstract][Full Text] [Related]  

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