101 related articles for article (PubMed ID: 20615834)
1. 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]
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. 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]
4. 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]
5. 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]
6. 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]
7. 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]
8. Hybrid Gibbs-sampling algorithm for challenging motif discovery: GibbsDST.
Shida K
Genome Inform; 2006; 17(2):3-13. PubMed ID: 17503374
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. 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]
11. Finding significant matches of position weight matrices in linear time.
Pizzi C; Rastas P; Ukkonen E
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(1):69-79. PubMed ID: 21071798
[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. 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]
14. 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]
15. SLIDER: a generic metaheuristic for the discovery of correlated motifs in protein-protein interaction networks.
Boyen P; Van Dyck D; Neven F; van Ham RC; van Dijk AD
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1344-57. PubMed ID: 21282865
[TBL] [Abstract][Full Text] [Related]
16. Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm.
Rigoutsos I; Floratos A
Bioinformatics; 1998; 14(1):55-67. PubMed ID: 9520502
[TBL] [Abstract][Full Text] [Related]
17. Bases of motifs for generating repeated patterns with wild cards.
Pisanti N; Crochemore M; Grossi R; Sagot MF
IEEE/ACM Trans Comput Biol Bioinform; 2005; 2(1):40-50. PubMed ID: 17044163
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. A novel motif discovery algorithm for identifying protein families.
Wei R; Gao L; Zhang T
Protein Pept Lett; 2010 Oct; 17(10):1215-22. PubMed ID: 20518741
[TBL] [Abstract][Full Text] [Related]
20. 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]
[Next] [New Search]
