146 related articles for article (PubMed ID: 26347887)
1. An Affinity Propagation-Based DNA Motif Discovery Algorithm.
Sun C; Huo H; Yu Q; Guo H; Sun Z
Biomed Res Int; 2015; 2015():853461. PubMed ID: 26347887
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. 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]
4. 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]
5. 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]
6. A heuristic cluster-based EM algorithm for the planted (l, d) problem.
Zhang Y; Huo H; Yu Q
J Bioinform Comput Biol; 2013 Aug; 11(4):1350009. PubMed ID: 23859273
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. Sequential Integration of Fuzzy Clustering and Expectation Maximization for Transcription Factor Binding Site Identification.
Yousefian-Jazi A; Choi J
J Comput Biol; 2018 Nov; 25(11):1247-1256. PubMed ID: 30133315
[TBL] [Abstract][Full Text] [Related]
9. PairMotif+: a fast and effective algorithm for de novo motif discovery in DNA sequences.
Yu Q; Huo H; Zhang Y; Guo H; Guo H
Int J Biol Sci; 2013; 9(4):412-24. PubMed ID: 23678291
[TBL] [Abstract][Full Text] [Related]
10. On the Monte-Carlo expectation maximization for finding motifs in DNA sequences.
Maiti A; Mukherjee A
IEEE J Biomed Health Inform; 2015 Mar; 19(2):677-86. PubMed ID: 24833606
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. EXTREME: an online EM algorithm for motif discovery.
Quang D; Xie X
Bioinformatics; 2014 Jun; 30(12):1667-73. PubMed ID: 24532725
[TBL] [Abstract][Full Text] [Related]
13. Stochastic EM-based TFBS motif discovery with MITSU.
Kilpatrick AM; Ward B; Aitken S
Bioinformatics; 2014 Jun; 30(12):i310-8. PubMed ID: 24931999
[TBL] [Abstract][Full Text] [Related]
14. Efficient algorithms for biological stems search.
Mi T; Rajasekaran S
BMC Bioinformatics; 2013 May; 14():161. PubMed ID: 23679045
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. 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]
17. A Clustering Approach for Motif Discovery in ChIP-Seq Dataset.
Sun CX; Yang Y; Wang H; Wang WH
Entropy (Basel); 2019 Aug; 21(8):. PubMed ID: 33267515
[TBL] [Abstract][Full Text] [Related]
18. A novel Bayesian DNA motif comparison method for clustering and retrieval.
Habib N; Kaplan T; Margalit H; Friedman N
PLoS Comput Biol; 2008 Feb; 4(2):e1000010. PubMed ID: 18463706
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. A transdimensional Bayesian model for pattern recognition in DNA sequences.
Li SM; Wakefield J; Self S
Biostatistics; 2008 Oct; 9(4):668-85. PubMed ID: 18349034
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
