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 *

142 related articles for article (PubMed ID: 31800307)

  • 21. A randomized optimal k-mer indexing approach for efficient parallel genome sequence compression.
    Roy S; Mukhopadhyay A
    Gene; 2024 May; 907():148235. PubMed ID: 38342250
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Locality-sensitive hashing for the edit distance.
    Marçais G; DeBlasio D; Pandey P; Kingsford C
    Bioinformatics; 2019 Jul; 35(14):i127-i135. PubMed ID: 31510667
    [TBL] [Abstract][Full Text] [Related]  

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

  • 24. Semi-supervised hashing for large-scale search.
    Wang J; Kumar S; Chang SF
    IEEE Trans Pattern Anal Mach Intell; 2012 Dec; 34(12):2393-406. PubMed ID: 22331853
    [TBL] [Abstract][Full Text] [Related]  

  • 25. A space and time-efficient index for the compacted colored de Bruijn graph.
    Almodaresi F; Sarkar H; Srivastava A; Patro R
    Bioinformatics; 2018 Jul; 34(13):i169-i177. PubMed ID: 29949982
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 28. SEED: efficient clustering of next-generation sequences.
    Bao E; Jiang T; Kaloshian I; Girke T
    Bioinformatics; 2011 Sep; 27(18):2502-9. PubMed ID: 21810899
    [TBL] [Abstract][Full Text] [Related]  

  • 29. PerFSeeB: designing long high-weight single spaced seeds for full sensitivity alignment with a given number of mismatches.
    Titarenko V; Titarenko S
    BMC Bioinformatics; 2023 Oct; 24(1):396. PubMed ID: 37875804
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Distributed Graph Hashing.
    Wang S; Li C; Shen HL
    IEEE Trans Cybern; 2019 May; 49(5):1896-1908. PubMed ID: 29993995
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Fast Supervised Discrete Hashing.
    Gui J; Liu T; Sun Z; Tao D; Tan T
    IEEE Trans Pattern Anal Mach Intell; 2018 Feb; 40(2):490-496. PubMed ID: 28287956
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Best hits of 11110110111: model-free selection and parameter-free sensitivity calculation of spaced seeds.
    Noé L
    Algorithms Mol Biol; 2017; 12():1. PubMed ID: 28289437
    [TBL] [Abstract][Full Text] [Related]  

  • 33. On the Maximal Independent Sets of
    Ma L; Chen K; Shao M
    ACM BCB; 2023 Sep; 2023():. PubMed ID: 38050580
    [TBL] [Abstract][Full Text] [Related]  

  • 34. rHAT: fast alignment of noisy long reads with regional hashing.
    Liu B; Guan D; Teng M; Wang Y
    Bioinformatics; 2016 Jun; 32(11):1625-31. PubMed ID: 26568628
    [TBL] [Abstract][Full Text] [Related]  

  • 35. An efficient classification algorithm for NGS data based on text similarity.
    Liao X; Liao X; Zhu W; Fang L; Chen X
    Genet Res (Camb); 2018 Sep; 100():e8. PubMed ID: 30221607
    [TBL] [Abstract][Full Text] [Related]  

  • 36. These are not the k-mers you are looking for: efficient online k-mer counting using a probabilistic data structure.
    Zhang Q; Pell J; Canino-Koning R; Howe AC; Brown CT
    PLoS One; 2014; 9(7):e101271. PubMed ID: 25062443
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Discrete Semantic Alignment Hashing for Cross-Media Retrieval.
    Yao T; Kong X; Fu H; Tian Q
    IEEE Trans Cybern; 2020 Dec; 50(12):4896-4907. PubMed ID: 31107671
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Gerbil: a fast and memory-efficient 
    Erbert M; Rechner S; Müller-Hannemann M
    Algorithms Mol Biol; 2017; 12():9. PubMed ID: 28373894
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Siamese Dilated Inception Hashing With Intra-Group Correlation Enhancement for Image Retrieval.
    Lu X; Chen Y; Li X
    IEEE Trans Neural Netw Learn Syst; 2020 Aug; 31(8):3032-3046. PubMed ID: 31514159
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Querying large read collections in main memory: a versatile data structure.
    Philippe N; Salson M; Lecroq T; Léonard M; Commes T; Rivals E
    BMC Bioinformatics; 2011 Jun; 12():242. PubMed ID: 21682852
    [TBL] [Abstract][Full Text] [Related]  

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