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 *

134 related articles for article (PubMed ID: 20865487)

  • 41. GAME: detecting cis-regulatory elements using a genetic algorithm.
    Wei Z; Jensen ST
    Bioinformatics; 2006 Jul; 22(13):1577-84. PubMed ID: 16632495
    [TBL] [Abstract][Full Text] [Related]  

  • 42. Tsukuba BB: a branch and bound algorithm for local multiple alignment of DNA and protein sequences.
    Horton P
    J Comput Biol; 2001; 8(3):283-303. PubMed ID: 11535177
    [TBL] [Abstract][Full Text] [Related]  

  • 43. A profile-based deterministic sequential Monte Carlo algorithm for motif discovery.
    Liang KC; Wang X; Anastassiou D
    Bioinformatics; 2008 Jan; 24(1):46-55. PubMed ID: 18024972
    [TBL] [Abstract][Full Text] [Related]  

  • 44. EMS3: An Improved Algorithm for Finding Edit-Distance Based Motifs.
    Xiao P; Cai X; Rajasekaran S
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(1):27-37. PubMed ID: 32931433
    [TBL] [Abstract][Full Text] [Related]  

  • 45. Finding motifs using random projections.
    Buhler J; Tompa M
    J Comput Biol; 2002; 9(2):225-42. PubMed ID: 12015879
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Memetic algorithms for de novo motif-finding in biomedical sequences.
    Bi C
    Artif Intell Med; 2012 Sep; 56(1):1-17. PubMed ID: 22613029
    [TBL] [Abstract][Full Text] [Related]  

  • 47. Detection of generic spaced motifs using submotif pattern mining.
    Wijaya E; Rajaraman K; Yiu SM; Sung WK
    Bioinformatics; 2007 Jun; 23(12):1476-85. PubMed ID: 17483509
    [TBL] [Abstract][Full Text] [Related]  

  • 48. Efficient algorithms for biological stems search.
    Mi T; Rajasekaran S
    BMC Bioinformatics; 2013 May; 14():161. PubMed ID: 23679045
    [TBL] [Abstract][Full Text] [Related]  

  • 49. Bases of motifs for generating repeated patterns with wild cards.
    Pisanti N; Crochemore M; Grossi R; Sagot MF
    IEEE/ACM Trans Comput Biol Bioinform; 2005; 2(1):40-50. PubMed ID: 17044163
    [TBL] [Abstract][Full Text] [Related]  

  • 50. High-performance exact algorithms for motif search.
    Rajasekaran S; Balla S; Huang CH; Thapar V; Gryk M; Maciejewski M; Schiller M
    J Clin Monit Comput; 2005 Oct; 19(4-5):319-28. PubMed ID: 16328946
    [TBL] [Abstract][Full Text] [Related]  

  • 51. An O(N2) algorithm for discovering optimal Boolean pattern pairs.
    Bannai H; Hyyrö H; Shinohara A; Takeda M; Nakai K; Miyano S
    IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(4):159-70. PubMed ID: 17051698
    [TBL] [Abstract][Full Text] [Related]  

  • 52. A Gibbs sampler for identification of symmetrically structured, spaced DNA motifs with improved estimation of the signal length.
    Favorov AV; Gelfand MS; Gerasimova AV; Ravcheev DA; Mironov AA; Makeev VJ
    Bioinformatics; 2005 May; 21(10):2240-5. PubMed ID: 15728117
    [TBL] [Abstract][Full Text] [Related]  

  • 53. A uniform projection method for motif discovery in DNA sequences.
    Raphael B; Liu LT; Varghese G
    IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(2):91-4. PubMed ID: 17048384
    [TBL] [Abstract][Full Text] [Related]  

  • 54. A cluster refinement algorithm for motif discovery.
    Li G; Chan TM; Leung KS; Lee KH
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):654-68. PubMed ID: 21030733
    [TBL] [Abstract][Full Text] [Related]  

  • 55. Algorithms for phylogenetic footprinting.
    Blanchette M; Schwikowski B; Tompa M
    J Comput Biol; 2002; 9(2):211-23. PubMed ID: 12015878
    [TBL] [Abstract][Full Text] [Related]  

  • 56. An efficient motif discovery algorithm with unknown motif length and number of binding sites.
    Leung HC; Chin FY
    Int J Data Min Bioinform; 2006; 1(2):201-15. PubMed ID: 18399071
    [TBL] [Abstract][Full Text] [Related]  

  • 57. SIMD parallelization of the WORDUP algorithm for detecting statistically significant patterns in DNA sequences.
    Liuni S; Prunella N; Pesole G; D'Orazio T; Stella E; Distante A
    Comput Appl Biosci; 1993 Dec; 9(6):701-7. PubMed ID: 8143157
    [TBL] [Abstract][Full Text] [Related]  

  • 58. An algorithm for finding signals of unknown length in DNA sequences.
    Pavesi G; Mauri G; Pesole G
    Bioinformatics; 2001; 17 Suppl 1():S207-14. PubMed ID: 11473011
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Calculating the exact probability of language-like patterns in biomolecular sequences.
    Atteson K
    Proc Int Conf Intell Syst Mol Biol; 1998; 6():17-24. PubMed ID: 9783205
    [TBL] [Abstract][Full Text] [Related]  

  • 60. A heuristic cluster-based EM algorithm for the planted (l, d) problem.
    Zhang Y; Huo H; Yu Q
    J Bioinform Comput Biol; 2013 Aug; 11(4):1350009. PubMed ID: 23859273
    [TBL] [Abstract][Full Text] [Related]  

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