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 *

112 related articles for article (PubMed ID: 27095998)

  • 1. Bitpacking techniques for indexing genomes: I. Hash tables.
    Wu TD
    Algorithms Mol Biol; 2016; 11():5. PubMed ID: 27095998
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Bitpacking techniques for indexing genomes: II. Enhanced suffix arrays.
    Wu TD
    Algorithms Mol Biol; 2016; 11():9. PubMed ID: 27110277
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. GMAP and GSNAP for Genomic Sequence Alignment: Enhancements to Speed, Accuracy, and Functionality.
    Wu TD; Reeder J; Lawrence M; Becker G; Brauer MJ
    Methods Mol Biol; 2016; 1418():283-334. PubMed ID: 27008021
    [TBL] [Abstract][Full Text] [Related]  

  • 5. PROuST: a comparison method of three-dimensional structures of proteins using indexing techniques.
    Comin M; Guerra C; Zanotti G
    J Comput Biol; 2004; 11(6):1061-72. PubMed ID: 15662198
    [TBL] [Abstract][Full Text] [Related]  

  • 6. MergedTrie: Efficient textual indexing.
    Ferrández A; Peral J
    PLoS One; 2019; 14(4):e0215288. PubMed ID: 31013282
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. Implementation of 3D spatial indexing and compression in a large-scale molecular dynamics simulation database for rapid atomic contact detection.
    Toofanny RD; Simms AM; Beck DA; Daggett V
    BMC Bioinformatics; 2011 Aug; 12():334. PubMed ID: 21831299
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. HIA: a genome mapper using hybrid index-based sequence alignment.
    Choi J; Park K; Cho SB; Chung M
    Algorithms Mol Biol; 2015; 10():30. PubMed ID: 26702294
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Distributed Complementary Binary Quantization for Joint Hash Table Learning.
    Liu X; Fu Q; Wang D; Bai X; Wu X; Tao D
    IEEE Trans Neural Netw Learn Syst; 2020 Dec; 31(12):5312-5323. PubMed ID: 32078562
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 15. Fast, accurate, and lightweight analysis of BS-treated reads with ERNE 2.
    Prezza N; Vezzi F; Käller M; Policriti A
    BMC Bioinformatics; 2016 Mar; 17 Suppl 4(Suppl 4):69. PubMed ID: 26961371
    [TBL] [Abstract][Full Text] [Related]  

  • 16. NRGC: a novel referential genome compression algorithm.
    Saha S; Rajasekaran S
    Bioinformatics; 2016 Nov; 32(22):3405-3412. PubMed ID: 27485445
    [TBL] [Abstract][Full Text] [Related]  

  • 17. MAP: searching large genome databases.
    Kahveci T; Singh A
    Pac Symp Biocomput; 2003; ():303-14. PubMed ID: 12603037
    [TBL] [Abstract][Full Text] [Related]  

  • 18. ERGC: an efficient referential genome compression algorithm.
    Saha S; Rajasekaran S
    Bioinformatics; 2015 Nov; 31(21):3468-75. PubMed ID: 26139636
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Finding Bugs in Cryptographic Hash Function Implementations.
    Mouha N; Raunak MS; Kuhn DR; Kacker R
    IEEE Trans Reliab; 2018; 67():. PubMed ID: 31092953
    [TBL] [Abstract][Full Text] [Related]  

  • 20. GTRAC: fast retrieval from compressed collections of genomic variants.
    Tatwawadi K; Hernaez M; Ochoa I; Weissman T
    Bioinformatics; 2016 Sep; 32(17):i479-i486. PubMed ID: 27587665
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.