Phylogenetic position of the acariform mites: sensitivity to homology assessment under total evidence

Background: Mites (Acari) have traditionally been treated as monophyletic, albeit composed of two major lineages: Acariformes and Parasitiformes. Yet recent studies based on morphology, molecular data, or combinations thereof, have increasingly drawn their monophyly into question. Furthermore, the usually basal (molecular) position of one or both mite lineages among the chelicerates is in conflict to their morphology, and to the widely accepted view that mites are close relatives of Ricinulei. Results: The phylogenetic position of the acariform mites is examined through employing SSU, partial LSU sequences, and morphology from 91 chelicerate extant terminals (forty Acariformes). In a static homology framework, molecular sequences were aligned using their secondary structure as guide, whereby regions of ambiguous alignment were discarded, and pre-aligned sequences analyzed under parsimony and different mixed models in a Bayesian inference. Parsimony and Bayesian analyses led to trees largely congruent concerning infraordinal, well-supported branches, but with low support for inter-ordinal relationships. An exception is Solifugae + Acariformes (P. P = 100%, J. = 0.91). In a dynamic homology framework, two analyses were run: a standard POY analysis and an analysis constrained by secondary structure. Both analyses led to largely congruent trees; supporting a (Palpigradi (Solifugae Acariformes)) clade and Ricinulei as sister group of Tetrapulmonata with the topology (Ricinulei (Amblypygi (Uropygi Araneae))). Combined analysis with two different morphological data matrices were run in order to evaluate the impact of constraining the analysis on the recovered topology when employing secondary structure as a guide for homology establishment. The constrained combined analysis yielded two topologies similar to the exclusively molecular analysis for both morphological matrices, except for the recovery of Pedipalpi instead of the (Uropygi Araneae) clade. The standard (direct optimization) POY analysis, however, led to the recovery of trees differing in the absence of the otherwise well-supported group Solifugae + Acariformes. Conclusions: Previous studies combining ribosomal sequences and morphology often recovered topologies similar to purely morphological analyses of Chelicerata. The apparent stability of certain clades not recovered here, like Haplocnemata and Acari, is regarded as a byproduct of the way the molecular homology was previously established using the instrumentalist approach implemented in POY. Constraining the analysis by a priori homology assessment is defended here as a way of maintaining the severity of the test when adding new data to the analysis. Although the strength of the method advocated here is keeping phylogenetic information from regions usually discarded in an exclusively static homology framework; it still has the inconvenience of being uninformative on the effect of alignment ambiguity on resampling methods of clade support estimation. Finally, putative morphological apomorphies of Solifugae + Acariformes are the reduction of the proximal cheliceral podomere, medial abutting of the leg coxae, loss of sperm nuclear membrane, and presence of differentiated germinative and secretory regions in the testis delivering their products into a common lumen.

Chrysotile effects on human lung cell carcinoma in culture: 3-D reconstruction and DNA quantification by image analysis

Background: Chrysotile is considered less harmful to human health than other types of asbestos fibers. Its clearance from the lung is faster and, in comparison to amphibole forms of asbestos, chrysotile asbestos fail to accumulate in the lung tissue due to a mechanism involving fibers fragmentation in short pieces. Short exposure to chrysotile has not been associated with any histopathological alteration of lung tissue. Methods: The present work focuses on the association of small chrysotile fibers with interphasic and mitotic human lung cancer cells in culture, using for analyses confocal laser scanning microscopy and 3D reconstructions. The main goal was to perform the analysis of abnormalities in mitosis of fibers-containing cells as well as to quantify nuclear DNA content of treated cells during their recovery in fiber-free culture medium. Results: HK2 cells treated with chrysotile for 48 h and recovered in additional periods of 24, 48 and 72 h in normal medium showed increased frequency of multinucleated and apoptotic cells. DNA ploidy of the cells submitted to the same chrysotile treatment schedules showed enhanced aneuploidy values. The results were consistent with the high frequency of multipolar spindles observed and with the presence of fibers in the intercellular bridge during cytokinesis. Conclusion: The present data show that 48 h chrysotile exposure can cause centrosome amplification, apoptosis and aneuploid cell formation even when long periods of recovery were provided. Internalized fibers seem to interact with the chromatin during mitosis, and they could also interfere in cytokinesis, leading to cytokinesis failure which forms aneuploid or multinucleated cells with centrosome amplification.

Spectra of identified high-p(T) pi(+/-) and p((p)over-bar ) in Cu + Cu collisions at root s(NN)=200 GeV

