An iterative framework for sparse signal reconstruction algorithms

It has been shown that iterative re-weighted strategies will often improve the performance of many sparse reconstruction algorithms. However, these strategies are algorithm dependent and cannot be easily extended for an arbitrary sparse reconstruction algorithm. In this paper, we propose a general iterative framework and a novel algorithm which iteratively enhance the performance of any given arbitrary sparse reconstruction algorithm. We theoretically analyze the proposed method using restricted isometry property and derive sufficient conditions for convergence and performance improvement. We also evaluate the performance of the proposed method using numerical experiments with both synthetic and real-world data. (C) 2014 Elsevier B.V. All rights reserved.

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.

Simultaneous Perturbation Newton Algorithms for Simulation Optimization

We present a new Hessian estimator based on the simultaneous perturbation procedure, that requires three system simulations regardless of the parameter dimension. We then present two Newton-based simulation optimization algorithms that incorporate this Hessian estimator. The two algorithms differ primarily in the manner in which the Hessian estimate is used. Both our algorithms do not compute the inverse Hessian explicitly, thereby saving on computational effort. While our first algorithm directly obtains the product of the inverse Hessian with the gradient of the objective, our second algorithm makes use of the Sherman-Morrison matrix inversion lemma to recursively estimate the inverse Hessian. We provide proofs of convergence for both our algorithms. Next, we consider an interesting application of our algorithms on a problem of road traffic control. Our algorithms are seen to exhibit better performance than two Newton algorithms from a recent prior work.

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.

Timing Recovery Algorithms and Architectures for 2-D Magnetic Recording Systems

We investigate the problem of timing recovery for 2-D magnetic recording (TDMR) channels. We develop a timing error model for TDMR channel considering the phase and frequency offsets with noise. We propose a 2-D data-aided phase-locked loop (PLL) architecture for tracking variations in the position and movement of the read head in the down-track and cross-track directions and analyze the convergence of the algorithm under non-separable timing errors. We further develop a 2-D interpolation-based timing recovery scheme that works in conjunction with the 2-D PLL. We quantify the efficiency of our proposed algorithms by simulations over a 2-D magnetic recording channel with timing errors.

De-DUFing the DUFs: Deciphering distant evolutionary relationships of Domains of Unknown Function using sensitive homology detection methods

Background: In the post-genomic era where sequences are being determined at a rapid rate, we are highly reliant on computational methods for their tentative biochemical characterization. The Pfam database currently contains 3,786 families corresponding to ``Domains of Unknown Function'' (DUF) or ``Uncharacterized Protein Family'' (UPF), of which 3,087 families have no reported three-dimensional structure, constituting almost one-fourth of the known protein families in search for both structure and function. Results: We applied a `computational structural genomics' approach using five state-of-the-art remote similarity detection methods to detect the relationship between uncharacterized DUFs and domain families of known structures. The association with a structural domain family could serve as a start point in elucidating the function of a DUF. Amongst these five methods, searches in SCOP-NrichD database have been applied for the first time. Predictions were classified into high, medium and low-confidence based on the consensus of results from various approaches and also annotated with enzyme and Gene ontology terms. 614 uncharacterized DUFs could be associated with a known structural domain, of which high confidence predictions, involving at least four methods, were made for 54 families. These structure-function relationships for the 614 DUF families can be accessed on-line at http://proline.biochem.iisc.ernet.in/RHD_DUFS/. For potential enzymes in this set, we assessed their compatibility with the associated fold and performed detailed structural and functional annotation by examining alignments and extent of conservation of functional residues. Detailed discussion is provided for interesting assignments for DUF3050, DUF1636, DUF1572, DUF2092 and DUF659. Conclusions: This study provides insights into the structure and potential function for nearly 20 % of the DUFs. Use of different computational approaches enables us to reliably recognize distant relationships, especially when they converge to a common assignment because the methods are often complementary. We observe that while pointers to the structural domain can offer the right clues to the function of a protein, recognition of its precise functional role is still `non-trivial' with many DUF domains conserving only some of the critical residues. It is not clear whether these are functional vestiges or instances involving alternate substrates and interacting partners. Reviewers: This article was reviewed by Drs Eugene Koonin, Frank Eisenhaber and Srikrishna Subramanian.

Evolutionary and structural analyses of heterodimeric proteins composed of subunits with same fold

