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 *

161 related articles for article (PubMed ID: 33662682)

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

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

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

  • 4. A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol.
    Zeng P; Tan Q; Meng X; Shao Z; Xie Q; Yan Y; Cao W; Xu J
    PLoS One; 2017; 12(4):e0175500. PubMed ID: 28399157
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Fast exact string pattern-matching algorithms adapted to the characteristics of the medical language.
    Lovis C; Baud RH
    J Am Med Inform Assoc; 2000; 7(4):378-91. PubMed ID: 10887166
    [TBL] [Abstract][Full Text] [Related]  

  • 6. String graph construction using incremental hashing.
    Ben-Bassat I; Chor B
    Bioinformatics; 2014 Dec; 30(24):3515-23. PubMed ID: 25183486
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Fast randomized approximate string matching with succinct hash data structures.
    Policriti A; Prezza N
    BMC Bioinformatics; 2015; 16 Suppl 9(Suppl 9):S4. PubMed ID: 26051265
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Robust hashing with local models for approximate similarity search.
    Song J; Yang Y; Li X; Huang Z; Yang Y
    IEEE Trans Cybern; 2014 Jul; 44(7):1225-36. PubMed ID: 24951547
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Query-Adaptive Reciprocal Hash Tables for Nearest Neighbor Search.
    Liu X; Deng C; Lang B; Tao D; Li X
    IEEE Trans Image Process; 2016 Feb; 25(2):907-19. PubMed ID: 26661297
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Entropy-Based Approach in Selection Exact String-Matching Algorithms.
    Markić I; Štula M; Zorić M; Stipaničev D
    Entropy (Basel); 2020 Dec; 23(1):. PubMed ID: 33379282
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Hierarchical Recurrent Neural Hashing for Image Retrieval With Hierarchical Convolutional Features.
    Lu X; Chen Y; Li X
    IEEE Trans Image Process; 2018 Jan.; 27(1):106-120. PubMed ID: 28952940
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Encoded expansion: an efficient algorithm to discover identical string motifs.
    Azmi AM; Al-Ssulami A
    PLoS One; 2014; 9(5):e95148. PubMed ID: 24871320
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Fast algorithms for approximate circular string matching.
    Barton C; Iliopoulos CS; Pissis SP
    Algorithms Mol Biol; 2014 Mar; 9(1):9. PubMed ID: 24656145
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. FASTPAT: a fast and efficient algorithm for string searching in DNA sequences.
    Prunella N; Liuni S; Attimonelli M; Pesole G
    Comput Appl Biosci; 1993 Oct; 9(5):541-5. PubMed ID: 8293327
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations.
    Ho T; Oh SR; Kim H
    PLoS One; 2017; 12(10):e0186251. PubMed ID: 29016700
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Identification of all-against-all protein-protein interactions based on deep hash learning.
    Jiang Y; Wang Y; Shen L; Adjeroh DA; Liu Z; Lin J
    BMC Bioinformatics; 2022 Jul; 23(1):266. PubMed ID: 35804303
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Triplet Deep Hashing with Joint Supervised Loss Based on Deep Neural Networks.
    Li M; An Z; Wei Q; Xiang K; Ma Y
    Comput Intell Neurosci; 2019; 2019():8490364. PubMed ID: 31687007
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A new split based searching for exact pattern matching for natural texts.
    Hakak S; Kamsin A; Shivakumara P; Idna Idris MY; Gilkar GA
    PLoS One; 2018; 13(7):e0200912. PubMed ID: 30048486
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.