134 related articles for article (PubMed ID: 20865487)
1. 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]
2. 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]
3. 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]
4. 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]
5. 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]
6. 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]
7. 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]
8. 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]
9. 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]
10. 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]
11. SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets.
Yu Q; Wei D; Huo H
BMC Bioinformatics; 2018 Jun; 19(1):228. PubMed ID: 29914360
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. 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]
14. A deterministic DNA database search.
Kheniche A; Salhi A; Harrison A; Dowden JM
Adv Exp Med Biol; 2010; 680():371-8. PubMed ID: 20865521
[TBL] [Abstract][Full Text] [Related]
15. cWINNOWER algorithm for finding fuzzy DNA motifs.
Liang S
Proc IEEE Comput Soc Bioinform Conf; 2003; 2():260-5. PubMed ID: 16452801
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. 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]
18. 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]
19. 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]
20. EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences.
Hu J; Yang YD; Kihara D
BMC Bioinformatics; 2006 Jul; 7():342. PubMed ID: 16839417
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
