119 related articles for article (PubMed ID: 38801693)
21. An Efficient Algorithm for Discovering Motifs in Large DNA Data Sets.
Yu Q; Huo H; Chen X; Guo H; Vitter JS; Huan J
IEEE Trans Nanobioscience; 2015 Jul; 14(5):535-44. PubMed ID: 25872217
[TBL] [Abstract][Full Text] [Related]
22. A new algorithm for DNA motif discovery using multiple sample sequence sets.
Yu Q; Zhao X; Huo H
J Bioinform Comput Biol; 2019 Aug; 17(4):1950021. PubMed ID: 31617465
[TBL] [Abstract][Full Text] [Related]
23. 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]
24. 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]
25. RecMotif: a novel fast algorithm for weak motif discovery.
Sun HQ; Low MY; Hsu WJ; Rajapakse JC
BMC Bioinformatics; 2010 Dec; 11 Suppl 11(Suppl 11):S8. PubMed ID: 21172058
[TBL] [Abstract][Full Text] [Related]
26. 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]
27. 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]
28. EMS3: An Improved Algorithm for Finding Edit-Distance Based Motifs.
Xiao P; Cai X; Rajasekaran S
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(1):27-37. PubMed ID: 32931433
[TBL] [Abstract][Full Text] [Related]
29. 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]
30. 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]
31. 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]
32. PMS6: A Fast Algorithm for Motif Discovery.
Bandyopadhyay S; Sahni S; Rajasekaran S
IEEE Int Conf Comput Adv Bio Med Sci; 2012; ():1-6. PubMed ID: 23959399
[TBL] [Abstract][Full Text] [Related]
33. 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]
34. Tree-structured algorithm for long weak motif discovery.
Sun HQ; Low MY; Hsu WJ; Tan CW; Rajapakse JC
Bioinformatics; 2011 Oct; 27(19):2641-7. PubMed ID: 21821665
[TBL] [Abstract][Full Text] [Related]
35. 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]
36. An extension and novel solution to the (l,d)-motif challenge problem.
Styczynski MP; Jensen KL; Rigoutsos I; Stephanopoulos GN
Genome Inform; 2004; 15(2):63-71. PubMed ID: 15706492
[TBL] [Abstract][Full Text] [Related]
37. 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]
38. 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]
39. Efficient exact motif discovery.
Marschall T; Rahmann S
Bioinformatics; 2009 Jun; 25(12):i356-64. PubMed ID: 19478010
[TBL] [Abstract][Full Text] [Related]
40. A Review on Planted (
Mohanty S; Pattnaik PK; Al-Absi AA; Kang DK
Sensors (Basel); 2022 Feb; 22(3):. PubMed ID: 35161949
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
