Genetic algorithms for continuous optimization problems - a concept of parameter-space size adjustment

The concept of parameter-space size adjustment is pn,posed in order to enable successful application of genetic algorithms to continuous optimization problems. Performance of genetic algorithms with six different combinations of selection and reproduction mechanisms, with and without parameter-space size adjustment, were severely tested on eleven multiminima test functions. An algorithm with the best performance was employed for the determination of the model parameters of the optical constants of Pt, Ni and Cr.

Gag-Pol supplied in trans is efficiently packaged and supports viral function in human immunodeficiency virus type 1

The intracellular trafficking and subsequent incorporation of Gag-Pol into human immunodeficiency virus type 1 (HIV-1) remains poorly defined. Gag-Pol is encoded by the same mRNA as Gag and is generated by ribosomal frameshifting. The multimerization of Gag and Gag-Pol is an essential step in the formation of infectious viral particles. In this study, we examined whether the interaction between Gag and Gag-Pol is initiated during protein translation in order to facilitate the trafficking and subsequent packaging of Gag-Pol into the virion. A conditional cotransfection system was developed in which virion formation required the coexpression of two HIV-1-based plasmids, one that produces both Gag and Gag-Pol and one that only produces Gag-Pol. The Gag-Pol proteins were either immunotagged with a His epitope or functionally tagged with a mutation (K65R) in reverse transcriptase that is associated with drug resistance. Gag-Pol packaging was assessed to determine whether the Gag-Pol incorporated into the virion was preferentially packaged from the plasmid that expressed both Gag and Gag-Pol or whether it could be packaged from either plasmid. Our data show that translation of Gag and Gag-Pol from the same mRNA is not critical for virion packaging of the Gag-Pol polyprotein or for viral function.

Characterization of the retinoid orphan-related receptor-alpha coactivator binding interface: A structural basis for ligand-independent transcription

The retinoid orphan-related receptor-alpha (RORalpha) is a member of the ROR subfamily of orphan receptors and acts as a constitutive activator of transcription in the absence of exogenous ligands. To understand the basis of this activity, we constructed a homology model of Rill using the closely related TRbeta as a template. Molecular modeling suggested that bulky hydrophobic side chains occupy the RORa ligand cavity leaving a small but distinct cavity that may be involved in receptor stabilization. This model was subject to docking simulation with a receptor-interacting peptide from the steroid receptor coactivator, GR-interacting protein-1, which delineated a coactivator binding surface consisting of the signature motif spanning helices 3-5 and helix 12 [activation function 2 (AF2)]. Probing this surface with scanning alanine mutagenesis showed structural and functional equivalence between homologous residues of RORalpha and TRbeta. This was surprising (given that Rill is a ligand-independent activator, whereas TRbeta has an absolute requirement for ligand) and prompted us to use molecular modeling to identify differences between Rill and TRbeta in the way that the All helix interacts with the rest of the receptor. Modeling highlighted a nonconserved amino acid in helix 11 of RORa (Phe491) and a short-length of 3.10 helix at the N terminus of AF2 which we suggest i) ensures that AF2 is locked permanently in the holoconformation described for other liganded receptors and thus 2) enables ligand-independent recruitment of coactivators. Consistent with this, mutation of RORa Phe491 to either methionine or alanine (methionine is the homologous residue in TRbeta), reduced and ablated transcriptional activation and recruitment of coactivators, respectively. Furthermore, we were able to reconstitute transcriptional activity for both a deletion mutant of Ill lacking All and Phe491 Met, by overexpression of a GAL-AF2 fusion protein, demonstrating ligand-independent recruitment of AF2 and a role for Phe491 in recruiting AF2.

Full S matrix calculation via a single real-symmetric Lanczos recursion: The Lanczos artificial boundary inhomogeneity method

We present an efficient and robust method for the calculation of all S matrix elements (elastic, inelastic, and reactive) over an arbitrary energy range from a single real-symmetric Lanczos recursion. Our new method transforms the fundamental equations associated with Light's artificial boundary inhomogeneity approach [J. Chem. Phys. 102, 3262 (1995)] from the primary representation (original grid or basis representation of the Hamiltonian or its function) into a single tridiagonal Lanczos representation, thereby affording an iterative version of the original algorithm with greatly superior scaling properties. The method has important advantages over existing iterative quantum dynamical scattering methods: (a) the numerically intensive matrix propagation proceeds with real symmetric algebra, which is inherently more stable than its complex symmetric counterpart; (b) no complex absorbing potential or real damping operator is required, saving much of the exterior grid space which is commonly needed to support these operators and also removing the associated parameter dependence. Test calculations are presented for the collinear H+H-2 reaction, revealing excellent performance characteristics. (C) 2004 American Institute of Physics.

Prediction of protein B-factor profiles

