BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

161 related articles for article (PubMed ID: 19478010)

  • 21. DiNAMO: highly sensitive DNA motif discovery in high-throughput sequencing data.
    Saad C; Noé L; Richard H; Leclerc J; Buisine MP; Touzet H; Figeac M
    BMC Bioinformatics; 2018 Jun; 19(1):223. PubMed ID: 29890948
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Towards a theoretical understanding of false positives in DNA motif finding.
    Zia A; Moses AM
    BMC Bioinformatics; 2012 Jun; 13():151. PubMed ID: 22738169
    [TBL] [Abstract][Full Text] [Related]  

  • 23. On the hardness of counting and sampling center strings.
    Boucher C; Omar M
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(6):1843-6. PubMed ID: 22641713
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 26. Discovering multiple realistic TFBS motifs based on a generalized model.
    Chan TM; Li G; Leung KS; Lee KH
    BMC Bioinformatics; 2009 Oct; 10():321. PubMed ID: 19811641
    [TBL] [Abstract][Full Text] [Related]  

  • 27. MoTeX-II: structured MoTif eXtraction from large-scale datasets.
    Pissis SP
    BMC Bioinformatics; 2014 Jul; 15():235. PubMed ID: 25004797
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Counting of oligomers in sequences generated by markov chains for DNA motif discovery.
    Shan G; Zheng WM
    J Bioinform Comput Biol; 2009 Feb; 7(1):39-54. PubMed ID: 19226659
    [TBL] [Abstract][Full Text] [Related]  

  • 29. A generic motif discovery algorithm for sequential data.
    Jensen KL; Styczynski MP; Rigoutsos I; Stephanopoulos GN
    Bioinformatics; 2006 Jan; 22(1):21-8. PubMed ID: 16257985
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Computation of mutual information from Hidden Markov Models.
    Reker D; Katzenbeisser S; Hamacher K
    Comput Biol Chem; 2010 Dec; 34(5-6):328-33. PubMed ID: 20951093
    [TBL] [Abstract][Full Text] [Related]  

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

  • 32. PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem.
    Dinh H; Rajasekaran S; Kundeti VK
    BMC Bioinformatics; 2011 Oct; 12():410. PubMed ID: 22024209
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Stochastic EM-based TFBS motif discovery with MITSU.
    Kilpatrick AM; Ward B; Aitken S
    Bioinformatics; 2014 Jun; 30(12):i310-8. PubMed ID: 24931999
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Probabilistic variable-length segmentation of protein sequences for discriminative motif discovery (DiMotif) and sequence embedding (ProtVecX).
    Asgari E; McHardy AC; Mofrad MRK
    Sci Rep; 2019 Mar; 9(1):3577. PubMed ID: 30837494
    [TBL] [Abstract][Full Text] [Related]  

  • 35. PMS6: a fast algorithm for motif discovery.
    Bandyopadhyay S; Sahni S; Rajasekaran S
    Int J Bioinform Res Appl; 2014; 10(4-5):369-83. PubMed ID: 24989858
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Review of tools and algorithms for network motif discovery in biological networks.
    Patra S; Mohapatra A
    IET Syst Biol; 2020 Aug; 14(4):171-189. PubMed ID: 32737276
    [TBL] [Abstract][Full Text] [Related]  

  • 37. The effect of orthology and coregulation on detecting regulatory motifs.
    Storms V; Claeys M; Sanchez A; De Moor B; Verstuyf A; Marchal K
    PLoS One; 2010 Feb; 5(2):e8938. PubMed ID: 20140085
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 40. Novel algorithms for LDD motif search.
    Xiao P; Schiller M; Rajasekaran S
    BMC Genomics; 2019 Jun; 20(Suppl 5):424. PubMed ID: 31167665
    [TBL] [Abstract][Full Text] [Related]  

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