210 related articles for article (PubMed ID: 18845582)
1. Faster exact Markovian probability functions for motif occurrences: a DFA-only approach.
Ribeca P; Raineri E
Bioinformatics; 2008 Dec; 24(24):2839-48. PubMed ID: 18845582
[TBL] [Abstract][Full Text] [Related]
2. Fast model-based protein homology detection without alignment.
Hochreiter S; Heusel M; Obermayer K
Bioinformatics; 2007 Jul; 23(14):1728-36. PubMed ID: 17488755
[TBL] [Abstract][Full Text] [Related]
3. A conservative parametric approach to motif significance analysis.
Keich U; Ng P
Genome Inform; 2007; 19():61-72. PubMed ID: 18546505
[TBL] [Abstract][Full Text] [Related]
4. Conservative extraction of over-represented extensible motifs.
Apostolico A; Comin M; Parida L
Bioinformatics; 2005 Jun; 21 Suppl 1():i9-18. PubMed ID: 15961503
[TBL] [Abstract][Full Text] [Related]
5. Efficient representation and P-value computation for high-order Markov motifs.
da Fonseca PG; Guimarães KS; Sagot MF
Bioinformatics; 2008 Aug; 24(16):i160-6. PubMed ID: 18689819
[TBL] [Abstract][Full Text] [Related]
6. Using complexity for the estimation of Bayesian networks.
Salzman P; Almudevar A
Stat Appl Genet Mol Biol; 2006; 5():Article21. PubMed ID: 17049032
[TBL] [Abstract][Full Text] [Related]
7. Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome.
Becher V; Deymonnaz A; Heiber P
Bioinformatics; 2009 Jul; 25(14):1746-53. PubMed ID: 19451169
[TBL] [Abstract][Full Text] [Related]
8. Numerical solutions for patterns statistics on Markov chains.
Nuel G
Stat Appl Genet Mol Biol; 2006; 5():Article26. PubMed ID: 17049037
[TBL] [Abstract][Full Text] [Related]
9. Discovering sequence motifs.
Bailey TL
Methods Mol Biol; 2008; 452():231-51. PubMed ID: 18566768
[TBL] [Abstract][Full Text] [Related]
10. Factorial hidden Markov models and the generalized backfitting algorithm.
Jacobs RA; Jiang W; Tanner MA
Neural Comput; 2002 Oct; 14(10):2415-37. PubMed ID: 12396569
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. info-gibbs: a motif discovery algorithm that directly optimizes information content during sampling.
Defrance M; van Helden J
Bioinformatics; 2009 Oct; 25(20):2715-22. PubMed ID: 19689955
[TBL] [Abstract][Full Text] [Related]
13. ExactFDR: exact computation of false discovery rate estimate in case-control association studies.
Wojcik J; Forner K
Bioinformatics; 2008 Oct; 24(20):2407-8. PubMed ID: 18662924
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. Drift and scaling in estimation of distribution algorithms.
Shapiro JL
Evol Comput; 2005; 13(1):99-123. PubMed ID: 15901428
[TBL] [Abstract][Full Text] [Related]
16. A generalization of the PST algorithm: modeling the sparse nature of protein sequences.
Leonardi FG
Bioinformatics; 2006 Jun; 22(11):1302-7. PubMed ID: 16527830
[TBL] [Abstract][Full Text] [Related]
17. Error analysis and efficient sampling in Markovian state models for molecular dynamics.
Singhal N; Pande VS
J Chem Phys; 2005 Nov; 123(20):204909. PubMed ID: 16351319
[TBL] [Abstract][Full Text] [Related]
18. Computation of median gene clusters.
Böcker S; Jahn K; Mixtacki J; Stoye J
J Comput Biol; 2009 Aug; 16(8):1085-99. PubMed ID: 19689215
[TBL] [Abstract][Full Text] [Related]
19. How to describe genes: enlightenment from the quaternary number system.
Ma BG
Biosystems; 2007; 90(1):20-7. PubMed ID: 16945479
[TBL] [Abstract][Full Text] [Related]
20. Feature selection environment for genomic applications.
Lopes FM; Martins DC; Cesar RM
BMC Bioinformatics; 2008 Oct; 9():451. PubMed ID: 18945362
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
