Improving tangential resolution with a modified delay-and-sum reconstruction algorithm in photoacoustic and thermoacoustic tomography

Spatial resolution in photoacoustic and thermoacoustic tomography is ultrasound transducer (detector) bandwidth limited. For a circular scanning geometry the axial (radial) resolution is not affected by the detector aperture, but the tangential (lateral) resolution is highly dependent on the aperture size, and it is also spatially varying (depending on the location relative to the scanning center). Several approaches have been reported to counter this problem by physically attaching a negative acoustic lens in front of the nonfocused transducer or by using virtual point detectors. Here, we have implemented a modified delay-and-sum reconstruction method, which takes into account the large aperture of the detector, leading to more than fivefold improvement in the tangential resolution in photoacoustic (and thermoacoustic) tomography. Three different types of numerical phantoms were used to validate our reconstruction method. It is also shown that we were able to preserve the shape of the reconstructed objects with the modified algorithm. (C) 2014 Optical Society of America

Correlation between local structural dynamics of proteins inferred from NMR ensembles and evolutionary dynamics of homologues of known structure

Conformational changes in proteins are extremely important for their biochemical functions. Correlation between inherent conformational variations in a protein and conformational differences in its homologues of known structure is still unclear. In this study, we have used a structural alphabet called Protein Blocks (PBs). PBs are used to perform abstraction of protein 3-D structures into a 1-D strings of 16 alphabets (a-p) based on dihedral angles of overlapping pentapeptides. We have analyzed the variations in local conformations in terms of PBs represented in the ensembles of 801 protein structures determined using NMR spectroscopy. In the analysis of concatenated data over all the residues in all the NMR ensembles, we observe that the overall nature of inherent local structural variations in NMR ensembles is similar to the nature of local structural differences in homologous proteins with a high correlation coefficient of .94. High correlation at the alignment positions corresponding to helical and beta-sheet regions is only expected. However, the correlation coefficient by considering only the loop regions is also quite high (.91). Surprisingly, segregated position-wise analysis shows that this high correlation does not hold true to loop regions at the structurally equivalent positions in NMR ensembles and their homologues of known structure. This suggests that the general nature of local structural changes is unique; however most of the local structural variations in loop regions of NMR ensembles do not correlate to their local structural differences at structurally equivalent positions in homologues.

PocketMatch (version 2.0): A parallel algorithm for the detection of structural similarities between protein ligand binding-sites

Knowledge of protein-ligand interactions is essential to understand several biological processes and important for applications ranging from understanding protein function to drug discovery and protein engineering. Here, we describe an algorithm for the comparison of three-dimensional ligand-binding sites in protein structures. A previously described algorithm, PocketMatch (version 1.0) is optimised, expanded, and MPI-enabled for parallel execution. PocketMatch (version 2.0) rapidly quantifies binding-site similarity based on structural descriptors such as residue nature and interatomic distances. Atomic-scale alignments may also be obtained from amino acid residue pairings generated. It allows an end-user to compute database-wide, all-to-all comparisons in a matter of hours. The use of our algorithm on a sample dataset, performance-analysis, and annotated source code is also included.

Accurate point matching based on multi-objective Genetic Algorithm for multi-sensor satellite imagery

This paper investigates a novel approach for point matching of multi-sensor satellite imagery. The feature (corner) points extracted using an improved version of the Harris Corner Detector (HCD) is matched using multi-objective optimization based on a Genetic Algorithm (GA). An objective switching approach to optimization that incorporates an angle criterion, distance condition and point matching condition in the multi-objective fitness function is applied to match corresponding corner-points between the reference image and the sensed image. The matched points obtained in this way are used to align the sensed image with a reference image by applying an affine transformation. From the results obtained, the performance of the image registration is evaluated and compared with existing methods, namely Nearest Neighbor-Random SAmple Consensus (NN-Ran-SAC) and multi-objective Discrete Particle Swarm Optimization (DPSO). From the performed experiments it can be concluded that the proposed approach is an accurate method for registration of multi-sensor satellite imagery. (C) 2014 Elsevier Inc. All rights reserved.

Bi-Domain Protein Tyrosine Phosphatases Reveal an Evolutionary Adaptation to Optimize Signal Transduction

