142 related articles for article (PubMed ID: 21385438)
1. A speedup technique for (l, d)-motif finding algorithms.
Rajasekaran S; Dinh H
BMC Res Notes; 2011 Mar; 4():54. PubMed ID: 21385438
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. 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]
4. qPMS9: an efficient algorithm for quorum Planted Motif Search.
Nicolae M; Rajasekaran S
Sci Rep; 2015 Jan; 5():7813. PubMed ID: 25589474
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. 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]
7. PMS: a panoptic motif search tool.
Dinh H; Rajasekaran S
PLoS One; 2013; 8(12):e80660. PubMed ID: 24324619
[TBL] [Abstract][Full Text] [Related]
8. Efficient algorithms for biological stems search.
Mi T; Rajasekaran S
BMC Bioinformatics; 2013 May; 14():161. PubMed ID: 23679045
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. High-performance exact algorithms for motif search.
Rajasekaran S; Balla S; Huang CH; Thapar V; Gryk M; Maciejewski M; Schiller M
J Clin Monit Comput; 2005 Oct; 19(4-5):319-28. PubMed ID: 16328946
[TBL] [Abstract][Full Text] [Related]
11. ET-Motif: Solving the Exact (l, d)-Planted Motif Problem Using Error Tree Structure.
Al-Okaily A; Huang CH
J Comput Biol; 2016 Jul; 23(7):615-23. PubMed ID: 27152692
[TBL] [Abstract][Full Text] [Related]
12. An efficient exact algorithm for planted motif search on large DNA sequence datasets.
Yu Q; Hu Y; Hu X; Lan J; Guo Y
IEEE/ACM Trans Comput Biol Bioinform; 2024 May; PP():. PubMed ID: 38801693
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. 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]
15. 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]
16. 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]
17. 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]
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. 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]
20. RNA motif search with data-driven element ordering.
Rampášek L; Jimenez RM; Lupták A; Vinař T; Brejová B
BMC Bioinformatics; 2016 May; 17(1):216. PubMed ID: 27188396
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