Heterodimeric proteins with homologous subunits of same fold are involved in various biological processes. The objective of this study is to understand the evolution of structural and functional features of such heterodimers. Using a non-redundant dataset of 70 such heterodimers of known 3D structure and an independent dataset of 173 heterodimers from yeast, we note that the mean sequence identity between interacting homologous subunits is only 23-24% suggesting that, generally, highly diverged paralogues assemble to form such a heterodimer. We also note that the functional roles of interacting subunits/domains are generally quite different. This suggests that, though the interacting subunits/domains are homologous, the high evolutionary divergence characterize their high functional divergence which contributes to a gross function for the heterodimer considered as a whole. The inverse relationship between sequence identity and RMSD of interacting homologues in heterodimers is not followed. We also addressed the question of formation of homodimers of the subunits of heterodimers by generating models of fictitious homodimers on the basis of the 3D structures of the heterodimers. Interaction energies associated with these homodimers suggests that, in overwhelming majority of the cases, such homodimers are unlikely to be stable. Majority of the homologues of heterodimers of known structures form heterodimers (51.8%) and a small proportion (14.6%) form homodimers. Comparison of 3D structures of heterodimers with homologous homodimers suggests that interfacial nature of residues is not well conserved. In over 90% of the cases we note that the interacting subunits of heterodimers are co-localized in the cell. Proteins 2015; 83:1766-1786. (c) 2015 Wiley Periodicals, Inc.

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints

The 3-Hitting Set problem involves a family of subsets F of size at most three over an universe U. The goal is to find a subset of U of the smallest possible size that intersects every set in F. The version of the problem with parity constraints asks for a subset S of size at most k that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the intersections of S with each set in the family F. In particular, an odd (even) set is a hitting set that hits every set at either one or three (two) elements, and a perfect code is a hitting set that intersects every set at exactly one element. These questions are of fundamental interest in many contexts for general set systems. Just as for Hitting Set, we find these questions to be interesting for the case of families consisting of sets of size at most three. In this work, we initiate an algorithmic study of these problems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts for equivalence under the additional parity constraints.

Recognizing drug targets using evolutionary information: implications for repurposing FDA-approved drugs against Mycobacterium tuberculosis H37Rv

Drug repurposing to explore target space has been gaining pace over the past decade with the upsurge in the use of systematic approaches for computational drug discovery. Such a cost and time-saving approach gains immense importance for pathogens of special interest, such as Mycobacterium tuberculosis H37Rv. We report a comprehensive approach to repurpose drugs, based on the exploration of evolutionary relationships inferred from the comparative sequence and structural analyses between targets of FDA-approved drugs and the proteins of M. tuberculosis. This approach has facilitated the identification of several polypharmacological drugs that could potentially target unexploited M. tuberculosis proteins. A total of 130 FDA-approved drugs, originally intended against other diseases, could be repurposed against 78 potential targets in M. tuberculosis. Additionally, we have also made an attempt to augment the chemical space by recognizing compounds structurally similar to FDA-approved drugs. For three of the attractive cases we have investigated the probable binding modes of the drugs in their corresponding M. tuberculosis targets by means of structural modelling. Such prospective targets and small molecules could be prioritized for experimental endeavours, and could significantly influence drug-discovery and drug-development programmes for tuberculosis.

An evolutionary formalism for weak quantum measurements

Unitary evolution and projective measurement are fundamental axioms of quantum mechanics. Even though projective measurement yields one of the eigenstates of the measured operator as the outcome, there is no theory that predicts which eigenstate will be observed in which experimental run. There exists only an ensemble description, which predicts probabilities of various outcomes over many experimental runs. We propose a dynamical evolution equation for the projective collapse of the quantum state in individual experimental runs, which is consistent with the well-established framework of quantum mechanics. In case of gradual weak measurements, its predictions for ensemble evolution are different from those of the Born rule. It is an open question whether or not suitably designed experiments can observe this alternate evolution.

DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS

In this work, we study the well-known r-DIMENSIONAL k-MATCHING ((r, k)-DM), and r-SET k-PACKING ((r, k)-SP) problems. Given a universe U := U-1 ... U-r and an r-uniform family F subset of U-1 x ... x U-r, the (r, k)-DM problem asks if F admits a collection of k mutually disjoint sets. Given a universe U and an r-uniform family F subset of 2(U), the (r, k)-SP problem asks if F admits a collection of k mutually disjoint sets. We employ techniques based on dynamic programming and representative families. This leads to a deterministic algorithm with running time O(2.851((r-1)k) .vertical bar F vertical bar. n log(2)n . logW) for the weighted version of (r, k)-DM, where W is the maximum weight in the input, and a deterministic algorithm with running time O(2.851((r-0.5501)k).vertical bar F vertical bar.n log(2) n . logW) for the weighted version of (r, k)-SP. Thus, we significantly improve the previous best known deterministic running times for (r, k)-DM and (r, k)-SP and the previous best known running times for their weighted versions. We rely on structural properties of (r, k)-DM and (r, k)-SP to develop algorithms that are faster than those that can be obtained by a standard use of representative sets. Incorporating the principles of iterative expansion, we obtain a better algorithm for (3, k)-DM, running in time O(2.004(3k).vertical bar F vertical bar . n log(2)n). We believe that this algorithm demonstrates an interesting application of representative families in conjunction with more traditional techniques. Furthermore, we present kernels of size O(e(r)r(k-1)(r) logW) for the weighted versions of (r, k)-DM and (r, k)-SP, improving the previous best known kernels of size O(r!r(k-1)(r) logW) for these problems.