Significance: The bi-domain protein tyrosine phosphatases (PTPs) exemplify functional evolution in signaling proteins for optimal spatiotemporal signal transduction. Bi-domain PTPs are products of gene duplication. The catalytic activity, however, is often localized to one PTP domain. The inactive PTP domain adopts multiple functional roles. These include modulation of catalytic activity, substrate specificity, and stability of the bi-domain enzyme. In some cases, the inactive PTP domain is a receptor for redox stimuli. Since multiple bi-domain PTPs are concurrently active in related cellular pathways, a stringent regulatory mechanism and selective cross-talk is essential to ensure fidelity in signal transduction. Recent Advances: The inactive PTP domain is an activator for the catalytic PTP domain in some cases, whereas it reduces catalytic activity in other bi-domain PTPs. The relative orientation of the two domains provides a conformational rationale for this regulatory mechanism. Recent structural and biochemical data reveal that these PTP domains participate in substrate recruitment. The inactive PTP domain has also been demonstrated to undergo substantial conformational rearrangement and oligomerization under oxidative stress. Critical Issues and Future Directions: The role of the inactive PTP domain in coupling environmental stimuli with catalytic activity needs to be further examined. Another aspect that merits attention is the role of this domain in substrate recruitment. These aspects have been poorly characterized in vivo. These lacunae currently restrict our understanding of neo-functionalization of the inactive PTP domain in the bi-domain enzyme. It appears likely that more data from these research themes could form the basis for understanding the fidelity in intracellular signal transduction.

Accurate prediction of interfacial residues in two-domain proteins using evolutionary information: Implications for three-dimensional modeling

With the preponderance of multidomain proteins in eukaryotic genomes, it is essential to recognize the constituent domains and their functions. Often function involves communications across the domain interfaces, and the knowledge of the interacting sites is essential to our understanding of the structure-function relationship. Using evolutionary information extracted from homologous domains in at least two diverse domain architectures (single and multidomain), we predict the interface residues corresponding to domains from the two-domain proteins. We also use information from the three-dimensional structures of individual domains of two-domain proteins to train naive Bayes classifier model to predict the interfacial residues. Our predictions are highly accurate (approximate to 85%) and specific (approximate to 95%) to the domain-domain interfaces. This method is specific to multidomain proteins which contain domains in at least more than one protein architectural context. Using predicted residues to constrain domain-domain interaction, rigid-body docking was able to provide us with accurate full-length protein structures with correct orientation of domains. We believe that these results can be of considerable interest toward rational protein and interaction design, apart from providing us with valuable information on the nature of interactions. Proteins 2014; 82:1219-1234. (c) 2013 Wiley Periodicals, Inc.

Fienup Algorithm With Sparsity Constraints: Application to Frequency-Domain Optical-Coherence Tomography

We address the problem of reconstructing a sparse signal from its DFT magnitude. We refer to this problem as the sparse phase retrieval (SPR) problem, which finds applications in tomography, digital holography, electron microscopy, etc. We develop a Fienup-type iterative algorithm, referred to as the Max-K algorithm, to enforce sparsity and successively refine the estimate of phase. We show that the Max-K algorithm possesses Cauchy convergence properties under certain conditions, that is, the MSE of reconstruction does not increase with iterations. We also formulate the problem of SPR as a feasibility problem, where the goal is to find a signal that is sparse in a known basis and whose Fourier transform magnitude is consistent with the measurement. Subsequently, we interpret the Max-K algorithm as alternating projections onto the object-domain and measurement-domain constraint sets and generalize it to a parameterized relaxation, known as the relaxed averaged alternating reflections (RAAR) algorithm. On the application front, we work with measurements acquired using a frequency-domain optical-coherence tomography (FDOCT) experimental setup. Experimental results on measured data show that the proposed algorithms exhibit good reconstruction performance compared with the direct inversion technique, homomorphic technique, and the classical Fienup algorithm without sparsity constraint; specifically, the autocorrelation artifacts and background noise are suppressed to a significant extent. We also demonstrate that the RAAR algorithm offers a broader framework for FDOCT reconstruction, of which the direct inversion technique and the proposed Max-K algorithm become special instances corresponding to specific values of the relaxation parameter.

A simulation-based algorithm for optimal pricing policy under demand uncertainty

We propose a simulation-based algorithm for computing the optimal pricing policy for a product under uncertain demand dynamics. We consider a parameterized stochastic differential equation (SDE) model for the uncertain demand dynamics of the product over the planning horizon. In particular, we consider a dynamic model that is an extension of the Bass model. The performance of our algorithm is compared to that of a myopic pricing policy and is shown to give better results. Two significant advantages with our algorithm are as follows: (a) it does not require information on the system model parameters if the SDE system state is known via either a simulation device or real data, and (b) as it works efficiently even for high-dimensional parameters, it uses the efficient smoothed functional gradient estimator.

A shortest path tree based algorithm for relay placement in a wireless sensor network and its performance analysis