We report new results on identified (anti) proton and charged pion spectra at large transverse momenta (3 < p(T) < 10 GeV/c) from Cu + Cu collisions at root s(NN) = 200 GeV using the STAR detector at the Relativistic Heavy Ion Collider (RHIC). This study explores the system size dependence of two novel features observed at RHIC with heavy ions: the hadron suppression at high-p(T) and the anomalous baryon to meson enhancement at intermediate transverse momenta. Both phenomena could be attributed to the creation of a new form of QCD matter. The results presented here bridge the system size gap between the available pp and Au + Au data, and allow for a detailed exploration of the onset of the novel features. Comparative analysis of all available 200 GeV data indicates that the system size is a major factor determining both the magnitude of the hadron spectra suppression at large transverse momenta and the relative baryon to meson enhancement.

Communication structure of cortical networks

Large-scale cortical networks exhibit characteristic topological properties that shape communication between brain regions and global cortical dynamics. Analysis of complex networks allows the description of connectedness, distance, clustering, and centrality that reveal different aspects of how the network's nodes communicate. Here, we focus on a novel analysis of complex walks in a series of mammalian cortical networks that model potential dynamics of information flow between individual brain regions. We introduce two new measures called absorption and driftness. Absorption is the average length of random walks between any two nodes, and takes into account all paths that may diffuse activity throughout the network. Driftness is the ratio between absorption and the corresponding shortest path length. For a given node of the network, we also define four related measurements, namely in-and out-absorption as well as in-and out-driftness, as the averages of the corresponding measures from all nodes to that node, and from that node to all nodes, respectively. We find that the cat thalamo-cortical system incorporates features of two classic network topologies, Erdos-Renyi graphs with respect to in-absorption and in-driftness, and configuration models with respect to out-absorption and out-driftness. Moreover, taken together these four measures separate the network nodes based on broad functional roles (visual, auditory, somatomotor, and frontolimbic).

Gene Expression Complex Networks: Synthesis, Identification, and Analysis

Thanks to recent advances in molecular biology, allied to an ever increasing amount of experimental data, the functional state of thousands of genes can now be extracted simultaneously by using methods such as cDNA microarrays and RNA-Seq. Particularly important related investigations are the modeling and identification of gene regulatory networks from expression data sets. Such a knowledge is fundamental for many applications, such as disease treatment, therapeutic intervention strategies and drugs design, as well as for planning high-throughput new experiments. Methods have been developed for gene networks modeling and identification from expression profiles. However, an important open problem regards how to validate such approaches and its results. This work presents an objective approach for validation of gene network modeling and identification which comprises the following three main aspects: (1) Artificial Gene Networks (AGNs) model generation through theoretical models of complex networks, which is used to simulate temporal expression data; (2) a computational method for gene network identification from the simulated data, which is founded on a feature selection approach where a target gene is fixed and the expression profile is observed for all other genes in order to identify a relevant subset of predictors; and (3) validation of the identified AGN-based network through comparison with the original network. The proposed framework allows several types of AGNs to be generated and used in order to simulate temporal expression data. The results of the network identification method can then be compared to the original network in order to estimate its properties and accuracy. Some of the most important theoretical models of complex networks have been assessed: the uniformly-random Erdos-Renyi (ER), the small-world Watts-Strogatz (WS), the scale-free Barabasi-Albert (BA), and geographical networks (GG). The experimental results indicate that the inference method was sensitive to average degree k variation, decreasing its network recovery rate with the increase of k. The signal size was important for the inference method to get better accuracy in the network identification rate, presenting very good results with small expression profiles. However, the adopted inference method was not sensible to recognize distinct structures of interaction among genes, presenting a similar behavior when applied to different network topologies. In summary, the proposed framework, though simple, was adequate for the validation of the inferred networks by identifying some properties of the evaluated method, which can be extended to other inference methods.

Inference of gene regulatory networks from time series by Tsallis entropy

Background: The inference of gene regulatory networks (GRNs) from large-scale expression profiles is one of the most challenging problems of Systems Biology nowadays. Many techniques and models have been proposed for this task. However, it is not generally possible to recover the original topology with great accuracy, mainly due to the short time series data in face of the high complexity of the networks and the intrinsic noise of the expression measurements. In order to improve the accuracy of GRNs inference methods based on entropy (mutual information), a new criterion function is here proposed. Results: In this paper we introduce the use of generalized entropy proposed by Tsallis, for the inference of GRNs from time series expression profiles. The inference process is based on a feature selection approach and the conditional entropy is applied as criterion function. In order to assess the proposed methodology, the algorithm is applied to recover the network topology from temporal expressions generated by an artificial gene network (AGN) model as well as from the DREAM challenge. The adopted AGN is based on theoretical models of complex networks and its gene transference function is obtained from random drawing on the set of possible Boolean functions, thus creating its dynamics. On the other hand, DREAM time series data presents variation of network size and its topologies are based on real networks. The dynamics are generated by continuous differential equations with noise and perturbation. By adopting both data sources, it is possible to estimate the average quality of the inference with respect to different network topologies, transfer functions and network sizes. Conclusions: A remarkable improvement of accuracy was observed in the experimental results by reducing the number of false connections in the inferred topology by the non-Shannon entropy. The obtained best free parameter of the Tsallis entropy was on average in the range 2.5 <= q <= 3.5 (hence, subextensive entropy), which opens new perspectives for GRNs inference methods based on information theory and for investigation of the nonextensivity of such networks. The inference algorithm and criterion function proposed here were implemented and included in the DimReduction software, which is freely available at http://sourceforge.net/projects/dimreduction and http://code.google.com/p/dimreduction/.

