BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

235 related articles for article (PubMed ID: 12015879)

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

  • 2. An extension and novel solution to the (l,d)-motif challenge problem.
    Styczynski MP; Jensen KL; Rigoutsos I; Stephanopoulos GN
    Genome Inform; 2004; 15(2):63-71. PubMed ID: 15706492
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Algorithms for challenging motif problems.
    Leung HC; Chin FY
    J Bioinform Comput Biol; 2006 Feb; 4(1):43-58. PubMed ID: 16568541
    [TBL] [Abstract][Full Text] [Related]  

  • 5. PhyloGibbs: a Gibbs sampling motif finder that incorporates phylogeny.
    Siddharthan R; Siggia ED; van Nimwegen E
    PLoS Comput Biol; 2005 Dec; 1(7):e67. PubMed ID: 16477324
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Hybrid Gibbs-sampling algorithm for challenging motif discovery: GibbsDST.
    Shida K
    Genome Inform; 2006; 17(2):3-13. PubMed ID: 17503374
    [TBL] [Abstract][Full Text] [Related]  

  • 7. MUSA: a parameter free algorithm for the identification of biologically significant motifs.
    Mendes ND; Casimiro AC; Santos PM; Sá-Correia I; Oliveira AL; Freitas AT
    Bioinformatics; 2006 Dec; 22(24):2996-3002. PubMed ID: 17068086
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. MotifCut: regulatory motifs finding with maximum density subgraphs.
    Fratkin E; Naughton BT; Brutlag DL; Batzoglou S
    Bioinformatics; 2006 Jul; 22(14):e150-7. PubMed ID: 16873465
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. An algorithm for finding protein-DNA binding sites with applications to chromatin-immunoprecipitation microarray experiments.
    Liu XS; Brutlag DL; Liu JS
    Nat Biotechnol; 2002 Aug; 20(8):835-9. PubMed ID: 12101404
    [TBL] [Abstract][Full Text] [Related]  

  • 12. cWINNOWER algorithm for finding fuzzy DNA motifs.
    Liang S
    Proc IEEE Comput Soc Bioinform Conf; 2003; 2():260-5. PubMed ID: 16452801
    [TBL] [Abstract][Full Text] [Related]  

  • 13. On counting position weight matrix matches in a sequence, with application to discriminative motif finding.
    Sinha S
    Bioinformatics; 2006 Jul; 22(14):e454-63. PubMed ID: 16873507
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Discriminative motif discovery in DNA and protein sequences using the DEME algorithm.
    Redhead E; Bailey TL
    BMC Bioinformatics; 2007 Oct; 8():385. PubMed ID: 17937785
    [TBL] [Abstract][Full Text] [Related]  

  • 15. An improved heuristic algorithm for finding motif signals in DNA sequences.
    Huang CW; Lee WS; Hsieh SY
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):959-75. PubMed ID: 20855921
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. An Efficient Algorithm for Discovering Motifs in Large DNA Data Sets.
    Yu Q; Huo H; Chen X; Guo H; Vitter JS; Huan J
    IEEE Trans Nanobioscience; 2015 Jul; 14(5):535-44. PubMed ID: 25872217
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Motif finding in DNA sequences based on skipping nonconserved positions in background Markov chains.
    Zhao X; Sze SH
    J Comput Biol; 2011 May; 18(5):759-70. PubMed ID: 21554019
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Finding motifs from all sequences with and without binding sites.
    Leung HC; Chin FY
    Bioinformatics; 2006 Sep; 22(18):2217-23. PubMed ID: 16870937
    [TBL] [Abstract][Full Text] [Related]  

  • 20. RankMotif++: a motif-search algorithm that accounts for relative ranks of K-mers in binding transcription factors.
    Chen X; Hughes TR; Morris Q
    Bioinformatics; 2007 Jul; 23(13):i72-9. PubMed ID: 17646348
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 12.