Gene Drive Dynamics in Natural Populations: The Importance of Density Dependence, Space, and Sex

The spread of synthetic gene drives is often discussed in the context of panmictic populations connected by gene flow and described with simple deterministic models. Under such assumptions, an entire species could be altered by releasing a single individual carrying an invasive gene drive, such as a standard homing drive. While this remains a theoretical possibility, gene drive spread in natural populations is more complex and merits a more realistic assessment. The fate of any gene drive released in a population would be inextricably linked to the population's ecology. Given the uncertainty often involved in ecological assessment of natural populations, understanding the sensitivity of gene drive spread to important ecological factors is critical. Here we review how different forms of density dependence, spatial heterogeneity, and mating behaviors can impact the spread of self-sustaining gene drives. We highlight specific aspects of gene drive dynamics and the target populations that need further research.

Geometric Lattice Structure of Covering and Its Application to Attribute Reduction through Matroids

The reduction of covering decision systems is an important problem in data mining, and covering-based rough sets serve as an efficient technique to process the problem. Geometric lattices have been widely used in many fields, especially greedy algorithm design which plays an important role in the reduction problems. Therefore, it is meaningful to combine coverings with geometric lattices to solve the optimization problems. In this paper, we obtain geometric lattices from coverings through matroids and then apply them to the issue of attribute reduction. First, a geometric lattice structure of a covering is constructed through transversal matroids. Then its atoms are studied and used to describe the lattice. Second, considering that all the closed sets of a finite matroid form a geometric lattice, we propose a dependence space through matroids and study the attribute reduction issues of the space, which realizes the application of geometric lattices to attribute reduction. Furthermore, a special type of information system is taken as an example to illustrate the application. In a word, this work points out an interesting view, namely, geometric lattice, to study the attribute reduction issues of information systems.

On Dependence in Wille’s Contexts

A concept in Wille’s context can be generated starting with a set of features. The problem of finding a minimal subset of the given set of features that generates the same concept as the given one is solved using a suitable dependence space and constructing reducts of one of its subsets. This result can be applied to information systems where it enables to cancel superfluous values of attributes.