Genome-Wide Detection of Serpentine Receptor-Like Proteins in Malaria Parasites

Serpentine receptors comprise a large family of membrane receptors distributed over diverse organisms, such as bacteria, fungi, plants and all metazoans. However, the presence of serpentine receptors in protozoan parasites is largely unknown so far. In the present study we performed a genome-wide search for proteins containing seven transmembrane domains (7TM) in the human malaria parasite Plasmodium falciparum and identified four serpentine receptor-like proteins. These proteins, denoted PfSR1, PfSR10, PfSR12 and PfSR25, show membrane topologies that resemble those exhibited by members belonging to different families of serpentine receptors. Expression of the pfsrs genes was detected by Real Time PCR in P. falciparum intraerythrocytic stages, indicating that they potentially code for functional proteins. We also found corresponding homologues for the PfSRs in five other Plasmodium species, two primate and three rodent parasites. PfSR10 and 25 are the most conserved receptors among the different species, while PfSR1 and 12 are more divergent. Interestingly, we found that PfSR10 and PfSR12 possess similarity to orphan serpentine receptors of other organisms. The identification of potential parasite membrane receptors raises a new perspective for essential aspects of malaria parasite host cell infection.

1-(4-Bromophenyl)-2-ethylsulfinyl-2-(phenylselanyl)ethanone monohydrate

In the title hydrate, C(16)H(15)BrO(2)SSe center dot H(2)O, the sulfinyl O atom lies on the opposite side of the molecule to the Se and carbonyl O atoms. The benzene rings form a dihedral angle of 51.66 (17)degrees and are splayed with respect to each other. The observed conformation allows the water molecules to bridge sulfinyl O atoms via O-H center dot center dot center dot O hydrogen bonds, generating a linear supramolecular chain along the b axis; the chain is further stabilized by C-H center dot center dot center dot O contacts. The chains are held in place in the crystal structure by C center dot center dot center dot H center dot center dot center dot pi and C-Br center dot center dot center dot pi interactions.

Analysis of Single-Nucleotide Polymorphisms in the crt-o and mdr1 Genes of Plasmodium vivax among Chloroquine-Resistant Isolates from the Brazilian Amazon Region

Plasmodium vivax parasites with chloroquine resistance (CQR) are already circulating in the Brazilian Amazon. Complete single-nucleotide polymorphism (SNP) analyses of coding and noncoding sequences of the pvmdr1 and pvcrt-o genes revealed no associations with CQR, even if some mutations had not been randomly selected. In addition, striking differences in the topologies and numbers of SNPs in these transporter genes between P. vivax and P. falciparum reinforce the idea that mechanisms other than mutations may explain this virulent phenotype in P. vivax.

Skewness, splitting number and vertex deletion of some toroidal meshes

