BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

127 related articles for article (PubMed ID: 27556803)

  • 41. A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem.
    Thankachan SV; Apostolico A; Aluru S
    J Comput Biol; 2016 Jun; 23(6):472-82. PubMed ID: 27058840
    [TBL] [Abstract][Full Text] [Related]  

  • 42. iDoComp: a compression scheme for assembled genomes.
    Ochoa I; Hernaez M; Weissman T
    Bioinformatics; 2015 Mar; 31(5):626-33. PubMed ID: 25344501
    [TBL] [Abstract][Full Text] [Related]  

  • 43. Multiple sequence assembly from reads alignable to a common reference genome.
    Peng Q; Smith AD
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1283-95. PubMed ID: 21778524
    [TBL] [Abstract][Full Text] [Related]  

  • 44. MUMmer4: A fast and versatile genome alignment system.
    Marçais G; Delcher AL; Phillippy AM; Coston R; Salzberg SL; Zimin A
    PLoS Comput Biol; 2018 Jan; 14(1):e1005944. PubMed ID: 29373581
    [TBL] [Abstract][Full Text] [Related]  

  • 45. Multiple Sequence Alignment Based on a Suffix Tree and Center-Star Strategy: A Linear Method for Multiple Nucleotide Sequence Alignment on Spark Parallel Framework.
    Su W; Liao X; Lu Y; Zou Q; Peng S
    J Comput Biol; 2017 Dec; 24(12):1230-1242. PubMed ID: 29116822
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Compression of genomic sequencing reads via hash-based reordering: algorithm and analysis.
    Chandak S; Tatwawadi K; Weissman T
    Bioinformatics; 2018 Feb; 34(4):558-567. PubMed ID: 29444237
    [TBL] [Abstract][Full Text] [Related]  

  • 47. Linear-time computation of minimal absent words using suffix array.
    Barton C; Heliou A; Mouchard L; Pissis SP
    BMC Bioinformatics; 2014 Dec; 15(1):388. PubMed ID: 25526884
    [TBL] [Abstract][Full Text] [Related]  

  • 48. High efficiency referential genome compression algorithm.
    Shi W; Chen J; Luo M; Chen M
    Bioinformatics; 2019 Jun; 35(12):2058-2065. PubMed ID: 30407493
    [TBL] [Abstract][Full Text] [Related]  

  • 49. BitPAl: a bit-parallel, general integer-scoring sequence alignment algorithm.
    Loving J; Hernandez Y; Benson G
    Bioinformatics; 2014 Nov; 30(22):3166-73. PubMed ID: 25075119
    [TBL] [Abstract][Full Text] [Related]  

  • 50. SaAlign: Multiple DNA/RNA sequence alignment and phylogenetic tree construction tool for ultra-large datasets and ultra-long sequences based on suffix array.
    Wang Z; Tan J; Long Y; Liu Y; Lei W; Cai J; Yang Y; Liu Z
    Comput Struct Biotechnol J; 2022; 20():1487-1493. PubMed ID: 35422971
    [TBL] [Abstract][Full Text] [Related]  

  • 51. CoGI: Towards Compressing Genomes as an Image.
    Xie X; Zhou S; Guan J
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1275-85. PubMed ID: 26671800
    [TBL] [Abstract][Full Text] [Related]  

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

  • 53. CompMap: a reference-based compression program to speed up read mapping to related reference sequences.
    Zhu Z; Li L; Zhang Y; Yang Y; Yang X
    Bioinformatics; 2015 Feb; 31(3):426-8. PubMed ID: 25282641
    [TBL] [Abstract][Full Text] [Related]  

  • 54. Compressed indexing and local alignment of DNA.
    Lam TW; Sung WK; Tam SL; Wong CK; Yiu SM
    Bioinformatics; 2008 Mar; 24(6):791-7. PubMed ID: 18227115
    [TBL] [Abstract][Full Text] [Related]  

  • 55. Exact asymptotic results for the Bernoulli matching model of sequence alignment.
    Majumdar SN; Nechaev S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Aug; 72(2 Pt 1):020901. PubMed ID: 16196539
    [TBL] [Abstract][Full Text] [Related]  

  • 56. Compression of Multiple DNA Sequences Using Intra-Sequence and Inter-Sequence Similarities.
    Cheng KO; Wu P; Law NF; Siu WC
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1322-32. PubMed ID: 26671804
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Analysis of the relationships among Longest Common Subsequences, Shortest Common Supersequences and patterns and its application on pattern discovery in biological sequences.
    Ning K; Ng HK; Leong HW
    Int J Data Min Bioinform; 2011; 5(6):611-25. PubMed ID: 22295747
    [TBL] [Abstract][Full Text] [Related]  

  • 58. mkESA: enhanced suffix array construction tool.
    Homann R; Fleer D; Giegerich R; Rehmsmeier M
    Bioinformatics; 2009 Apr; 25(8):1084-5. PubMed ID: 19246510
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Fast model-based protein homology detection without alignment.
    Hochreiter S; Heusel M; Obermayer K
    Bioinformatics; 2007 Jul; 23(14):1728-36. PubMed ID: 17488755
    [TBL] [Abstract][Full Text] [Related]  

  • 60. Using GPUs for the exact alignment of short-read genetic sequences by means of the Burrows-Wheeler transform.
    Salavert Torres J; Blanquer Espert I; Domínguez AT; Hernández García V; Medina Castelló I; Tárraga Giménez J; Dopazo Blázquez J
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1245-56. PubMed ID: 22450827
    [TBL] [Abstract][Full Text] [Related]  

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