Learn More
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Programming populations. However their method could only give static estimates of the degree of repetition of building blocks in one generation at a time, supplying no information about(More)
Recently, the atomic structures of both the closed and open forms of Group 2 chaperonin protein Mm-cpn were revealed through crystallography and cryo-electron microscopy. This toroidal-like chaperonin is composed of two eightfold rings that face back-to-back. To gain a computational advantage, we used a symmetry constrained elastic network model (SCENM),(More)
The 3' untranslated region (3' UTR) of mRNA contains elements that play regulatory roles in polyadenylation, localization, translation efficiency, and mRNA stability. Despite the significance of the 3' UTR, there is no popular method for annotating 3' UTRs and for profiling their isoforms. Recently, poly(A)-position profiling by sequencing (3P-seq) and(More)
As whole genome sequencing (WGS) uncovers variants associated with rare and common diseases, an immediate challenge is to minimize false-positive findings due to sequencing and variant calling errors. False positives can be reduced by combining results from orthogonal sequencing methods, but costly. Here, we present variant filtering approaches using(More)
Estimation of Distribution Algorithms were introduced into Genetic Programming over 15 years ago, and have demonstrated good performance on a range of problems, but there has been little research into their limitations. We apply two such algorithms - scalar and vectorial Stochastic Grammar GP - to Daida's well-known Lid problem, to better understand their(More)
  • 1