The skewness sk(G) of a graph G = (V, E) is the smallest integer sk(G) >= 0 such that a planar graph can be obtained from G by the removal of sk(C) edges. The splitting number sp(G) of C is the smallest integer sp(G) >= 0 such that a planar graph can be obtained from G by sp(G) vertex splitting operations. The vertex deletion vd(G) of G is the smallest integer vd(G) >= 0 such that a planar graph can be obtained from G by the removal of vd(G) vertices. Regular toroidal meshes are popular topologies for the connection networks of SIMD parallel machines. The best known of these meshes is the rectangular toroidal mesh C(m) x C(n) for which is known the skewness, the splitting number and the vertex deletion. In this work we consider two related families: a triangulation Tc(m) x c(n) of C(m) x C(n) in the torus, and an hexagonal mesh Hc(m) x c(n), the dual of Tc(m) x c(n) in the torus. It is established that sp(Tc(m) x c(n)) = vd(Tc(m) x c(n) = sk(Hc(m) x c(n)) = sp(Hc(m) x c(n)) = vd(Hc(m) x c(n)) = min{m, n} and that sk(Tc(m) x c(n)) = 2 min {m, n}.

Charles Darwin goes to school: the role of cartoons and narrative in setting science in an historical context

Science education is under revision. Recent changes in society require changes in education to respond to new demands. Scientific literacy can be considered a new goal of science education and the epistemological gap between natural sciences and literacy disciplines must be overcome. The history of science is a possible bridge to link these `two cultures` and to foster an interdisciplinary approach in the classroom. This paper acknowledges Darwin`s legacy and proposes the use of cartoons and narrative expositions to put this interesting chapter of science into its historical context. A five-lesson didactic sequence was developed to tell part of the story of Darwin`s expedition through South America for students from 10 to 12 years of age. Beyond geological and biological perspectives, the inclusion of historical, social and geographical facts demonstrated the beauty and complexity of the findings that Darwin employed to propose the theory of evolution.

Reconfiguration of distribution networks to minimize loss and disruption costs using genetic algorithms

In this paper a computational implementation of an evolutionary algorithm (EA) is shown in order to tackle the problem of reconfiguring radial distribution systems. The developed module considers power quality indices such as long duration interruptions and customer process disruptions due to voltage sags, by using the Monte Carlo simulation method. Power quality costs are modeled into the mathematical problem formulation, which are added to the cost of network losses. As for the EA codification proposed, a decimal representation is used. The EA operators, namely selection, recombination and mutation, which are considered for the reconfiguration algorithm, are herein analyzed. A number of selection procedures are analyzed, namely tournament, elitism and a mixed technique using both elitism and tournament. The recombination operator was developed by considering a chromosome structure representation that maps the network branches and system radiality, and another structure that takes into account the network topology and feasibility of network operation to exchange genetic material. The topologies regarding the initial population are randomly produced so as radial configurations are produced through the Prim and Kruskal algorithms that rapidly build minimum spanning trees. (C) 2009 Elsevier B.V. All rights reserved.

Comparison Between Voltage Control Structures of Synchronous Machines

This paper compares the behaviour of two different control structures of automatic voltage regulators of synchronous machines equipped with static excitation systems. These systems have a fully controlled thyristor bridge that supplies DC current to the rotor winding. The rectifier bridge is fed by the stator terminals through a step-down transformer. The first control structure, named ""Direct Control"", has a single proportional-integral (PI) regulator that compares stator voltage setpoint with measured voltage and acts directly on the thyristor bridge`s firing angle. This control structure is usually employed in commercial excitation systems for hydrogenerators. The second structure, named ""Cascade Control"", was inspired on control loops of commercial DC motor drives. Such drives employ two PIs in a cascade arrangement, the external PI deals with the motor speed while the internal one regulates the armature current. In the adaptation proposed, the external PI compares setpoint with the actual stator voltage and produces the setpoint to the internal PI-loop which controls the field current.

Comparison of adsorbent films obtained by plasma polymerization of oxygenated organic compounds

Thin films obtained by plasma polymerization of ethyl ether, methyl or ethyl acetate, acetaldehyde, acetone and 2-propanol were compared. Infrared spectroscopy (FFIR), resistance to chemicals, contact angle measurements, X-ray photoelectron spectroscopy (XPS), optical and scanning electron microscopy (SEM), and quartz crystal microbalance (QCM) were carried out. For all films FTIR showed high intensity for polar bonds yet the films are not resistant to polar solvents. Contact angle measurements revealed hydrophilic and organophilic surfaces and XPS pointed out a high proportion of oxygenated bonds. All films showed good step coverage and peeling was significant only with acetone and 2-propanol. All films are adsorbent for organic compounds in a large scale of polarity but acetaldehyde and 2-propanol act like a selective membrane. Also, deposition of these films on hydrophobic substrates leads to island formation. A possible model to explain the results must consider the hydrogen bridge formation on 2-propanol and acetaldehyde films. Ethyl ether, ethyl and methyl acetate showed good characteristics for development of sensor and sample pretreatment using miniaturized devices. (C) 2007 Elsevier B.V. All rights reserved.

The choice of the best among the shortest routes in transparent optical networks

This work introduces the problem of the best choice among M combinations of the shortest paths for dynamic provisioning of lightpaths in all-optical networks. To solve this problem in an optimized way (shortest path and load balance), a new fixed routing algorithm, named Best among the Shortest Routes (BSR), is proposed. The BSR`s performance is compared in terms of blocking probability and network utilization with Dijkstra`s shortest path algorithm and others algorithms proposed in the literature. The evaluated scenarios include several representative topologies for all-optical networking and different wavelength conversion architectures. For all studied scenarios, BSR achieved superior performance. (C) 2010 Elsevier B.V. All rights reserved.