PubMed Health⌕ Search

Biomedical subjects

Faming Liang

Publications and source records attributed to Faming Liang.

4 recordsLinked to original sources

Generalized 1/k-ensemble algorithm.

We generalize the 1/k-ensemble algorithm so that it can be used for both discrete and continuous systems, and show that the generalization is correct numerically and mathematically. We also compare the efficiencies of the generalized 1/k-ensemble algorithm and the generalized Wang-Landau algorithm through a neural network example. The numerical results favor to the generalized 1/k-ensemble algorithm.

Journal Article↗

Annealing contour Monte Carlo algorithm for structure optimization in an off-lattice protein model.

We present a space annealing version for a contour Monte Carlo algorithm and show that it can be applied successfully to finding the ground states for an off-lattice protein model. The comparison shows that the algorithm has made a significant improvement over the pruned-enriched-Rosenbluth method and the Metropolis Monte Carlo method in finding the ground states for AB models. For all sequences, the algorithm has renewed the putative ground energy values in the two-dimensional AB model and set the putative ground energy values in the three-dimensional AB model.

Algorithms↗

Search for haplotype interactions that influence susceptibility to type 1 diabetes, through use of unphased genotype data.

Type 1 diabetes is a T-cell-mediated chronic disease characterized by the autoimmune destruction of pancreatic insulin-producing beta cells and complete insulin deficiency. It is the result of a complex interrelation of genetic and environmental factors, most of which have yet to be identified. Simultaneous identification of these genetic factors, through use of unphased genotype data, has received increasing attention in the past few years. Several approaches have been described, such as the modified transmission/disequilibrium test procedure, the conditional extended transmission/disequilibrium test, and the stepwise logistic-regression procedure. These approaches are limited either by being restricted to family data or by ignoring so-called "haplotype interactions" between alleles. To overcome this limit, the present study provides a general method to identify, on the basis of unphased genotype data, the haplotype blocks that interact to define the risk for a complex disease. The principle underpinning the proposal is minimal entropy. The performance of our procedure is illustrated for both simulated and real data. In particular, for a set of Dutch type 1 diabetes data, our procedure suggests some novel evidence of the interactions between and within haplotype blocks that are across chromosomes 1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 15, 16, 17, 19, and 21. The results demonstrate that, by considering interactions between potential disease haplotype blocks, we may succeed in identifying disease-predisposing genetic variants that might otherwise have remained undetected.

Algorithms↗

Use of sequential structure in simulation from high-dimensional systems.

Sampling from high-dimensional systems often suffers from the curse of dimensionality. In this paper, we explored the use of sequential structures in sampling from high-dimensional systems with an aim at eliminating the curse of dimensionality, and proposed an algorithm, so-called sequential parallel tempering as an extension of parallel tempering. The algorithm was tested with the witch's hat distribution and Ising model. Numerical results suggest that it is a promising tool for sampling from high-dimensional systems. The efficiency of the algorithm was argued theoretically based on the Rao-Blackwellization theorem.

Journal Article↗