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.
5. A fast weak motif-finding algorithm based on community detection in graphs. Jia C; Carson MB; Yu J BMC Bioinformatics; 2013 Jul; 14():227. PubMed ID: 23865838 [TBL] [Abstract][Full Text] [Related]
6. 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]
7. 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]
8. NSAMD: A new approach to discover structured contiguous substrings in sequence datasets using Next-Symbol-Array. Pari A; Baraani A; Parseh S Comput Biol Chem; 2016 Oct; 64():384-395. PubMed ID: 27620380 [TBL] [Abstract][Full Text] [Related]
9. 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]
10. Direct vs 2-stage approaches to structured motif finding. Federico M; Leoncini M; Montangero M; Valente P Algorithms Mol Biol; 2012 Aug; 7(1):20. PubMed ID: 22908910 [TBL] [Abstract][Full Text] [Related]
11. MATLIGN: a motif clustering, comparison and matching tool. Kankainen M; Löytynoja A BMC Bioinformatics; 2007 Jun; 8():189. PubMed ID: 17559640 [TBL] [Abstract][Full Text] [Related]
12. 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]
13. 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]
14. rMotifGen: random motif generator for DNA and protein sequences. Rouchka EC; Hardin CT BMC Bioinformatics; 2007 Aug; 8():292. PubMed ID: 17683637 [TBL] [Abstract][Full Text] [Related]
16. WordSpy: identifying transcription factor binding motifs by building a dictionary and learning a grammar. Wang G; Yu T; Zhang W Nucleic Acids Res; 2005 Jul; 33(Web Server issue):W412-6. PubMed ID: 15980501 [TBL] [Abstract][Full Text] [Related]
18. 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]
19. 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]
20. Finding motifs in the twilight zone. Keich U; Pevzner PA Bioinformatics; 2002 Oct; 18(10):1374-81. PubMed ID: 12376382 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]