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)

  • 21. Strobealign: flexible seed size enables ultra-fast and accurate read alignment.
    Sahlin K
    Genome Biol; 2022 Dec; 23(1):260. PubMed ID: 36522758
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Syncmers are more sensitive than minimizers for selecting conserved
    Edgar R
    PeerJ; 2021; 9():e10805. PubMed ID: 33604186
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A fast, lock-free approach for efficient parallel counting of occurrences of k-mers.
    Marçais G; Kingsford C
    Bioinformatics; 2011 Mar; 27(6):764-70. PubMed ID: 21217122
    [TBL] [Abstract][Full Text] [Related]  

  • 24. An efficient error correction algorithm using FM-index.
    Huang YT; Huang YW
    BMC Bioinformatics; 2017 Nov; 18(1):524. PubMed ID: 29179672
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Coverage-preserving sparsification of overlap graphs for long-read assembly.
    Jain C
    Bioinformatics; 2023 Mar; 39(3):. PubMed ID: 36892439
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Apollo: a sequencing-technology-independent, scalable and accurate assembly polishing algorithm.
    Firtina C; Kim JS; Alser M; Senol Cali D; Cicek AE; Alkan C; Mutlu O
    Bioinformatics; 2020 Jun; 36(12):3669-3679. PubMed ID: 32167530
    [TBL] [Abstract][Full Text] [Related]  

  • 27. EDAR: an efficient error detection and removal algorithm for next generation sequencing data.
    Zhao X; Palmer LE; Bolanos R; Mircean C; Fasulo D; Wittenberg GM
    J Comput Biol; 2010 Nov; 17(11):1549-60. PubMed ID: 20973743
    [TBL] [Abstract][Full Text] [Related]  

  • 28. smsMap: mapping single molecule sequencing reads by locating the alignment starting positions.
    Wei ZG; Zhang SW; Liu F
    BMC Bioinformatics; 2020 Aug; 21(1):341. PubMed ID: 32753028
    [TBL] [Abstract][Full Text] [Related]  

  • 29. YOABS: yet other aligner of biological sequences--an efficient linearly scaling nucleotide aligner.
    Galinsky VL
    Bioinformatics; 2012 Apr; 28(8):1070-7. PubMed ID: 22402614
    [TBL] [Abstract][Full Text] [Related]  

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

  • 31. MaxSSmap: a GPU program for mapping divergent short reads to genomes with the maximum scoring subsequence.
    Turki T; Roshan U
    BMC Genomics; 2014 Nov; 15(1):969. PubMed ID: 25398475
    [TBL] [Abstract][Full Text] [Related]  

  • 32. A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.
    Dinh H; Rajasekaran S
    Bioinformatics; 2011 Jul; 27(14):1901-7. PubMed ID: 21636593
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Reducing storage requirements for biological sequence comparison.
    Roberts M; Hayes W; Hunt BR; Mount SM; Yorke JA
    Bioinformatics; 2004 Dec; 20(18):3363-9. PubMed ID: 15256412
    [TBL] [Abstract][Full Text] [Related]  

  • 34. ARYANA: Aligning Reads by Yet Another Approach.
    Gholami M; Arbabi A; Sharifi-Zarchi A; Chitsaz H; Sadeghi M
    BMC Bioinformatics; 2014; 15 Suppl 9(Suppl 9):S12. PubMed ID: 25252881
    [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. CARE: context-aware sequencing read error correction.
    Kallenborn F; Hildebrandt A; Schmidt B
    Bioinformatics; 2021 May; 37(7):889-895. PubMed ID: 32818262
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Genome comparison without alignment using shortest unique substrings.
    Haubold B; Pierstorff N; Möller F; Wiehe T
    BMC Bioinformatics; 2005 May; 6():123. PubMed ID: 15910684
    [TBL] [Abstract][Full Text] [Related]  

  • 39. A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays.
    Khan Z; Bloom JS; Kruglyak L; Singh M
    Bioinformatics; 2009 Jul; 25(13):1609-16. PubMed ID: 19389736
    [TBL] [Abstract][Full Text] [Related]  

  • 40. CHTKC: a robust and efficient k-mer counting algorithm based on a lock-free chaining hash table.
    Wang J; Chen S; Dong L; Wang G
    Brief Bioinform; 2021 May; 22(3):. PubMed ID: 32438416
    [TBL] [Abstract][Full Text] [Related]  

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