141 related articles for article (PubMed ID: 16328946)
1. 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]
2. 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]
3. 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]
4. 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]
5. 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]
6. 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]
7. 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]
8. 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]
9. 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]
10. 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]
11. 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]
12. Efficient algorithms for biological stems search.
Mi T; Rajasekaran S
BMC Bioinformatics; 2013 May; 14():161. PubMed ID: 23679045
[TBL] [Abstract][Full Text] [Related]
13. A parallel combinatorial algorithm for subtle motifs.
Arock M; Reddy S; Reddy AV
Int J Bioinform Res Appl; 2010; 6(3):260-9. PubMed ID: 20615834
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. A Monte Carlo-based framework enhances the discovery and interpretation of regulatory sequence motifs.
Seitzer P; Wilbanks EG; Larsen DJ; Facciotti MT
BMC Bioinformatics; 2012 Nov; 13():317. PubMed ID: 23181585
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. 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]
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. MODA: an efficient algorithm for network motif discovery in biological networks.
Omidi S; Schreiber F; Masoudi-Nejad A
Genes Genet Syst; 2009 Oct; 84(5):385-95. PubMed ID: 20154426
[TBL] [Abstract][Full Text] [Related]
20. 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]
[Next] [New Search]
