BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

127 related articles for article (PubMed ID: 35474383)

  • 1. KmerKeys: a web resource for searching indexed genome assemblies and variants.
    Pavlichin DS; Lee H; Greer SU; Grimes SM; Weissman T; Ji HP
    Nucleic Acids Res; 2022 Jul; 50(W1):W448-W453. PubMed ID: 35474383
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Optimization of de novo transcriptome assembly from high-throughput short read sequencing data improves functional annotation for non-model organisms.
    Haznedaroglu BZ; Reeves D; Rismani-Yazdi H; Peccia J
    BMC Bioinformatics; 2012 Jul; 13():170. PubMed ID: 22808927
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Fast detection of maximal exact matches via fixed sampling of query K-mers and Bloom filtering of index K-mers.
    Liu Y; Zhang LY; Li J
    Bioinformatics; 2019 Nov; 35(22):4560-4567. PubMed ID: 30994891
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Turtle: identifying frequent k-mers with cache-efficient algorithms.
    Roy RS; Bhattacharya D; Schliep A
    Bioinformatics; 2014 Jul; 30(14):1950-7. PubMed ID: 24618471
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 9. Compact representation of k-mer de Bruijn graphs for genome read assembly.
    Rødland EA
    BMC Bioinformatics; 2013 Oct; 14():313. PubMed ID: 24152242
    [TBL] [Abstract][Full Text] [Related]  

  • 10. SeqWare Query Engine: storing and searching sequence data in the cloud.
    O'Connor BD; Merriman B; Nelson SF
    BMC Bioinformatics; 2010 Dec; 11 Suppl 12(Suppl 12):S2. PubMed ID: 21210981
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 16. Demonstrating the utility of flexible sequence queries against indexed short reads with FlexTyper.
    Richmond PA; Kaye AM; Kounkou GJ; Av-Shalom TV; Wasserman WW
    PLoS Comput Biol; 2021 Mar; 17(3):e1008815. PubMed ID: 33750951
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Indexing
    Shibuya Y; Comin M
    J Bioinform Comput Biol; 2019 Oct; 17(5):1940011. PubMed ID: 31856669
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Analysis of common k-mers for whole genome sequences using SSB-tree.
    Choi JH; Cho HG
    Genome Inform; 2002; 13():30-41. PubMed ID: 14571372
    [TBL] [Abstract][Full Text] [Related]  

  • 20. BLight: efficient exact associative structure for k-mers.
    Marchet C; Kerbiriou M; Limasset A
    Bioinformatics; 2021 Sep; 37(18):2858-2865. PubMed ID: 33821954
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.