Phylogeny of snake trypanosomes inferred by SSU rDNA sequences, their possible transmission by phlebotomines, and taxonomic appraisal by molecular, cross-infection and morphological analysis

Blood examination by microhaematocrit and haemoculture of 459 snakes belonging to 37 species revealed 24% trypanosome prevalence in species of Viperidae (Crotalus durissus and Bothrops jararaca) and Colubridae (Pseudoboa nigra). Trypanosome cultures from C. durissus and P. nigra were behaviourally and morphologically indistinguishable. In addition, the growth and morphological features of a trypanosome from the sand fly Viannaniyia tuberculata were similar to those of snake isolates. Cross-infection experiments revealed a lack of host restriction, as snakes of 3 species were infected with the trypanosome from C. durissus. Phylogeny based on ribosomal sequences revealed that snake trypanosomes clustered together with the sand fly trypanosome, forming a new phylogenetic lineage within Trypanosoma closest to a clade of lizard trypanosomes transmitted by sand flies dagger. The clade of trypanosomes from snakes and lizards suggests an association between the evolutionary histories of these trypanosomes and their squamate hosts. Moreover, data strongly indicated that these trypanosomes are transmitted by sand flies. The flaws of the current taxonomy of snake trypanosomes are discussed, and the need for molecular parameters to be adopted is emphasized. To our knowledge, this is the first molecular phylogenetic study of snake trypanosomes.

Base Revision for Ontology Debugging

Belief Revision deals with the problem of adding new information to a knowledge base in a consistent way. Ontology Debugging, on the other hand, aims to find the axioms in a terminological knowledge base which caused the base to become inconsistent. In this article, we propose a belief revision approach in order to find and repair inconsistencies in ontologies represented in some description logic (DL). As the usual belief revision operators cannot be directly applied to DLs, we propose new operators that can be used with more general logics and show that, in particular, they can be applied to the logics underlying OWL-DL and Lite.