BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

128 related articles for article (PubMed ID: 27556803)

  • 21. Modified HuffBit Compress Algorithm - An Application of R.
    Habib N; Ahmed K; Jabin I; Rahman MM
    J Integr Bioinform; 2018 Feb; 15(3):. PubMed ID: 29470175
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Sparse Binary Relation Representations for Genome Graph Annotation.
    Karasikov M; Mustafa H; Joudaki A; Javadzadeh-No S; Rätsch G; Kahles A
    J Comput Biol; 2020 Apr; 27(4):626-639. PubMed ID: 31891531
    [TBL] [Abstract][Full Text] [Related]  

  • 23. SOAP2: an improved ultrafast tool for short read alignment.
    Li R; Yu C; Li Y; Lam TW; Yiu SM; Kristiansen K; Wang J
    Bioinformatics; 2009 Aug; 25(15):1966-7. PubMed ID: 19497933
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Genome comparison without alignment using shortest unique substrings.
    Haubold B; Pierstorff N; Möller F; Wiehe T
    BMC Bioinformatics; 2005 May; 6():123. PubMed ID: 15910684
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Index suffix-prefix overlaps by (w, k)-minimizer to generate long contigs for reads compression.
    Liu Y; Yu Z; Dinger ME; Li J
    Bioinformatics; 2019 Jun; 35(12):2066-2074. PubMed ID: 30407482
    [TBL] [Abstract][Full Text] [Related]  

  • 26. SPARK-MSNA: Efficient algorithm on Apache Spark for aligning multiple similar DNA/RNA sequences with supervised learning.
    Vineetha V; Biji CL; Nair AS
    Sci Rep; 2019 Apr; 9(1):6631. PubMed ID: 31036850
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Compressing resequencing data with GReEn.
    Pinho AJ; Pratas D; Garcia SP
    Methods Mol Biol; 2013; 1038():27-37. PubMed ID: 23872967
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Sketch distance-based clustering of chromosomes for large genome database compression.
    Tang T; Liu Y; Zhang B; Su B; Li J
    BMC Genomics; 2019 Dec; 20(Suppl 10):978. PubMed ID: 31888458
    [TBL] [Abstract][Full Text] [Related]  

  • 29. An algorithm to solve the motif alignment problem for approximate nested tandem repeats in biological sequences.
    Matroud AA; Tuffley CP; Hendy MD
    J Comput Biol; 2011 Sep; 18(9):1211-8. PubMed ID: 21899426
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Finite width model sequence comparison.
    Chia N; Bundschuh R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2004 Aug; 70(2 Pt 1):021906. PubMed ID: 15447514
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Apache Spark Implementations for String Patterns in DNA Sequences.
    Kanavos A; Livieris I; Mylonas P; Sioutas S; Vonitsanos G
    Adv Exp Med Biol; 2020; 1194():439-453. PubMed ID: 32468560
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Analysis of high-throughput sequencing data.
    Mane SP; Modise T; Sobral BW
    Methods Mol Biol; 2011; 678():1-11. PubMed ID: 20931368
    [TBL] [Abstract][Full Text] [Related]  

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

  • 34. A hyper-heuristic for the Longest Common Subsequence problem.
    Tabataba FS; Mousavi SR
    Comput Biol Chem; 2012 Feb; 36():42-54. PubMed ID: 22286085
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Dynamic Alignment-Free and Reference-Free Read Compression.
    Holley G; Wittler R; Stoye J; Hach F
    J Comput Biol; 2018 Jul; 25(7):825-836. PubMed ID: 30011247
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Alignment of BLAST high-scoring segment pairs based on the longest increasing subsequence algorithm.
    Zhang H
    Bioinformatics; 2003 Jul; 19(11):1391-6. PubMed ID: 12874051
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Parallel progressive multiple sequence alignment on reconfigurable meshes.
    Nguyen KD; Pan Y; Nong G
    BMC Genomics; 2011 Dec; 12 Suppl 5(Suppl 5):S4. PubMed ID: 22369070
    [TBL] [Abstract][Full Text] [Related]  

  • 38. GReEn: a tool for efficient compression of genome resequencing data.
    Pinho AJ; Pratas D; Garcia SP
    Nucleic Acids Res; 2012 Feb; 40(4):e27. PubMed ID: 22139935
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Cache-oblivious dynamic programming for bioinformatics.
    Chowdhury RA; Le HS; Ramachandran V
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(3):495-510. PubMed ID: 20671320
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Reconfigurable systems for sequence alignment and for general dynamic programming.
    Jacobi RP; Ayala-Rincón M; Carvalho LG; Llanos CH; Hartenstein RW
    Genet Mol Res; 2005 Sep; 4(3):543-52. PubMed ID: 16342039
    [TBL] [Abstract][Full Text] [Related]  

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