戻る
「早戻しボタン」を押すと検索画面に戻ります。

今後説明を表示しない

[OK]

コーパス検索結果 (1語後でソート)

通し番号をクリックするとPubMedの該当ページを表示します
1 sampled from the posterior distribution with Gibbs sampling.
2 or Bayesian inference using Forward-Backward Gibbs sampling.
3  to the state-of-the-art, including standard Gibbs sampling.
4 lgorithm for Gaussian mixed linear model via Gibbs sampling.
5 ine factor binding sites by using a Bayesian Gibbs sampling algorithm and an extensive protein locali
6                                AlignACE is a Gibbs sampling algorithm for identifying motifs that are
7                           We use a collapsed Gibbs sampling algorithm for inference.
8 sitions, and incorporate these priors into a Gibbs sampling algorithm for motif discovery.
9                            Metropolis within Gibbs sampling algorithm is used to simulate from the po
10 hain Monte Carlo algorithm that combines the Gibbs sampling algorithm of HapSeq and Metropolis-Hastin
11                                            A Gibbs sampling algorithm then locates putative cis-actin
12  coefficients are dealt with by developing a Gibbs sampling algorithm to stochastically search throug
13 xt, Hierarchical Bayesian Modeling using the Gibbs Sampling algorithm was applied to identify the seg
14                                       Then a Gibbs sampling algorithm was applied to search for share
15                            It uses a blocked Gibbs sampling algorithm, which has a theoretical advant
16 y cross-species comparison using an extended Gibbs sampling algorithm.
17  tools are good at detecting strong signals, Gibbs sampling algorithms give inconsistent results when
18 ption factor binding sites than the standard Gibbs sampling algorithms.
19 plied different statistical algorithms (both Gibbs sampling and expectation-maximization) in reconstr
20 ntal framework, we employed a combination of Gibbs sampling and linear regression to build a classifi
21 e Carlo sampling and, in particular, discuss Gibbs sampling and Metropolis random walk algorithms wit
22 portant factors governing the performance of Gibbs sampling and reversible jump for mapping multiple
23  deriving error bars for breakpoints using a Gibbs sampling approach.
24 e Carlo algorithm should be more robust than Gibbs sampling approaches to multimodality problems.
25                          We have developed a Gibbs sampling-based algorithm for the genomic mapping o
26                          We have developed a Gibbs sampling-based Bayesian motif clustering (BMC) alg
27 sequence motif was identified in all ACPs by Gibbs sampling-based computational analyses.
28 latory sequence motifs: (i) BioProspector, a Gibbs-sampling-based program for predicting regulatory m
29 otif of interest, masking DNA repeats during Gibbs sampling becomes unnecessary.
30 ithm called CompareProspector, which extends Gibbs sampling by biasing the search in regions conserve
31 and Markov chain Monte Carlo simulation with Gibbs sampling, calculating pooled odds ratios and assoc
32 of Bayesian variable selection methods using Gibbs sampling can be applied to the composite model spa
33 hen combine the model sampling step with the Gibbs sampling framework for de novo motif discoveries.
34                                              Gibbs sampling, hidden Markov models, and other analysis
35               These motifs are refined using Gibbs sampling in competition with a null motif.
36 of the model using Markov Chain Monte Carlo, Gibbs sampling in particular, to simulate parameters fro
37                  In this paper, we develop a Gibbs-sampling-induced stochastic search procedure to ra
38                   Combining subsampling with Gibbs sampling is an interesting ensemble algorithm.
39                                         Then Gibbs sampling is repeated, allowing for frameshifts of
40 sterior distributions are in closed form, so Gibbs sampling is straightforward.
41                               We developed a Gibbs sampling Markov chain Monte Carlo algorithm that p
42 ethods that could perform the same task, the Gibbs sampling method developed here exceeds their abili
43                                            A Gibbs sampling method was then developed to estimate the
44                                    Using the Gibbs sampling method, we also detected enrichment of NF
45 d has already been applied in the context of Gibbs sampling methods.
46 els of coding and non-coding regions and the Gibbs sampling multiple alignment program.
47         Most approaches have utilized either Gibbs sampling or greedy strategies to identify such ele
48 MS then performs bicluster mining based on a Gibbs sampling paradigm.
49  biclustering model (BBC), and implemented a Gibbs sampling procedure for its statistical inference.
50                                          The Gibbs sampling procedure we use simultaneously maps ambi
51                                     Usually, Gibbs sampling requires a preliminary masking step, to a
52                        The method utilizes a Gibbs sampling strategy to model the cooperativity betwe
53                     Here we have developed a Gibbs sampling technique to identify genes whose express
54      Upon exploring variants of the standard Gibbs sampling technique to optimize the alignment, we d
55                                      We used Gibbs sampling to define a CRP(Mt) DNA motif that resemb
56 er, it used Bayesian hierarchical model with Gibbs sampling to incorporate binding signals of these r
57                For example, GibbsDNA applies Gibbs sampling to random seeds, and MEME applies the EM
58  numbers and the convergence efficiencies of Gibbs sampling were calculated and discussed for achievi
59       We present a novel algorithm, based on Gibbs sampling, which locates, de novo, the cis features

WebLSDに未収録の専門用語(用法)は "新規対訳" から投稿できます。