The polypeptide backbones and side chains of proteins are constantly moving due to thermal motion and the kinetic energy of the atoms. The B-factors of protein crystal structures reflect the fluctuation of atoms about their average positions and provide important information about protein dynamics. Computational approaches to predict thermal motion are useful for analyzing the dynamic properties of proteins with unknown structures. In this article, we utilize a novel support vector regression (SVR) approach to predict the B-factor distribution (B-factor profile) of a protein from its sequence. We explore schemes for encoding sequences and various settings for the parameters used in SVR. Based on a large dataset of high-resolution proteins, our method predicts the B-factor distribution with a Pearson correlation coefficient (CC) of 0.53. In addition, our method predicts the B-factor profile with a CC of at least 0.56 for more than half of the proteins. Our method also performs well for classifying residues (rigid vs. flexible). For almost all predicted B-factor thresholds, prediction accuracies (percent of correctly predicted residues) are greater than 70%. These results exceed the best results of other sequence-based prediction methods. (C) 2005 Wiley-Liss, Inc.

Multigradient field-active contour model for multilayer boundary detection of ultrasound rectal wall image

Extraction and reconstruction of rectal wall structures from an ultrasound image is helpful for surgeons in rectal clinical diagnosis and 3-D reconstruction of rectal structures from ultrasound images. The primary task is to extract the boundary of the muscular layers on the rectal wall. However, due to the low SNR from ultrasound imaging and the thin muscular layer structure of the rectum, this boundary detection task remains a challenge. An active contour model is an effective high-level model, which has been used successfully to aid the tasks of object representation and recognition in many image-processing applications. We present a novel multigradient field active contour algorithm with an extended ability for multiple-object detection, which overcomes some limitations of ordinary active contour models—"snakes." The core part in the algorithm is the proposal of multigradient vector fields, which are used to replace image forces in kinetic function for alternative constraints on the deformation of active contour, thereby partially solving the initialization limitation of active contour for rectal wall boundary detection. An adaptive expanding force is also added to the model to help the active contour go through the homogenous region in the image. The efficacy of the model is explained and tested on the boundary detection of a ring-shaped image, a synthetic image, and an ultrasound image. The experimental results show that the proposed multigradient field-active contour is feasible for multilayer boundary detection of rectal wall

Hyperspace geography: Visualizing fitness landscapes beyond 4D

Human perception is finely tuned to extract structure about the 4D world of time and space as well as properties such as color and texture. Developing intuitions about spatial structure beyond 4D requires exploiting other perceptual and cognitive abilities. One of the most natural ways to explore complex spaces is for a user to actively navigate through them, using local explorations and global summaries to develop intuitions about structure, and then testing the developing ideas by further exploration. This article provides a brief overview of a technique for visualizing surfaces defined over moderate-dimensional binary spaces, by recursively unfolding them onto a 2D hypergraph. We briefly summarize the uses of a freely available Web-based visualization tool, Hyperspace Graph Paper (HSGP), for exploring fitness landscapes and search algorithms in evolutionary computation. HSGP provides a way for a user to actively explore a landscape, from simple tasks such as mapping the neighborhood structure of different points, to seeing global properties such as the size and distribution of basins of attraction or how different search algorithms interact with landscape structure. It has been most useful for exploring recursive and repetitive landscapes, and its strength is that it allows intuitions to be developed through active navigation by the user, and exploits the visual system's ability to detect pattern and texture. The technique is most effective when applied to continuous functions over Boolean variables using 4 to 16 dimensions.

Summarizing level-two topological relations in large spatial datasets

Summarizing topological relations is fundamental to many spatial applications including spatial query optimization. In this article, we present several novel techniques to effectively construct cell density based spatial histograms for range (window) summarizations restricted to the four most important level-two topological relations: contains, contained, overlap, and disjoint. We first present a novel framework to construct a multiscale Euler histogram in 2D space with the guarantee of the exact summarization results for aligned windows in constant time. To minimize the storage space in such a multiscale Euler histogram, an approximate algorithm with the approximate ratio 19/12 is presented, while the problem is shown NP-hard generally. To conform to a limited storage space where a multiscale histogram may be allowed to have only k Euler histograms, an effective algorithm is presented to construct multiscale histograms to achieve high accuracy in approximately summarizing aligned windows. Then, we present a new approximate algorithm to query an Euler histogram that cannot guarantee the exact answers; it runs in constant time. We also investigate the problem of nonaligned windows and the problem of effectively partitioning the data space to support nonaligned window queries. Finally, we extend our techniques to 3D space. Our extensive experiments against both synthetic and real world datasets demonstrate that the approximate multiscale histogram techniques may improve the accuracy of the existing techniques by several orders of magnitude while retaining the cost efficiency, and the exact multiscale histogram technique requires only a storage space linearly proportional to the number of cells for many popular real datasets.

Cluster analysis of the p53 genetic regulatory network: topology and biology

We describe a network module detection approach which combines a rapid and robust clustering algorithm with an objective measure of the coherence of the modules identified. The approach is applied to the network of genetic regulatory interactions surrounding the tumor suppressor gene p53. This algorithm identifies ten clusters in the p53 network, which are visually coherent and biologically plausible.

Multiscale histograms: Summarizing topological relations in large spatial datasets

