BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

171 related articles for article (PubMed ID: 30221607)

  • 21. ScaffMatch: scaffolding algorithm based on maximum weight matching.
    Mandric I; Zelikovsky A
    Bioinformatics; 2015 Aug; 31(16):2632-8. PubMed ID: 25890305
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 25. MetaCluster 4.0: a novel binning algorithm for NGS reads and huge number of species.
    Wang Y; Leung HC; Yiu SM; Chin FY
    J Comput Biol; 2012 Feb; 19(2):241-9. PubMed ID: 22300323
    [TBL] [Abstract][Full Text] [Related]  

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

  • 27. EC: an efficient error correction algorithm for short reads.
    Saha S; Rajasekaran S
    BMC Bioinformatics; 2015; 16 Suppl 17(Suppl 17):S2. PubMed ID: 26678663
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Indexing Arbitrary-Length k-Mers in Sequencing Reads.
    Kowalski T; Grabowski S; Deorowicz S
    PLoS One; 2015; 10(7):e0133198. PubMed ID: 26182400
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 31. SPRISS: approximating frequent k-mers by sampling reads, and applications.
    Santoro D; Pellegrina L; Comin M; Vandin F
    Bioinformatics; 2022 Jun; 38(13):3343-3350. PubMed ID: 35583271
    [TBL] [Abstract][Full Text] [Related]  

  • 32. SlideSort: all pairs similarity search for short reads.
    Shimizu K; Tsuda K
    Bioinformatics; 2011 Feb; 27(4):464-70. PubMed ID: 21148542
    [TBL] [Abstract][Full Text] [Related]  

  • 33. An improved filtering algorithm for big read datasets and its application to single-cell assembly.
    Wedemeyer A; Kliemann L; Srivastav A; Schielke C; Reusch TB; Rosenstiel P
    BMC Bioinformatics; 2017 Jul; 18(1):324. PubMed ID: 28673253
    [TBL] [Abstract][Full Text] [Related]  

  • 34. CLAST: CUDA implemented large-scale alignment search tool.
    Yano M; Mori H; Akiyama Y; Yamada T; Kurokawa K
    BMC Bioinformatics; 2014 Dec; 15(1):406. PubMed ID: 25495907
    [TBL] [Abstract][Full Text] [Related]  

  • 35. CDKAM: a taxonomic classification tool using discriminative k-mers and approximate matching strategies.
    Bui VK; Wei C
    BMC Bioinformatics; 2020 Oct; 21(1):468. PubMed ID: 33081690
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Inferring bona fide transfrags in RNA-Seq derived-transcriptome assemblies of non-model organisms.
    Mbandi SK; Hesse U; van Heusden P; Christoffels A
    BMC Bioinformatics; 2015 Feb; 16(1):58. PubMed ID: 25880035
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Separating metagenomic short reads into genomes via clustering.
    Tanaseichuk O; Borneman J; Jiang T
    Algorithms Mol Biol; 2012 Sep; 7(1):27. PubMed ID: 23009059
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Blue: correcting sequencing errors using consensus and context.
    Greenfield P; Duesing K; Papanicolaou A; Bauer DC
    Bioinformatics; 2014 Oct; 30(19):2723-32. PubMed ID: 24919879
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Benchmarking of de novo assembly algorithms for Nanopore data reveals optimal performance of OLC approaches.
    Cherukuri Y; Janga SC
    BMC Genomics; 2016 Aug; 17 Suppl 7(Suppl 7):507. PubMed ID: 27556636
    [TBL] [Abstract][Full Text] [Related]  

  • 40. MetaObtainer: A Tool for Obtaining Specified Species from Metagenomic Reads of Next-generation Sequencing.
    Pan W; Chen B; Xu Y
    Interdiscip Sci; 2015 Dec; 7(4):405-13. PubMed ID: 26293485
    [TBL] [Abstract][Full Text] [Related]  

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