BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

151 related articles for article (PubMed ID: 31985439)

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

  • 22. Kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison.
    Leimeister CA; Morgenstern B
    Bioinformatics; 2014 Jul; 30(14):2000-8. PubMed ID: 24828656
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A hybrid method for the exact planted (l, d) motif finding problem and its parallelization.
    Abbas MM; Abouelhoda M; Bahig HM
    BMC Bioinformatics; 2012; 13 Suppl 17(Suppl 17):S10. PubMed ID: 23281969
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Searching protein 3-D structures in linear time.
    Shibuya T
    J Comput Biol; 2010 Mar; 17(3):203-19. PubMed ID: 20377441
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Efficient counting of k-mers in DNA sequences using a bloom filter.
    Melsted P; Pritchard JK
    BMC Bioinformatics; 2011 Aug; 12():333. PubMed ID: 21831268
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Approximation properties of haplotype tagging.
    Vinterbo SA; Dreiseitl S; Ohno-Machado L
    BMC Bioinformatics; 2006 Jan; 7():8. PubMed ID: 16401341
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Improved algorithms for approximate string matching (extended abstract).
    Papamichail D; Papamichail G
    BMC Bioinformatics; 2009 Jan; 10 Suppl 1(Suppl 1):S10. PubMed ID: 19208109
    [TBL] [Abstract][Full Text] [Related]  

  • 28. A Practical and Scalable Tool to Find Overlaps between Sequences.
    Rachid MH; Malluhi Q
    Biomed Res Int; 2015; 2015():905261. PubMed ID: 25961045
    [TBL] [Abstract][Full Text] [Related]  

  • 29. An algorithm to enumerate sorting reversals for signed permutations.
    Siepel AC
    J Comput Biol; 2003; 10(3-4):575-97. PubMed ID: 12935346
    [TBL] [Abstract][Full Text] [Related]  

  • 30. A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations.
    Ho T; Oh SR; Kim H
    PLoS One; 2017; 12(10):e0186251. PubMed ID: 29016700
    [TBL] [Abstract][Full Text] [Related]  

  • 31. An efficient alignment algorithm for searching simple pseudoknots over long genomic sequence.
    Ma C; Wong TK; Lam TW; Hon WK; Sadakane K; Yiu SM
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(6):1629-38. PubMed ID: 22848134
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Disk-based k-mer counting on a PC.
    Deorowicz S; Debudaj-Grabysz A; Grabowski S
    BMC Bioinformatics; 2013 May; 14():160. PubMed ID: 23679007
    [TBL] [Abstract][Full Text] [Related]  

  • 33. A parallel and incremental algorithm for efficient unique signature discovery on DNA databases.
    Lee HP; Sheu TF; Tang CY
    BMC Bioinformatics; 2010 Mar; 11():132. PubMed ID: 20230647
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Short superstrings and the structure of overlapping strings.
    Armen C; Stein C
    J Comput Biol; 1995; 2(2):307-32. PubMed ID: 7497131
    [TBL] [Abstract][Full Text] [Related]  

  • 35. ALFRED: A Practical Method for Alignment-Free Distance Computation.
    Thankachan SV; Chockalingam SP; Liu Y; Apostolico A; Aluru S
    J Comput Biol; 2016 Jun; 23(6):452-60. PubMed ID: 27138275
    [TBL] [Abstract][Full Text] [Related]  

  • 36. microTaboo: a general and practical solution to the k-disjoint problem.
    Al-Jaff M; Sandström E; Grabherr M
    BMC Bioinformatics; 2017 May; 18(1):228. PubMed ID: 28464826
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Voting algorithms for the motif finding problem.
    Liu X; Ma B; Wang L
    Comput Syst Bioinformatics Conf; 2008; 7():37-47. PubMed ID: 19642267
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Kmerind: A Flexible Parallel Library for K-mer Indexing of Biological Sequences on Distributed Memory Systems.
    Pan T; Flick P; Jain C; Liu Y; Aluru S
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1117-1131. PubMed ID: 28991750
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Parallel sequence alignment in limited space.
    Grice JA; Hughey R; Speck D
    Proc Int Conf Intell Syst Mol Biol; 1995; 3():145-53. PubMed ID: 7584431
    [TBL] [Abstract][Full Text] [Related]  

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

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