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 *

150 related articles for article (PubMed ID: 37387132)

  • 41. Bit-parallel sequence-to-graph alignment.
    Rautiainen M; Mäkinen V; Marschall T
    Bioinformatics; 2019 Oct; 35(19):3599-3607. PubMed ID: 30851095
    [TBL] [Abstract][Full Text] [Related]  

  • 42. An empirical study of choosing efficient discriminative seeds for oligonucleotide design.
    Chung WH; Park SB
    BMC Genomics; 2009 Dec; 10 Suppl 3(Suppl 3):S3. PubMed ID: 19958494
    [TBL] [Abstract][Full Text] [Related]  

  • 43. CoLoRMap: Correcting Long Reads by Mapping short reads.
    Haghshenas E; Hach F; Sahinalp SC; Chauve C
    Bioinformatics; 2016 Sep; 32(17):i545-i551. PubMed ID: 27587673
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Lerna: transformer architectures for configuring error correction tools for short- and long-read genome sequencing.
    Sharma A; Jain P; Mahgoub A; Zhou Z; Mahadik K; Chaterji S
    BMC Bioinformatics; 2022 Jan; 23(1):25. PubMed ID: 34991450
    [TBL] [Abstract][Full Text] [Related]  

  • 45. BrownieAligner: accurate alignment of Illumina sequencing data to de Bruijn graphs.
    Heydari M; Miclotte G; Van de Peer Y; Fostier J
    BMC Bioinformatics; 2018 Sep; 19(1):311. PubMed ID: 30180801
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Fully-sensitive seed finding in sequence graphs using a hybrid index.
    Ghaffaari A; Marschall T
    Bioinformatics; 2019 Jul; 35(14):i81-i89. PubMed ID: 31510650
    [TBL] [Abstract][Full Text] [Related]  

  • 47. A fast read alignment method based on seed-and-vote for next generation sequencing.
    Liu S; Wang Y; Wang F
    BMC Bioinformatics; 2016 Dec; 17(Suppl 17):466. PubMed ID: 28155631
    [TBL] [Abstract][Full Text] [Related]  

  • 48. Finding long tandem repeats in long noisy reads.
    Morishita S; Ichikawa K; Myers EW
    Bioinformatics; 2021 May; 37(5):612-621. PubMed ID: 33031558
    [TBL] [Abstract][Full Text] [Related]  

  • 49. NextPolish: a fast and efficient genome polishing tool for long-read assembly.
    Hu J; Fan J; Sun Z; Liu S
    Bioinformatics; 2020 Apr; 36(7):2253-2255. PubMed ID: 31778144
    [TBL] [Abstract][Full Text] [Related]  

  • 50. HISEA: HIerarchical SEed Aligner for PacBio data.
    Khiste N; Ilie L
    BMC Bioinformatics; 2017 Dec; 18(1):564. PubMed ID: 29258419
    [TBL] [Abstract][Full Text] [Related]  

  • 51. RepLong: de novo repeat identification using long read sequencing data.
    Guo R; Li YR; He S; Ou-Yang L; Sun Y; Zhu Z
    Bioinformatics; 2018 Apr; 34(7):1099-1107. PubMed ID: 29126180
    [TBL] [Abstract][Full Text] [Related]  

  • 52. A parallel algorithm for error correction in high-throughput short-read data on CUDA-enabled graphics hardware.
    Shi H; Schmidt B; Liu W; Müller-Wittig W
    J Comput Biol; 2010 Apr; 17(4):603-15. PubMed ID: 20426693
    [TBL] [Abstract][Full Text] [Related]  

  • 53. Entropy predicts sensitivity of pseudorandom seeds.
    Maier BD; Sahlin K
    Genome Res; 2023 Jul; 33(7):1162-1174. PubMed ID: 37217253
    [TBL] [Abstract][Full Text] [Related]  

  • 54. GateKeeper: a new hardware architecture for accelerating pre-alignment in DNA short read mapping.
    Alser M; Hassan H; Xin H; Ergin O; Mutlu O; Alkan C
    Bioinformatics; 2017 Nov; 33(21):3355-3363. PubMed ID: 28575161
    [TBL] [Abstract][Full Text] [Related]  

  • 55. QAlign: aligning nanopore reads accurately using current-level modeling.
    Joshi D; Mao S; Kannan S; Diggavi S
    Bioinformatics; 2021 May; 37(5):625-633. PubMed ID: 33051648
    [TBL] [Abstract][Full Text] [Related]  

  • 56. Repeat-aware modeling and correction of short read errors.
    Yang X; Aluru S; Dorman KS
    BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S52. PubMed ID: 21342585
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Efficient algorithms for Longest Common Subsequence of two bucket orders to speed up pairwise genetic map comparison.
    De Mattéo L; Holtz Y; Ranwez V; Bérard S
    PLoS One; 2018; 13(12):e0208838. PubMed ID: 30589848
    [TBL] [Abstract][Full Text] [Related]  

  • 58. BLEND: a fast, memory-efficient and accurate mechanism to find fuzzy seed matches in genome analysis.
    Firtina C; Park J; Alser M; Kim JS; Cali DS; Shahroodi T; Ghiasi NM; Singh G; Kanellopoulos K; Alkan C; Mutlu O
    NAR Genom Bioinform; 2023 Mar; 5(1):lqad004. PubMed ID: 36685727
    [TBL] [Abstract][Full Text] [Related]  

  • 59. A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem.
    Thankachan SV; Apostolico A; Aluru S
    J Comput Biol; 2016 Jun; 23(6):472-82. PubMed ID: 27058840
    [TBL] [Abstract][Full Text] [Related]  

  • 60. Mapping RNA-seq reads to transcriptomes efficiently based on learning to hash method.
    Yu X; Liu X
    Comput Biol Med; 2020 Jan; 116():103539. PubMed ID: 31765913
    [TBL] [Abstract][Full Text] [Related]  

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