Summarizing topological relations is fundamental to many spatial applications including spatial query optimization. In this paper, we present several novel techniques to eectively construct cell density based spatial histograms for range (window) summarizations restricted to the four most important topological relations: contains, contained, overlap, and disjoint. We rst present a novel framework to construct a multiscale histogram composed of multiple Euler histograms with the guarantee of the exact summarization results for aligned windows in constant time. Then we present an approximate algorithm, with the approximate ratio 19/12, to minimize the storage spaces of such multiscale Euler histograms, although the problem is generally NP-hard. To conform to a limited storage space where only k Euler histograms are allowed, an effective algorithm is presented to construct multiscale histograms to achieve high accuracy. Finally, we present a new approximate algorithm to query an Euler histogram that cannot guarantee the exact answers; it runs in constant time. Our extensive experiments against both synthetic and real world datasets demonstrated that the approximate mul- tiscale histogram techniques may improve the accuracy of the existing techniques by several orders of magnitude while retaining the cost effciency, and the exact multiscale histogram technique requires only a storage space linearly proportional to the number of cells for the real datasets.

Comment on "Grover search with pairs of trapped ions"

In this Comment on Feng's paper [Phys. Rev. A 63, 052308 (2001)], we show that Grover's algorithm may be performed exactly using the gate set given, provided that small changes are made to the gate sequence. An analytic expression for the probability of success of Grover's algorithm for any unitary operator U instead of Hadamard gate is presented.

Sampling phylogenetic tree space with the generalized Gibbs sampler

The generalized Gibbs sampler (GGS) is a recently developed Markov chain Monte Carlo (MCMC) technique that enables Gibbs-like sampling of state spaces that lack a convenient representation in terms of a fixed coordinate system. This paper describes a new sampler, called the tree sampler, which uses the GGS to sample from a state space consisting of phylogenetic trees. The tree sampler is useful for a wide range of phylogenetic applications, including Bayesian, maximum likelihood, and maximum parsimony methods. A fast new algorithm to search for a maximum parsimony phylogeny is presented, using the tree sampler in the context of simulated annealing. The mathematics underlying the algorithm is explained and its time complexity is analyzed. The method is tested on two large data sets consisting of 123 sequences and 500 sequences, respectively. The new algorithm is shown to compare very favorably in terms of speed and accuracy to the program DNAPARS from the PHYLIP package.

Mutational analysis of the cystathionine beta-synthase gene: A splicing mutation, two missense mutations and an insertion in patients with homocystinuria

RT-PCR and direct sequence analyses were used to define mutations in the cystathionine beta-synthase (CBS) gene in two unrelated male patients with vitamin B6 nonresponsive homocystinuria. Both patients were compound heterozygotes for CBS alleles containing point mutations. One patient had a maternally derived G-->A transition in the splice-donor site of intron 1, resulting in aberrant splicing of CBS mRNA. The other allele contained a missense mutation resulting in the previously reported E144K mutant CBS protein. The second patient had a maternally derived 4 bp insertion in exon 17, predicted to cause a CBS peptide of altered amino acid sequence. A 494G-->A transition was found in exon 4 of the other allele, predicting a C165Y substitution. Expression of recombinant CBS protein, containing the C165Y mutation, had no detectable catalytic activity. Each mutation was confirmed in genomic DNA. (C) 1998 Wiley-Liss, Inc.

Familial partial epilepsy with variable foci: A new partial epilepsy syndrome with suggestion of linkage to chromosome 2

Familial partial epilepsy with variable foci (FPEVF) joins the recently recognized group of inherited partial epilepsies. We describe an Australian family with 10 individuals with partial seizures over four generations. Detailed electroclinical studies were performed on all affected and 17 clinically unaffected family members. The striking finding was that the clinical features of the seizures and interictal electroencephalographic foci differed among family members and included frontal, temporal, occipital, and centroparietal seizures. Mean age of seizure onset was 13 years (range, 0.75-43 years). Two individuals without seizures had epileptiform abnormalities on electroencephalographic studies. Penetrance of seizures was 62%. A genome-wide search failed to demonstrate definitive linkage, but a suggestion of linkage was found on chromosome 2q with a LOD score of 2.74 at recombination fraction of zero with the marker D2S133. FPEVF differs from the other inherited partial epilepsies where partial seizures in different family members are clinically similar. The inherited nature of this new syndrome may be overlooked because of relatively low penetrance and because of the variability in age at onset and electroclinical features between affected family members.

Unsupervised cell nucleus segmentation with active contours

The task of segmenting cell nuclei from cytoplasm in conventional Papanicolaou (Pap) stained cervical cell images is a classical image analysis problem which may prove to be crucial to the development of successful systems which automate the analysis of Pap smears for detection of cancer of the cervix. Although simple thresholding techniques will extract the nucleus in some cases, accurate unsupervised segmentation of very large image databases is elusive. Conventional active contour models as introduced by Kass, Witkin and Terzopoulos (1988) offer a number of advantages in this application, but suffer from the well-known drawbacks of initialisation and minimisation. Here we show that a Viterbi search-based dual active contour algorithm is able to overcome many of these problems and achieve over 99% accurate segmentation on a database of 20 130 Pap stained cell images. (C) 1998 Elsevier Science B.V. All rights reserved.