In this paper, we study a problem of designing a multi-hop wireless network for interconnecting sensors (hereafter called source nodes) to a Base Station (BS), by deploying a minimum number of relay nodes at a subset of given potential locations, while meeting a quality of service (QoS) objective specified as a hop count bound for paths from the sources to the BS. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard. For this problem, we propose a polynomial time approximation algorithm based on iteratively constructing shortest path trees and heuristically pruning away the relay nodes used until the hop count bound is violated. Results show that the algorithm performs efficiently in various randomly generated network scenarios; in over 90% of the tested scenarios, it gave solutions that were either optimal or were worse than optimal by just one relay. We then use random graph techniques to obtain, under a certain stochastic setting, an upper bound on the average case approximation ratio of a class of algorithms (including the proposed algorithm) for this problem as a function of the number of source nodes, and the hop count bound. To the best of our knowledge, the average case analysis is the first of its kind in the relay placement literature. Since the design is based on a light traffic model, we also provide simulation results (using models for the IEEE 802.15.4 physical layer and medium access control) to assess the traffic levels up to which the QoS objectives continue to be met. (C) 2014 Elsevier B.V. All rights reserved.

Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?

The correlation clustering problem is a fundamental problem in both theory and practice, and it involves identifying clusters of objects in a data set based on their similarity. A traditional modeling of this question as a graph theoretic problem involves associating vertices with data points and indicating similarity by adjacency. Clusters then correspond to cliques in the graph. The resulting optimization problem, Cluster Editing (and several variants) are very well-studied algorithmically. In many situations, however, translating clusters to cliques can be somewhat restrictive. A more flexible notion would be that of a structure where the vertices are mutually ``not too far apart'', without necessarily being adjacent. One such generalization is realized by structures called s-clubs, which are graphs of diameter at most s. In this work, we study the question of finding a set of at most k edges whose removal leaves us with a graph whose components are s-clubs. Recently, it has been shown that unless Exponential Time Hypothesis fail (ETH) fails Cluster Editing (whose components are 1-clubs) does not admit sub-exponential time algorithm STACS, 2013]. That is, there is no algorithm solving the problem in time 2 degrees((k))n(O(1)). However, surprisingly they show that when the number of cliques in the output graph is restricted to d, then the problem can be solved in time O(2(O(root dk)) + m + n). We show that this sub-exponential time algorithm for the fixed number of cliques is rather an exception than a rule. Our first result shows that assuming the ETH, there is no algorithm solving the s-Club Cluster Edge Deletion problem in time 2 degrees((k))n(O(1)). We show, further, that even the problem of deleting edges to obtain a graph with d s-clubs cannot be solved in time 2 degrees((k))n(O)(1) for any fixed s, d >= 2. This is a radical contrast from the situation established for cliques, where sub-exponential algorithms are known.

A constant factor approximation algorithm for boxicity of circular arc graphs

The boxicity (resp. cubicity) of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (resp. cubes) in R-k. Equivalently, it is the minimum number of interval graphs (resp. unit interval graphs) on the vertex set V, such that the intersection of their edge sets is E. The problem of computing boxicity (resp. cubicity) is known to be inapproximable, even for restricted graph classes like bipartite, co-bipartite and split graphs, within an O(n(1-epsilon))-factor for any epsilon > 0 in polynomial time, unless NP = ZPP. For any well known graph class of unbounded boxicity, there is no known approximation algorithm that gives n(1-epsilon)-factor approximation algorithm for computing boxicity in polynomial time, for any epsilon > 0. In this paper, we consider the problem of approximating the boxicity (cubicity) of circular arc graphs intersection graphs of arcs of a circle. Circular arc graphs are known to have unbounded boxicity, which could be as large as Omega(n). We give a (2 + 1/k) -factor (resp. (2 + log n]/k)-factor) polynomial time approximation algorithm for computing the boxicity (resp. cubicity) of any circular arc graph, where k >= 1 is the value of the optimum solution. For normal circular arc (NCA) graphs, with an NCA model given, this can be improved to an additive two approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity (resp. cubicity) is O(mn + n(2)) in both these cases, and in O(mn + kn(2)) = O(n(3)) time we also get their corresponding box (resp. cube) representations, where n is the number of vertices of the graph and m is its number of edges. Our additive two approximation algorithm directly works for any proper circular arc graph, since their NCA models can be computed in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.

Structure, interactions and evolutionary implications of a domain-swapped lectin dimer from Mycobacterium smegmatis

