These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

131 related articles for article (PubMed ID: 31985439)

  • 61. Discovering Motifs in Biological Sequences Using the Micron Automata Processor.
    Roy I; Aluru S
    IEEE/ACM Trans Comput Biol Bioinform; 2016; 13(1):99-111. PubMed ID: 26886735
    [TBL] [Abstract][Full Text] [Related]  

  • 62. A Simple, Fast, Filter-Based Algorithm for Approximate Circular Pattern Matching.
    Azim MA; Iliopoulos CS; Rahman MS; Samiruzzaman M
    IEEE Trans Nanobioscience; 2016 Mar; 15(2):93-100. PubMed ID: 26992174
    [TBL] [Abstract][Full Text] [Related]  

  • 63. The effects of sampling on the efficiency and accuracy of k-mer indexes: Theoretical and empirical comparisons using the human genome.
    Almutairy M; Torng E
    PLoS One; 2017; 12(7):e0179046. PubMed ID: 28686614
    [TBL] [Abstract][Full Text] [Related]  

  • 64. Fast and practical algorithms for planted (l, d) motif search.
    Davila J; Balla S; Rajasekaran S
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):544-52. PubMed ID: 17975266
    [TBL] [Abstract][Full Text] [Related]  

  • 65. Sorting signed permutations by inversions in O(nlogn) time.
    Swenson KM; Rajan V; Lin Y; Moret BM
    J Comput Biol; 2010 Mar; 17(3):489-501. PubMed ID: 20377459
    [TBL] [Abstract][Full Text] [Related]  

  • 66. Fast, optimal alignment of three sequences using linear gap costs.
    Powell DR; Allison L; Dix TI
    J Theor Biol; 2000 Dec; 207(3):325-36. PubMed ID: 11082303
    [TBL] [Abstract][Full Text] [Related]  

  • 67. NSAMD: A new approach to discover structured contiguous substrings in sequence datasets using Next-Symbol-Array.
    Pari A; Baraani A; Parseh S
    Comput Biol Chem; 2016 Oct; 64():384-395. PubMed ID: 27620380
    [TBL] [Abstract][Full Text] [Related]  

  • 68. Efficient enumeration of phylogenetically informative substrings.
    Angelov S; Harb B; Kannan S; Khanna S; Kim J
    J Comput Biol; 2007; 14(6):701-23. PubMed ID: 17691889
    [TBL] [Abstract][Full Text] [Related]  

  • 69. Joker de Bruijn: Covering k-Mers Using Joker Characters.
    Orenstein Y; Yu YW; Berger B
    J Comput Biol; 2018 Nov; 25(11):1171-1178. PubMed ID: 30117747
    [TBL] [Abstract][Full Text] [Related]  

  • 70. Improved design and analysis of practical minimizers.
    Zheng H; Kingsford C; Marçais G
    Bioinformatics; 2020 Jul; 36(Suppl_1):i119-i127. PubMed ID: 32657376
    [TBL] [Abstract][Full Text] [Related]  

  • 71. A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.
    Dinh H; Rajasekaran S
    Bioinformatics; 2011 Jul; 27(14):1901-7. PubMed ID: 21636593
    [TBL] [Abstract][Full Text] [Related]  

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

  • 73. Phylogeny reconstruction based on the length distribution of
    Morgenstern B; Schöbel S; Leimeister CA
    Algorithms Mol Biol; 2017; 12():27. PubMed ID: 29238399
    [TBL] [Abstract][Full Text] [Related]  

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

  • 75. Finding significant matches of position weight matrices in linear time.
    Pizzi C; Rastas P; Ukkonen E
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(1):69-79. PubMed ID: 21071798
    [TBL] [Abstract][Full Text] [Related]  

  • 76. A space-efficient algorithm for the constrained pairwise sequence alignment problem.
    He D; Arslan AN
    Genome Inform; 2005; 16(2):237-46. PubMed ID: 16901106
    [TBL] [Abstract][Full Text] [Related]  

  • 77. Reconstruction of ancestral genomic sequences using likelihood.
    Elias I; Tuller T
    J Comput Biol; 2007 Mar; 14(2):216-37. PubMed ID: 17456016
    [TBL] [Abstract][Full Text] [Related]  

  • 78. Searching protein three-dimensional structures in faster than linear time.
    Shibuya T
    J Comput Biol; 2010 Apr; 17(4):593-602. PubMed ID: 20426692
    [TBL] [Abstract][Full Text] [Related]  

  • 79. A multi-objective imperialist competitive algorithm (MOICA) for finding motifs in DNA sequences.
    Gohardani SA; Bagherian M; Vaziri H
    Math Biosci Eng; 2019 Feb; 16(3):1575-1596. PubMed ID: 30947433
    [TBL] [Abstract][Full Text] [Related]  

  • 80. Improving Bloom Filter Performance on Sequence Data Using k-mer Bloom Filters.
    Pellow D; Filippova D; Kingsford C
    J Comput Biol; 2017 Jun; 24(6):547-557. PubMed ID: 27828710
    [TBL] [Abstract][Full Text] [Related]  

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