The effect of a mutation on the organism often depends on what other mutations are already present in its genome. Geneticists refer to such mutational interactions as epistasis. Pairwise epistatic effects have been recognized for over a century, and their evolutionary implications have received theoretical attention for nearly as long.
View Article and Find Full Text PDFCurr Opin Genet Dev
December 2013
Natural selection drives evolving populations up the fitness landscape, the projection from nucleotide sequence space to organismal reproductive success. While it has long been appreciated that topographic complexities on fitness landscapes can arise only as a consequence of epistatic interactions between mutations, evolutionary genetics has mainly focused on epistasis between pairs of mutations. Here we propose a generalization to the classical population genetic treatment of pairwise epistasis that yields expressions for epistasis among arbitrary subsets of mutations of all orders (pairwise, three-way, etc.
View Article and Find Full Text PDFA computer simulation is used to model ductal carcinoma in situ, a form of non-invasive breast cancer. The simulation uses known histological morphology, cell types, and stochastic cell proliferation to evolve tumorous growth within a duct. The ductal simulation is based on a hybrid cellular automaton design using genetic rules to determine each cell's behavior.
View Article and Find Full Text PDFA G2/M genetic network simulation is trained with tumor incidence data from knockout experiments. The genetic network is implemented using a neural network; knockout genotypes are simulated by removing nodes in the neural network. Two analyses are used to interpret the resulting network weights.
View Article and Find Full Text PDFIn this paper we introduce embedded landscapes as an extension of NK landscapes and MAXSAT problems. This extension is valid for problems where the representation can be expressed as a simple sum of subfunctions over subsets of the representation domain. This encompasses many additive constraint problems and problems expressed as the interaction of subcomponents, where the critical features of the subcomponents are represented by subsets of bits in the domain.
View Article and Find Full Text PDF