146 related articles for article (PubMed ID: 16328946)
21. 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]
22. 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]
23. 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]
24. 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]
25. Structured motifs search.
Morgante M; Policriti A; Vitacolonna N; Zuccolo A
J Comput Biol; 2005 Oct; 12(8):1065-82. PubMed ID: 16241898
[TBL] [Abstract][Full Text] [Related]
26. Efficient exact motif discovery.
Marschall T; Rahmann S
Bioinformatics; 2009 Jun; 25(12):i356-64. PubMed ID: 19478010
[TBL] [Abstract][Full Text] [Related]
27. Freezing firefly algorithm for efficient planted (ℓ, d) motif search.
Theepalakshmi P; Reddy US
Med Biol Eng Comput; 2022 Feb; 60(2):511-530. PubMed ID: 35020123
[TBL] [Abstract][Full Text] [Related]
28. IncMD: incremental trie-based structural motif discovery algorithm.
Badr G; Al-Turaiki I; Turcotte M; Mathkour H
J Bioinform Comput Biol; 2014 Oct; 12(5):1450027. PubMed ID: 25362841
[TBL] [Abstract][Full Text] [Related]
29. GAME: detecting cis-regulatory elements using a genetic algorithm.
Wei Z; Jensen ST
Bioinformatics; 2006 Jul; 22(13):1577-84. PubMed ID: 16632495
[TBL] [Abstract][Full Text] [Related]
30. 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]
31. Mining Conditional Phosphorylation Motifs.
Liu X; Wu J; Gong H; Deng S; He Z
IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(5):915-27. PubMed ID: 26356863
[TBL] [Abstract][Full Text] [Related]
32. 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]
33. Faster exact Markovian probability functions for motif occurrences: a DFA-only approach.
Ribeca P; Raineri E
Bioinformatics; 2008 Dec; 24(24):2839-48. PubMed ID: 18845582
[TBL] [Abstract][Full Text] [Related]
34. Data augmentation algorithms for detecting conserved domains in protein sequences: a comparative study.
Bi C
J Proteome Res; 2008 Jan; 7(1):192-201. PubMed ID: 18081244
[TBL] [Abstract][Full Text] [Related]
35. Identification of large disjoint motifs in biological networks.
Elhesha R; Kahveci T
BMC Bioinformatics; 2016 Oct; 17(1):408. PubMed ID: 27716036
[TBL] [Abstract][Full Text] [Related]
36. A generic motif discovery algorithm for sequential data.
Jensen KL; Styczynski MP; Rigoutsos I; Stephanopoulos GN
Bioinformatics; 2006 Jan; 22(1):21-8. PubMed ID: 16257985
[TBL] [Abstract][Full Text] [Related]
37. A multi-objective imperialist competitive algorithm (MOICA) for finding motifs in DNA sequences.
Gohardani SA; Bagherian M; Vaziri H
Math Biosci Eng; 2019 Feb; 16(3):1575-1596. PubMed ID: 30947433
[TBL] [Abstract][Full Text] [Related]
38. BayesMotif: de novo protein sorting motif discovery from impure datasets.
Hu J; Zhang F
BMC Bioinformatics; 2010 Jan; 11 Suppl 1(Suppl 1):S66. PubMed ID: 20122242
[TBL] [Abstract][Full Text] [Related]
39. A Simple, Fast, Filter-Based Algorithm for Approximate Circular Pattern Matching.
Azim MA; Iliopoulos CS; Rahman MS; Samiruzzaman M
IEEE Trans Nanobioscience; 2016 Mar; 15(2):93-100. PubMed ID: 26992174
[TBL] [Abstract][Full Text] [Related]
40. 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]
[Previous] [Next] [New Search]
