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 *

142 related articles for article (PubMed ID: 21385438)

  • 21. PairMotif+: a fast and effective algorithm for de novo motif discovery in DNA sequences.
    Yu Q; Huo H; Zhang Y; Guo H; Guo H
    Int J Biol Sci; 2013; 9(4):412-24. PubMed ID: 23678291
    [TBL] [Abstract][Full Text] [Related]  

  • 22. An Affinity Propagation-Based DNA Motif Discovery Algorithm.
    Sun C; Huo H; Yu Q; Guo H; Sun Z
    Biomed Res Int; 2015; 2015():853461. PubMed ID: 26347887
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A Monte Carlo-based framework enhances the discovery and interpretation of regulatory sequence motifs.
    Seitzer P; Wilbanks EG; Larsen DJ; Facciotti MT
    BMC Bioinformatics; 2012 Nov; 13():317. PubMed ID: 23181585
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Prediction of cis-regulatory elements: from high-information content analysis to motif identification.
    Li G; Lu J; Olman V; Xu Y
    J Bioinform Comput Biol; 2007 Aug; 5(4):817-38. PubMed ID: 17787058
    [TBL] [Abstract][Full Text] [Related]  

  • 25. CompMoby: comparative MobyDick for detection of cis-regulatory motifs.
    Chaivorapol C; Melton C; Wei G; Yeh RF; Ramalho-Santos M; Blelloch R; Li H
    BMC Bioinformatics; 2008 Oct; 9():455. PubMed ID: 18950538
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 28. CodingMotif: exact determination of overrepresented nucleotide motifs in coding sequences.
    Ding Y; Lorenz WA; Chuang JH
    BMC Bioinformatics; 2012 Feb; 13():32. PubMed ID: 22333114
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Exploring Scalable Parallelization for Edit Distance-Based Motif Search.
    Qiu J; Ebnenasir A
    IEEE/ACM Trans Comput Biol Bioinform; 2023; 20(2):1587-1593. PubMed ID: 37815943
    [TBL] [Abstract][Full Text] [Related]  

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

  • 31. Bounded search for de novo identification of degenerate cis-regulatory elements.
    Carlson JM; Chakravarty A; Khetani RS; Gross RH
    BMC Bioinformatics; 2006 May; 7():254. PubMed ID: 16700920
    [TBL] [Abstract][Full Text] [Related]  

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

  • 33. Using SCOPE to identify potential regulatory motifs in coregulated genes.
    Martyanov V; Gross RH
    J Vis Exp; 2011 May; (51):. PubMed ID: 21673638
    [TBL] [Abstract][Full Text] [Related]  

  • 34. SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets.
    Yu Q; Wei D; Huo H
    BMC Bioinformatics; 2018 Jun; 19(1):228. PubMed ID: 29914360
    [TBL] [Abstract][Full Text] [Related]  

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

  • 36. Exact algorithms for planted motif problems.
    Rajasekaran S; Balla S; Huang CH
    J Comput Biol; 2005 Oct; 12(8):1117-28. PubMed ID: 16241901
    [TBL] [Abstract][Full Text] [Related]  

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

  • 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. Discovering Motifs in Biological Sequences Using the Micron Automata Processor.
    Roy I; Aluru S
    IEEE/ACM Trans Comput Biol Bioinform; 2016; 13(1):99-111. PubMed ID: 26886735
    [TBL] [Abstract][Full Text] [Related]  

  • 40. ERGC: an efficient referential genome compression algorithm.
    Saha S; Rajasekaran S
    Bioinformatics; 2015 Nov; 31(21):3468-75. PubMed ID: 26139636
    [TBL] [Abstract][Full Text] [Related]  

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