The distribution of lectins across the phylum Nematoda : a genome-wide search

Nematodes are a very diverse phylum that has adapted to nearly every ecosystem. They have developed specialized lifestyles, dividing the phylum into free-living, animal, and plant parasitic species. Their sheer abundance in numbers and presence in nearly every ecosystem make them the most prevalent animals on earth. In this research nematode-specific profiles were designed to retrieve predicted lectin-like domains from the sequence data of nematode genomes and transcriptomes. Lectins are carbohydrate-binding proteins that play numerous roles inside and outside the cell depending on their sugar specificity and associated protein domains. The sugar-binding properties of the retrieved lectin-like proteins were predicted in silico. Although most research has focused on C-type lectin-like, galectin-like, and calreticulin-like proteins in nematodes, we show that the lectin-like repertoire in nematodes is far more diverse. We focused on C-type lectins, which are abundantly present in all investigated nematode species, but seem to be far more abundant in free-living species. Although C-type lectin-like proteins are omnipresent in nematodes, we have shown that only a small part possesses the residues that are thought to be essential for carbohydrate binding. Curiously, hevein, a typical plant lectin domain not reported in animals before, was found in some nematode species

Parallel functional and stoichiometric trait shifts in South American and African forest communities with elevation

The Amazon and Congo basins are the two largest continuous blocks of tropical forest with a central role for global biogeochemical cycles and ecology. However, both biomes differ in structure and species richness and composition. Understanding future directions of the response of both biomes to environmental change is paramount. We used one elevational gradient on both continents to investigate functional and stoichiometric trait shifts of tropical forest in South America and Africa. We measured community-weighted functional canopy traits and canopy and topsoil delta N-15 signatures. We found that the functional forest composition response along both transects was parallel, with a shift towards more nitrogen-conservative species at higher elevations. Moreover, canopy and topsoil delta N-15 signals decreased with increasing altitude, suggesting a more conservative N cycle at higher elevations. This cross-continental study provides empirical indications that both South American and African tropical forest show a parallel response with altitude, driven by nitrogen availability along the elevational gradients, which in turn induces a shift in the functional forest composition. More standardized research, and more research on other elevational gradients is needed to confirm our observations

Characterizing and Extending Answer Set Semantics using Possibility Theory

Answer Set Programming (ASP) is a popular framework for modeling combinatorial problems. However, ASP cannot easily be used for reasoning about uncertain information. Possibilistic ASP (PASP) is an extension of ASP that combines possibilistic logic and ASP. In PASP a weight is associated with each rule, where this weight is interpreted as the certainty with which the conclusion can be established when the body is known to hold. As such, it allows us to model and reason about uncertain information in an intuitive way. In this paper we present new semantics for PASP, in which rules are interpreted as constraints on possibility distributions. Special models of these constraints are then identified as possibilistic answer sets. In addition, since ASP is a special case of PASP in which all the rules are entirely certain, we obtain a new characterization of ASP in terms of constraints on possibility distributions. This allows us to uncover a new form of disjunction, called weak disjunction, that has not been previously considered in the literature. In addition to introducing and motivating the semantics of weak disjunction, we also pinpoint its computational complexity. In particular, while the complexity of most reasoning tasks coincides with standard disjunctive ASP, we find that brave reasoning for programs with weak disjunctions is easier.Comment: 39 pages and 16 pages appendix with proofs. This article has been accepted for publication in Theory and Practice of Logic Programming, Copyright Cambridge University Pres

Two new species of Cyperus (Cyperaceae) from the Zambezian region of Africa

Cyperus absconditicoronatus Banters, Reynders & Goetgh. and C. unispicatus Banters, Reynders & Goetgh., two new species of Cyperus L. (Cyperaceae) from Angola and Zambia, are recognized. Cyperus absconditicoronatus is a tall species (55-100 cm) characterized by a scaled rhizome, a single terminal capitulum, a ciliated spikelet bract, and deciduous spikelets. Cyperus unispicatus can be recognized by a swollen and fibrous stem base growing from slender rhizomes, a single terminal spike, and short involucral bracts. The taxa are described and illustrated, and differences with the closest resembling species are discussed

Towards possibilistic fuzzy answer set programming

Fuzzy answer set programming (FASP) is a generalization of answer set programming to continuous domains. As it can not readily take uncertainty into account, however, FASP is not suitable as a basis for approximate reasoning and cannot easily be used to derive conclusions from imprecise information. To cope with this, we propose an extension of FASP based on possibility theory. The resulting framework allows us to reason about uncertain information in continuous domains, and thus also about information that is imprecise or vague. We propose a syntactic procedure, based on an immediate consequence operator, and provide a characterization in terms of minimal models, which allows us to straightforwardly implement our framework using existing FASP solvers

Communicating answer set programs

Answer set programming i s a form of declarative programming that has proven very successful in succinctly formulating and solving complex problems. Although mechanisms for representing and reasoning with the combined answer set programs of multiple agents have already been proposed, the actual gain in expressivity when adding communication has not been thoroughly studied. We show that allowing simple programs to talk to each other results in the same expressivity as adding negation-as-failure. Furthermore, we show that the ability to focus on one program in a network of simple programs results in the same expressivity as adding disjunction in the head of the rules