Crystal structure determination of the lectin domain of MSMEG_3662 from Mycobacterium smegmatis and its complexes with mannose and methyl-alpha-mannose, the first effort of its kind on a mycobacterial lectin, reveals a structure very similar to beta-prism II fold lectins from plant sources, but with extensive unprecedented domain swapping in dimer formation. The two subunits in a dimer often show small differences in structure, but the two domains, not always related by 2-fold symmetry, have the same structure. Each domain carries three sugar-binding sites, similar to those in plant lectins, one on each Greek key motif. The occurrence of beta-prism II fold lectins in bacteria, with characteristics similar to those from plants, indicates that this family of lectins is of ancient origin and had evolved into a mature system before bacteria and plants diverged. In plants, the number of binding sites per domain varies between one and three, whereas the number is two in the recently reported lectin domains from Pseudomonas putida and Pseudomonas aeruginosa. An analysis of the sequences of the lectins and the lectin domains shows that the level of sequence similarity among the three Greek keys in each domain has a correlation with the number of binding sites in it. Furthermore, sequence conservation among the lectins from different species is the highest for that Greek key which carries a binding site in all of them. Thus, it would appear that carbohydrate binding influences the course of the evolution of the lectin.

Fruit and Seed Volatiles: Multiple Stage Settings, Actors and Props in an Evolutionary Play

Plants emit volatile organic compounds (VOCs) from most parts of their anatomy. Conventionally, the volatiles of leaves, flowers, fruits and seeds have been investigated separately. This review presents an integrated perspective of volatiles produced by fruits and seeds in the context of selection on the whole plant. It suggests that fruit and seed volatiles may only be understood in the light of the chemistry of the whole plant. Fleshy fruit may be viewed as an ecological arena within which several evolutionary games are being played involving fruit VOCs. Fruit odour and colour may be correlated and interact via multimodal signalling in influencing visits by frugivores. The hypothesis of volatile crypsis in the evolution of hard seeds as protection against volatile diffusion and perception by seed predators is reviewed. Current views on the role of volatiles in ant dispersal of seeds or myrmecochory are summarised, especially the suggestion that ants are being manipulated by plants in the form of a sensory trap while providing this service. Plant VOC production is presented as an emergent phenotype that could result from multiple selection pressures acting on various plant parts; the ``plant'' phenotype and VOC profile may receive significant contributions from symbionts within the plant. Viewing the plant as a holobiont would benefit an understanding of the emergent plant phenotype.

One-Carbon Metabolic Pathway Rewiring in Escherichia coli Reveals an Evolutionary Advantage of 10-Formyltetrahydrofolate Synthetase (Fhs) in Survival under Hypoxia

In cells, N-10-formyltetrahydrofolate (N-10-fTHF) is required for formylation of eubacterial/organellar initiator tRNA and purine nucleotide biosynthesis. Biosynthesis of N-10-fTHF is catalyzed by 5,10-methylene-tetrahydrofolate dehydrogenase/cyclohydrolase (FolD) and/or 10-formyltetrahydrofolate synthetase (Fhs). All eubacteria possess FolD, but some possess both FolD and Fhs. However, the reasons for possessing Fhs in addition to FolD have remained unclear. We used Escherichia coli, which naturally lacks fhs, as our model. We show that in E. coli, the essential function of folD could be replaced by Clostridium perfringens fhs when it was provided on a medium-copy-number plasmid or integrated as a single-copy gene in the chromosome. The fhs-supported folD deletion (Delta folD) strains grow well in a complex medium. However, these strains require purines and glycine as supplements for growth in M9 minimal medium. The in vivo levels of N-10-fTHF in the Delta folD strain (supported by plasmid-borne fhs) were limiting despite the high capacity of the available Fhs to synthesize N-10-fTHF in vitro. Auxotrophy for purines could be alleviated by supplementing formate to the medium, and that for glycine was alleviated by engineering THF import into the cells. The Delta folD strain (harboring fhs on the chromosome) showed a high NADP(+)-to-NADPH ratio and hypersensitivity to trimethoprim. The presence of fhs in E. coli was disadvantageous for its aerobic growth. However, under hypoxia, E. coli strains harboring fhs outcompeted those lacking it. The computational analysis revealed a predominant natural occurrence of fhs in anaerobic and facultative anaerobic bacteria.

A Modified Sum-Product Algorithm over Graphs with Isolated Short Cycles

We investigate into the limitations of the sum-product algorithm in the probability domain over graphs with isolated short cycles. By considering the statistical dependency of messages passed in a cycle of length 4, we modify the update equations for the beliefs at the variable and check nodes. We highlight an approximate log domain algebra for the modified variable node update to ensure numerical stability. At higher signal-to-noise ratios (SNR), the performance of decoding over graphs with isolated short cycles using the modified algorithm is improved compared to the original message passing algorithm (MPA).