149 related articles for article (PubMed ID: 17975266)
1. 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]
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. 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]
4. Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.
Tanaka S
IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(2):361-74. PubMed ID: 26355783
[TBL] [Abstract][Full Text] [Related]
5. Efficient sequential and parallel algorithms for finding edit distance based motifs.
Pal S; Xiao P; Rajasekaran S
BMC Genomics; 2016 Aug; 17 Suppl 4(Suppl 4):465. PubMed ID: 27557423
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. PairMotif: A new pattern-driven algorithm for planted (l, d) DNA motif search.
Yu Q; Huo H; Zhang Y; Guo H
PLoS One; 2012; 7(10):e48442. PubMed ID: 23119020
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets.
Yu Q; Huo H; Vitter JS; Huan J; Nekrich Y
IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(2):384-97. PubMed ID: 26357225
[TBL] [Abstract][Full Text] [Related]
10. RefSelect: a reference sequence selection algorithm for planted (l, d) motif search.
Yu Q; Huo H; Zhao R; Feng D; Vitter JS; Huan J
BMC Bioinformatics; 2016 Jul; 17 Suppl 9(Suppl 9):266. PubMed ID: 27454113
[TBL] [Abstract][Full Text] [Related]
11. Efficient motif finding algorithms for large-alphabet inputs.
Kuksa PP; Pavlovic V
BMC Bioinformatics; 2010 Oct; 11 Suppl 8(Suppl 8):S1. PubMed ID: 21034426
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. Detection of generic spaced motifs using submotif pattern mining.
Wijaya E; Rajaraman K; Yiu SM; Sung WK
Bioinformatics; 2007 Jun; 23(12):1476-85. PubMed ID: 17483509
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. 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]
16. 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]
17. 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]
18. ET-Motif: Solving the Exact (l, d)-Planted Motif Problem Using Error Tree Structure.
Al-Okaily A; Huang CH
J Comput Biol; 2016 Jul; 23(7):615-23. PubMed ID: 27152692
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. 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]
[Next] [New Search]