BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

167 related articles for article (PubMed ID: 25172922)

  • 41. Fast exact algorithms for the closest string and substring problems with application to the planted (L, d)-motif model.
    Chen ZZ; Wang L
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1400-10. PubMed ID: 21282867
    [TBL] [Abstract][Full Text] [Related]  

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

  • 43. Fast inexact mapping using advanced tree exploration on backward search methods.
    Salavert J; Tomás A; Tárraga J; Medina I; Dopazo J; Blanquer I
    BMC Bioinformatics; 2015 Jan; 16():18. PubMed ID: 25626517
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Fast and memory efficient approach for mapping NGS reads to a reference genome.
    Kumar S; Agarwal S; Ranvijay
    J Bioinform Comput Biol; 2019 Apr; 17(2):1950008. PubMed ID: 31057068
    [TBL] [Abstract][Full Text] [Related]  

  • 45. Short read alignment with populations of genomes.
    Huang L; Popic V; Batzoglou S
    Bioinformatics; 2013 Jul; 29(13):i361-70. PubMed ID: 23813006
    [TBL] [Abstract][Full Text] [Related]  

  • 46. FaStore: a space-saving solution for raw sequencing data.
    Roguski L; Ochoa I; Hernaez M; Deorowicz S
    Bioinformatics; 2018 Aug; 34(16):2748-2756. PubMed ID: 29617939
    [TBL] [Abstract][Full Text] [Related]  

  • 47. Efficient de novo assembly of large genomes using compressed data structures.
    Simpson JT; Durbin R
    Genome Res; 2012 Mar; 22(3):549-56. PubMed ID: 22156294
    [TBL] [Abstract][Full Text] [Related]  

  • 48. A space-efficient construction of the Burrows-Wheeler transform for genomic data.
    Lippert RA; Mobarry CM; Walenz BP
    J Comput Biol; 2005 Sep; 12(7):943-51. PubMed ID: 16201914
    [TBL] [Abstract][Full Text] [Related]  

  • 49. smallWig: parallel compression of RNA-seq WIG files.
    Wang Z; Weissman T; Milenkovic O
    Bioinformatics; 2016 Jan; 32(2):173-80. PubMed ID: 26424856
    [TBL] [Abstract][Full Text] [Related]  

  • 50. libFLASM: a software library for fixed-length approximate string matching.
    Ayad LA; Pissis SP; Retha A
    BMC Bioinformatics; 2016 Nov; 17(1):454. PubMed ID: 27832739
    [TBL] [Abstract][Full Text] [Related]  

  • 51. Advances in high throughput DNA sequence data compression.
    Sardaraz M; Tahir M; Ikram AA
    J Bioinform Comput Biol; 2016 Jun; 14(3):1630002. PubMed ID: 26846812
    [TBL] [Abstract][Full Text] [Related]  

  • 52. Efficient haplotype matching and storage using the positional Burrows-Wheeler transform (PBWT).
    Durbin R
    Bioinformatics; 2014 May; 30(9):1266-72. PubMed ID: 24413527
    [TBL] [Abstract][Full Text] [Related]  

  • 53. Multi-threading the generation of Burrows-Wheeler Alignment.
    Jo H
    Genet Mol Res; 2016 May; 15(2):. PubMed ID: 27323088
    [TBL] [Abstract][Full Text] [Related]  

  • 54. PFP Compressed Suffix Trees.
    Boucher C; Cvacho O; Gagie T; Holub J; Manzini G; Navarro G; Rossi M
    Proc Worksh Algorithm Eng Exp; 2021; 2021():60-72. PubMed ID: 35355938
    [TBL] [Abstract][Full Text] [Related]  

  • 55. QualComp: a new lossy compressor for quality scores based on rate distortion theory.
    Ochoa I; Asnani H; Bharadia D; Chowdhury M; Weissman T; Yona G
    BMC Bioinformatics; 2013 Jun; 14():187. PubMed ID: 23758828
    [TBL] [Abstract][Full Text] [Related]  

  • 56. WBFQC: A new approach for compressing next-generation sequencing data splitting into homogeneous streams.
    Kumar S; Agarwal S; Ranvijay
    J Bioinform Comput Biol; 2018 Oct; 16(5):1850018. PubMed ID: 30304988
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Genome compression: a novel approach for large collections.
    Deorowicz S; Danek A; Grabowski S
    Bioinformatics; 2013 Oct; 29(20):2572-8. PubMed ID: 23969136
    [TBL] [Abstract][Full Text] [Related]  

  • 58. Parallel Computation of the Burrows-Wheeler Transform of Short Reads Using Prefix Parallelism.
    Kimura K; Koike A
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):3-13. PubMed ID: 29994538
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Recursive Prefix-Free Parsing for Building Big BWTs.
    Oliva M; Gagie T; Boucher C
    bioRxiv; 2023 Jan; ():. PubMed ID: 36712109
    [TBL] [Abstract][Full Text] [Related]  

  • 60. Operating on Genomic Ranges Using BEDOPS.
    Neph S; Reynolds AP; Kuehn MS; Stamatoyannopoulos JA
    Methods Mol Biol; 2016; 1418():267-81. PubMed ID: 27008020
    [TBL] [Abstract][Full Text] [Related]  

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