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.

Spatial distribution of benthic microalgae on coral reefs determined by remote sensing

Understanding the ecological role of benthic microalgae, a highly productive component of coral reef ecosystems, requires information on their spatial distribution. The spatial extent of benthic microalgae on Heron Reef (southern Great Barrier Reef, Australia) was mapped using data from the Landsat 5 Thematic Mapper sensor. integrated with field measurements of sediment chlorophyll concentration and reflectance. Field-measured sediment chlorophyll concentrations. 2 ranging from 23-1.153 mg chl a m(2), were classified into low, medium, and high concentration classes (1-170, 171-290, and > 291 mg chl a m(-2)) using a K-means clustering algorithm. The mapping process assumed that areas in the Thematic Mapper image exhibiting similar reflectance levels in red and blue bands would correspond to areas of similar chlorophyll a levels. Regions of homogenous reflectance values corresponding to low, medium, and high chlorophyll levels were identified over the reef sediment zone by applying a standard image classification algorithm to the Thematic Mapper image. The resulting distribution map revealed large-scale ( > 1 km 2) patterns in chlorophyll a levels throughout the sediment zone of Heron Reef. Reef-wide estimates of chlorophyll a distribution indicate that benthic Microalgae may constitute up to 20% of the total benthic chlorophyll a at Heron Reef. and thus contribute significantly to total primary productivity on the reef.

Hydrolytic kinetic resolution of terminal mono- and bis-epoxides in the synthesis of insect pheromones: routes to (-)-(R)- and (+)-(S)-10-methyldodecyl acetate, (-)-(R)-10-methyl-2-tridecanone, (-)-(R)-(Z)-undec-6-en-2-ol (Nostrenol), (-)-(1R,7R)-1,7-dime

Hydrolytic kinetic resolution (HKR) of functionalised epoxides using (salen)Co(OAc) complexes provides enantiomerically enriched epoxides and diols, which have been transformed into important insect sex pheromones. In this general approach, (-)-(R)- and (+)-(S)-10-methyldodecyl acetates from the smaller tea tortrix moth were obtained, as was (-)-(R)-10-methyltridecan-2-one from the southern corn rootworm. The (S)-epoxide obtained from undec-1-en-6-yne was transformed to (-)-(R)-(Z)-undec-6-en-2-ol (Nostrenol) from ant-lions. HKR of appropriate bisepoxides was also investigated, and transformations of the resulting bisepoxides and epoxydiols provided (-)-(1R,7R)-1,7-dimethylnonylpropanoate from corn rootworms, (-)-(6R,12R)-6,12-dimethylpentadecan-2-one from the female banded cucumber beetle, and (-)-(2S,11S)-2,11-diacetoxytridecane and (+)-(2S,12S)-2,12-diacetoxytridecane from female pea-midges. (C) 2002 Elsevier Science Ltd. All rights reserved.

High resolution 3-D imaging via multi-pass SAR

Spaceborne/airborne synthetic aperture radar (SAR) systems provide high resolution two-dimensional terrain imagery. The paper proposes a technique for combining multiple SAR images, acquired on flight paths slightly separated in the elevation direction, to generate high resolution three-dimensional imagery. The technique could be viewed as an extension to interferometric SAR (InSAR) in that it generates topographic imagery with an additional dimension of resolution. The 3-D multi-pass SAR imaging system is typically characterised by a relatively short ambiguity length in the elevation direction. To minimise the associated ambiguities we exploit the relative phase information within the set of images to track the terrain landscape. The SAR images are then coherently combined, via a nonuniform DFT, over a narrow (in elevation) volume centred on the 'dominant' terrain ground plane. The paper includes a detailed description of the technique, background theory, including achievable resolution, and the results of an experimental study.

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.

Structure of CcmG/DsbE at 1.14 angstrom resolution: High-fidelity reducing activity in an indiscriminately oxidizing environment

CcmG is unlike other periplasmic thioredoxin (TRX)like proteins in that it has a specific reducing activity in an oxidizing environment and a high fidelity of interaction. These two unusual properties are required for its role in c-type cytochrome maturation. The crystal structure of CcmG reveals a modified TRX fold with an unusually acidic active site and a groove formed from two inserts in the fold. Deletion of one of the groove-forming inserts disrupts c-type cytochrome formation. Two unique structural features of CcmG-an acidic active site and an adjacent groove-appear to be necessary to convert an indiscriminately binding scaffold, the TRX fold, into a highly specific redox protein.

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.