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 *

136 related articles for article (PubMed ID: 36120669)

  • 1. Lightweight Pattern Matching Method for DNA Sequencing in Internet of Medical Things.
    Rexie JAM; Raimond K; Murugaaboopathy M; Brindha D; Mulugeta H
    Comput Intell Neurosci; 2022; 2022():6980335. PubMed ID: 36120669
    [TBL] [Abstract][Full Text] [Related]  

  • 2. On the Hardness of Sequence Alignment on De Bruijn Graphs.
    Gibney D; Thankachan SV; Aluru S
    J Comput Biol; 2022 Dec; 29(12):1377-1396. PubMed ID: 36450127
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Ψ-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]  

  • 4. A fast Boyer-Moore type pattern matching algorithm for highly similar sequences.
    Ben Nsira N; Lecroq T; Elloumi M
    Int J Data Min Bioinform; 2015; 13(3):266-88. PubMed ID: 26547980
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Improving hash-q exact string matching algorithm with perfect hashing for DNA sequences.
    Karcioglu AA; Bulut H
    Comput Biol Med; 2021 Apr; 131():104292. PubMed ID: 33662682
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A Simple, Fast, Filter-Based Algorithm for Approximate Circular Pattern Matching.
    Azim MA; Iliopoulos CS; Rahman MS; Samiruzzaman M
    IEEE Trans Nanobioscience; 2016 Mar; 15(2):93-100. PubMed ID: 26992174
    [TBL] [Abstract][Full Text] [Related]  

  • 7. libFLASM: a software library for fixed-length approximate string matching.
    Ayad LA; Pissis SP; Retha A
    BMC Bioinformatics; 2016 Nov; 17(1):454. PubMed ID: 27832739
    [TBL] [Abstract][Full Text] [Related]  

  • 8. The 3of5 web application for complex and comprehensive pattern matching in protein sequences.
    Seiler M; Mehrle A; Poustka A; Wiemann S
    BMC Bioinformatics; 2006 Mar; 7():144. PubMed ID: 16542452
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Next generation sequencing reads comparison with an alignment-free distance.
    Weitschek E; Santoni D; Fiscon G; De Cola MC; Bertolazzi P; Felici G
    BMC Res Notes; 2014 Dec; 7():869. PubMed ID: 25465386
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Compressed pattern matching in DNA sequences.
    Chen L; Lu S; Ram J
    Proc IEEE Comput Syst Bioinform Conf; 2004; ():62-8. PubMed ID: 16448000
    [TBL] [Abstract][Full Text] [Related]  

  • 11. The WM-q multiple exact string matching algorithm for DNA sequences.
    Karcioglu AA; Bulut H
    Comput Biol Med; 2021 Sep; 136():104656. PubMed ID: 34333228
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Perfect Hamming code with a hash table for faster genome mapping.
    Takenaka Y; Seno S; Matsuda H
    BMC Genomics; 2011 Nov; 12 Suppl 3(Suppl 3):S8. PubMed ID: 22369457
    [TBL] [Abstract][Full Text] [Related]  

  • 13. SlideSort: all pairs similarity search for short reads.
    Shimizu K; Tsuda K
    Bioinformatics; 2011 Feb; 27(4):464-70. PubMed ID: 21148542
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A bit-parallel dynamic programming algorithm suitable for DNA sequence alignment.
    Kimura K; Koike A; Nakai K
    J Bioinform Comput Biol; 2012 Aug; 10(4):1250002. PubMed ID: 22809415
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Sequence alignment by cross-correlation.
    Rockwood AL; Crockett DK; Oliphant JR; Elenitoba-Johnson KS
    J Biomol Tech; 2005 Dec; 16(4):453-8. PubMed ID: 16522868
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. A pattern matching approach for the estimation of alignment between any two given DNA sequences.
    Basu K; Sriraam N; Richard RJ
    J Med Syst; 2007 Aug; 31(4):247-53. PubMed ID: 17685148
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Fast discovery and visualization of conserved regions in DNA sequences using quasi-alignment.
    Nagar A; Hahsler M
    BMC Bioinformatics; 2013; 14 Suppl 11(Suppl 11):S2. PubMed ID: 24564200
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An approximate matching algorithm for finding (sub-)optimal sequences in S-attributed grammars.
    Waldispühl J; Behzadi B; Steyaert JM
    Bioinformatics; 2002; 18 Suppl 2():S250-9. PubMed ID: 12386010
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.