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 *

168 related articles for article (PubMed ID: 23679007)

  • 1. Disk-based k-mer counting on a PC.
    Deorowicz S; Debudaj-Grabysz A; Grabowski S
    BMC Bioinformatics; 2013 May; 14():160. PubMed ID: 23679007
    [TBL] [Abstract][Full Text] [Related]  

  • 2. KMC 2: fast and resource-frugal k-mer counting.
    Deorowicz S; Kokot M; Grabowski S; Debudaj-Grabysz A
    Bioinformatics; 2015 May; 31(10):1569-76. PubMed ID: 25609798
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Squeakr: an exact and approximate k-mer counting system.
    Pandey P; Bender MA; Johnson R; Patro R; Berger B
    Bioinformatics; 2018 Feb; 34(4):568-575. PubMed ID: 29444235
    [TBL] [Abstract][Full Text] [Related]  

  • 5. DSK: k-mer counting with very low memory usage.
    Rizk G; Lavenier D; Chikhi R
    Bioinformatics; 2013 Mar; 29(5):652-3. PubMed ID: 23325618
    [TBL] [Abstract][Full Text] [Related]  

  • 6. ntCard: a streaming algorithm for cardinality estimation in genomics data.
    Mohamadi H; Khan H; Birol I
    Bioinformatics; 2017 May; 33(9):1324-1330. PubMed ID: 28453674
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. KCMBT: a k-mer Counter based on Multiple Burst Trees.
    Mamun AA; Pal S; Rajasekaran S
    Bioinformatics; 2016 Sep; 32(18):2783-90. PubMed ID: 27283950
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A general near-exact k-mer counting method with low memory consumption enables de novo assembly of 106× human sequence data in 2.7 hours.
    Shi CH; Yip KY
    Bioinformatics; 2020 Dec; 36(Suppl_2):i625-i633. PubMed ID: 33381843
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. KCOSS: an ultra-fast k-mer counter for assembled genome analysis.
    Tang D; Li Y; Tan D; Fu J; Tang Y; Lin J; Zhao R; Du H; Zhao Z
    Bioinformatics; 2022 Jan; 38(4):933-940. PubMed ID: 34849595
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Kmerind: A Flexible Parallel Library for K-mer Indexing of Biological Sequences on Distributed Memory Systems.
    Pan T; Flick P; Jain C; Liu Y; Aluru S
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1117-1131. PubMed ID: 28991750
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Cuttlefish: fast, parallel and low-memory compaction of de Bruijn graphs from large-scale genome collections.
    Khan J; Patro R
    Bioinformatics; 2021 Jul; 37(Suppl_1):i177-i186. PubMed ID: 34252958
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
    Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
    BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Minimizer-space de Bruijn graphs: Whole-genome assembly of long reads in minutes on a personal computer.
    Ekim B; Berger B; Chikhi R
    Cell Syst; 2021 Oct; 12(10):958-968.e6. PubMed ID: 34525345
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. kmcEx: memory-frugal and retrieval-efficient encoding of counted k-mers.
    Jiang P; Luo J; Wang Y; Deng P; Schmidt B; Tang X; Chen N; Wong L; Zhao L
    Bioinformatics; 2019 Dec; 35(23):4871-4878. PubMed ID: 31038666
    [TBL] [Abstract][Full Text] [Related]  

  • 18. FastEtch: A Fast Sketch-Based Assembler for Genomes.
    Ghosh P; Kalyanaraman A
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1091-1106. PubMed ID: 28910776
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Representation of
    Rahman A; Medevedev P
    J Comput Biol; 2021 Apr; 28(4):381-394. PubMed ID: 33290137
    [No Abstract]   [Full Text] [Related]  

  • 20. StLiter: A Novel Algorithm to Iteratively Build the Compacted de Bruijn Graph From Many Complete Genomes.
    Yu C; Mao K; Zhao Y; Chang C; Wang G
    IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(4):2471-2483. PubMed ID: 33630738
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.