134 related articles for article (PubMed ID: 20865487)
21. Efficient sequential and parallel algorithms for planted motif search.
Nicolae M; Rajasekaran S
BMC Bioinformatics; 2014 Jan; 15():34. PubMed ID: 24479443
[TBL] [Abstract][Full Text] [Related]
22. 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]
23. 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]
24. 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]
25. 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]
26. 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]
27. Searching maximal degenerate motifs guided by a compact suffix tree.
Jiang H; Zhao Y; Chen W; Zheng W
Adv Exp Med Biol; 2010; 680():19-26. PubMed ID: 20865482
[TBL] [Abstract][Full Text] [Related]
28. A mini-greedy algorithm for faster structural RNA stem-loop search.
Gorodkin J; Lyngso RB; Stormo GD
Genome Inform; 2001; 12():184-93. PubMed ID: 11791237
[TBL] [Abstract][Full Text] [Related]
29. qPMS7: a fast algorithm for finding (ℓ, d)-motifs in DNA and protein sequences.
Dinh H; Rajasekaran S; Davila J
PLoS One; 2012; 7(7):e41425. PubMed ID: 22848493
[TBL] [Abstract][Full Text] [Related]
30. 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]
31. 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]
32. 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]
33. 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]
34. 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]
35. 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]
36. 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]
37. A Monte Carlo EM algorithm for de novo motif discovery in biomolecular sequences.
Bi C
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(3):370-86. PubMed ID: 19644166
[TBL] [Abstract][Full Text] [Related]
38. A parallel and incremental algorithm for efficient unique signature discovery on DNA databases.
Lee HP; Sheu TF; Tang CY
BMC Bioinformatics; 2010 Mar; 11():132. PubMed ID: 20230647
[TBL] [Abstract][Full Text] [Related]
39. Evaluating DNA sequence searching algorithms on multicore.
Weng N; Soewito B
Int J Comput Biol Drug Des; 2008; 1(3):313-27. PubMed ID: 20054996
[TBL] [Abstract][Full Text] [Related]
40. 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]
[Previous] [Next] [New Search]
