BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

261 related articles for article (PubMed ID: 19642267)

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

  • 2. Experimental study of modified voting algorithm for planted (l,d)-motif problem.
    Bahig HM; Abbas MM; Bhery A
    Adv Exp Med Biol; 2010; 680():65-73. PubMed ID: 20865487
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 7. Finding exact optimal motifs in matrix representation by partitioning.
    Leung HC; Chin FY
    Bioinformatics; 2005 Sep; 21 Suppl 2():ii86-92. PubMed ID: 16204132
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Using PhyloCon to identify conserved regulatory motifs.
    Wang T
    Curr Protoc Bioinformatics; 2007 Sep; Chapter 2():Unit 2.12. PubMed ID: 18428790
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences.
    Hu J; Yang YD; Kihara D
    BMC Bioinformatics; 2006 Jul; 7():342. PubMed ID: 16839417
    [TBL] [Abstract][Full Text] [Related]  

  • 12. cWINNOWER algorithm for finding fuzzy dna motifs.
    Liang S; Samanta MP; Biegel BA
    J Bioinform Comput Biol; 2004 Mar; 2(1):47-60. PubMed ID: 15272432
    [TBL] [Abstract][Full Text] [Related]  

  • 13. An Algorithm for Motif Discovery with Iteration on Lengths of Motifs.
    Fan Y; Wu W; Yang J; Yang W; Liu R
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(1):136-41. PubMed ID: 26357084
    [TBL] [Abstract][Full Text] [Related]  

  • 14. HIGEDA: a hierarchical gene-set genetics based algorithm for finding subtle motifs in biological sequences.
    Le T; Altman T; Gardiner K
    Bioinformatics; 2010 Feb; 26(3):302-9. PubMed ID: 19996163
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Fast exact algorithms for the closest string and substring problems with application to the planted (L, d)-motif model.
    Chen ZZ; Wang L
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1400-10. PubMed ID: 21282867
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Randomized algorithms for motif detection.
    Wang L; Dong L
    J Bioinform Comput Biol; 2005 Oct; 3(5):1039-52. PubMed ID: 16278946
    [TBL] [Abstract][Full Text] [Related]  

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

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

    [Next]    [New Search]
    of 14.