Carios fonsecai sp nov (Acari, Argasidae), a bat tick from the central-western region of Brazil

Males, females, and larvae of Carios fonsecai sp. nov. are described from free-living ticks collected in a cave at Bonito, state of Mato Grosso do Sul, Brazil. The presence of cheeks and legs with micromammillate cuticle makes adults of C. fonsecai morphologically related to a group of argasid species (mostly bat-associated) formerly classified into the subgenus Alectorobius, genus Ornithodoros. Examination of larvae indicates that C. fonsecai is clearly distinct from most of the previously described Carios species formerly classified into the subgenus Alectorobius, based primarily on its larger body size, dorsal setae number, dorsal plate shape, and hypostomal morphology. On the other hand, the larva of C. fonsecai is most similar to Carios peropteryx, and Carios peruvianus, from which differences in dorsal plate length and width, tarsal setae, and hypostome characteristics are useful for morphological differentiation. The mitochondrial 16S rDNA sequence of C. fonsecai showed to be closest (85-88% identity) to several corresponding sequences of different Carios species available in GenBank. Bats identified as Peropteryx macrotis and Desmodus rotundus were found infested by C. fonsecai larvae in the same cave where the type series was collected. C. fonsecai showed to be aggressive to humans in the laboratory.

An architectonic comparison of the ventrobasal complex of two Megachiropteran and one Microchiropteran bat: implications for the evolution of Chiroptera

The architectonic features of the thalamic ventrobasal complex (Vb) of two species of Megachiropteran (Grey-headed flying fox, Pteropus poliocephalus, and the Eastern tube-nosed bat, Nyctimene robinsoni) are compared with those of a Microchiropteran (Australian ghost bat, Macroderma gigas). The somatosensory system was chosen for comparison as it represents a sensory system that has undergone analogous modifications in both Chiropteran lineages (the evolution of the wing). The components of Vb were examined as there are taxon-specific features in this region of the brain. Within the Megachiropteran Vb, four subnuclei were recognized: the ventral posterior medial (VPM), the ventral posterior lateral (VPL), the ventral posterior inferior (VPI), and the basal ventral medial (VMb). In the ghost bat only VPM and VPL were identified with certainty. No VPI was evident in the ghost bat, however a putative VMb was observed. Vb of the ghost bat also lacked the arcuate lamina, which distinguishes VPM from VPL in the Megachiropterans and many other mammals. These taxon-specific differences lend support to the proposal that the order Chiroptera has a diphyletic origin.

Generation of eigenstates using the phase-estimation algorithm

The phase estimation algorithm is so named because it allows an estimation of the eigenvalues associated with an operator. However, it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this proposal for small quantum systems, identifying the conditions under which the phase-estimation algorithm can successfully generate eigenstates. We then propose an implementation scheme based on an ion trap quantum computer. This scheme allows us to illustrate two simple examples, one in which the algorithm effectively generates eigenstates, and one in which it does not.

Mark-recapture may reveal more about ecology than about population trends: Demography of a threatened ghost bat (Macroderma gigas) population

Since European settlement in Australia, the geographical range of ghost bats (Macroderma gigas) has contracted northwards. Ghost bats are thought to occur in disjunct populations with little interpopulation migration, raising concerns over the current status and future viability of the southernmost colony, which has also been threatened by mining activity. To address these concerns, demographic parameters of the southernmost colony were estimated from a mark-recapture study conducted during 1975-1981. Female bats gave birth to a single young in late spring, but only 40% (22-70%, 95% CI) of females bred in their second year, increasing to 93% (87-97%, 95% CI) for females greater than or equal to 2 years old. Sixty-five percent of juveniles caught were female. Annual adult survival ranged between 0.57-0.77 for females and 0.43-0.66 for males, and was lowest over winter-spring and greatest in autumn-winter. Juvenile survival for the first year ranged between 0.35-0.46 for females and 0.29-0.42 for males. Adult survival varied among seasons, was negatively associated with rainfall, but was not associated with temperature beyond being lower in late winter. Poor survival may result from the inferior daytime roosts that bats must use if water seepage forces them to leave their normal roosts. Although these age-specific rates of fecundity and survival suggested a declining population, mark-recapture estimates of the population trend indicated stability over the study period. Counts at daytime roosts also suggested a population decline, but were considered unreliable because of an increasing tendency of bats to avoid detection. It is therefore likely that some assumptions in estimating survival were violated. These results provide a caution against the uncritical use of population projections derived from mark-recapture estimates of demographic parameters, and the use of untested indices as the basis for conservation decisions.

An algorithm to predict 3 ' intron splice sites in Plasmodium falciparum genomic sequences

A new algorithm, PfAGSS, for predicting 3' splice sites in Plasmodium falciparum genomic sequences is described. Application of this program to the published P. falciparum chromosome 2 and 3 data suggests that existing programs result in a high error rate in assigning 3' intron boundaries. (C) 2001 Elsevier Science B.V. All rights reserved.

A simulated annealing algorithm for finding consensus sequences

Motivation: A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules. Results: This paper describes a new algorithm for finding a consensus sequence, using the popular optimization method known as simulated annealing. Unlike the conventional approach of finding a consensus sequence by first forming a multiple sequence alignment, this algorithm searches for a sequence that minimises the sum of pairwise distances to each of the input sequences. The resulting consensus sequence can then be used to induce a multiple sequence alignment. The time required by the algorithm scales linearly with the number of input sequences and quadratically with the length of the consensus sequence. We present results demonstrating the high quality of the consensus sequences and alignments produced by the new algorithm. For comparison, we also present similar results obtained using ClustalW. The new algorithm outperforms ClustalW in many cases.

A monolithic smoothing-gap algorithm for contact-impact based on the signed distance function

A new algorithm has been developed for smoothing the surfaces in finite element formulations of contact-impact. A key feature of this method is that the smoothing is done implicitly by constructing smooth signed distance functions for the bodies. These functions are then employed for the computation of the gap and other variables needed for implementation of contact-impact. The smoothed signed distance functions are constructed by a moving least-squares approximation with a polynomial basis. Results show that when nodes are placed on a surface, the surface can be reproduced with an error of about one per cent or less with either a quadratic or a linear basis. With a quadratic basis, the method exactly reproduces a circle or a sphere even for coarse meshes. Results are presented for contact problems involving the contact of circular bodies. Copyright (C) 2002 John Wiley Sons, Ltd.

A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search. (C) 2002 Elsevier Science Ltd. All rights reserved.

An augmented Lanczos algorithm for the efficient computation of a dot-product of a function of a large sparse symmetric matrix

The Lanczos algorithm is appreciated in many situations due to its speed. and economy of storage. However, the advantage that the Lanczos basis vectors need not be kept is lost when the algorithm is used to compute the action of a matrix function on a vector. Either the basis vectors need to be kept, or the Lanczos process needs to be applied twice. In this study we describe an augmented Lanczos algorithm to compute a dot product relative to a function of a large sparse symmetric matrix, without keeping the basis vectors.

The tree cut and merge algorithm for estimation of network reliability

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.