Browse
Submit Data
Databases
API
Help

Dataset Information

15 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

ORTHOGONAL TRACE-SUM MAXIMIZATION: APPLICATIONS, LOCAL ALGORITHMS, AND GLOBAL OPTIMALITY

ABSTRACT: This paper studies the problem of maximizing the sum of traces of matrix quadratic forms on a product of Stiefel manifolds. This orthogonal trace-sum maximization (OTSM) problem generalizes many interesting problems such as generalized canonical correlation analysis (CCA), Procrustes analysis, and cryo-electron microscopy of the Nobel prize fame. For these applications finding global solutions is highly desirable, but it has been unclear how to find even a stationary point, let alone test its global optimality. Through a close inspection of Ky Fan’s classical result [Proc. Natl. Acad. Sci. USA, 35 (1949), pp. 652–655] on the variational formulation of the sum of largest eigenvalues of a symmetric matrix, and a semidefinite programming (SDP) relaxation of the latter, we first provide a simple method to certify global optimality of a given stationary point of OTSM. This method only requires testing whether a symmetric matrix is positive semidefinite. A by-product of this analysis is an unexpected strong duality between Shapiro and Botha [SIAM J. Matrix Anal. Appl., 9 (1988), pp. 378–383] and Zhang and Singer [Linear Algebra Appl., 524 (2017), pp. 159–181]. After showing that a popular algorithm for generalized CCA and Procrustes analysis may generate oscillating iterates, we propose a simple fix that provably guarantees convergence to a stationary point. The combination of our algorithm and certificate reveals novel global optima of various instances of OTSM.

SUBMITTER: WON J

PROVIDER: S-EPMC8589322 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Local and global trace plutonium contributions in fast breeder legacy soils.

Project description:Trace-level plutonium in the environment often comprises local and global contributions, and is usually anthropogenic in origin. Here, we report estimates of local and global contributions to trace-level plutonium in soil from a former, fast-breeder reactor site. The measured 240Pu/239Pu ratio is anomalously low, as per the reduced 240Pu yield expected in plutonium bred with fast neutrons. Anomalies in plutonium concentration and isotopic ratio suggest forensic insight into specific activities on site, such as clean-up or structural change. Local and global 239Pu contributions on-site are estimated at (34 ± 1)% and (66 ± 3)%, respectively, with mass concentrations of (183 ± 6) fg g-1 and (362 ± 13) fg g-1. The latter is consistent with levels at undisturbed and distant sites, (384 ± 44) fg g-1, where no local contribution is expected. The 240Pu/239Pu ratio for site-derived material is estimated at 0.05 ± 0.04. Our study demonstrates the multi-faceted potential of trace plutonium assay to inform clean-up strategies of fast breeder legacies.

| S-EPMC7979690 | biostudies-literature

Circular sequence comparison: algorithms and applications.

Project description:BACKGROUND:Sequence comparison is a fundamental step in many important tasks in bioinformatics; from phylogenetic reconstruction to the reconstruction of genomes. Traditional algorithms for measuring approximation in sequence comparison are based on the notions of distance or similarity, and are generally computed through sequence alignment techniques. As circular molecular structure is a common phenomenon in nature, a caveat of the adaptation of alignment techniques for circular sequence comparison is that they are computationally expensive, requiring from super-quadratic to cubic time in the length of the sequences. RESULTS:In this paper, we introduce a new distance measure based on q-grams, and show how it can be applied effectively and computed efficiently for circular sequence comparison. Experimental results, using real DNA, RNA, and protein sequences as well as synthetic data, demonstrate orders-of-magnitude superiority of our approach in terms of efficiency, while maintaining an accuracy very competitive to the state of the art.

| S-EPMC4862142 | biostudies-literature

Fast local fragment chaining using sum-of-pair gap costs.

Project description:BackgroundFast seed-based alignment heuristics such as BLAST and BLAT have become indispensable tools in comparative genomics for all studies aiming at the evolutionary relations of proteins, genes, and non-coding RNAs. This is true in particular for the large mammalian genomes. The sensitivity and specificity of these tools, however, crucially depend on parameters such as seed sizes or maximum expectation values. In settings that require high sensitivity the amount of short local match fragments easily becomes intractable. Then, fragment chaining is a powerful leverage to quickly connect, score, and rank the fragments to improve the specificity.ResultsHere we present a fast and flexible fragment chainer that for the first time also supports a sum-of-pair gap cost model. This model has proven to achieve a higher accuracy and sensitivity in its own field of application. Due to a highly time-efficient index structure our method outperforms the only existing tool for fragment chaining under the linear gap cost model. It can easily be applied to the output generated by alignment tools such as segemehl or BLAST. As an example we consider homology-based searches for human and mouse snoRNAs demonstrating that a highly sensitive BLAST search with subsequent chaining is an attractive option. The sum-of-pair gap costs provide a substantial advantage is this context.ConclusionsChaining of short match fragments helps to quickly and accurately identify regions of homology that may not be found using local alignment heuristics alone. By providing both the linear and the sum-of-pair gap cost model, a wider range of application can be covered. The software clasp is available at http://www.bioinf.uni-leipzig.de/Software/clasp/.

| S-EPMC3072320 | biostudies-literature

Local and global ancestry inference and applications to genetic association analysis for admixed populations.

Project description:Genetic association studies in recently admixed populations offer exciting opportunities to identify novel variants underlying phenotypic diversity. At the same time, genetic heterogeneity resulting from population admixture has to be accounted for to ensure validity of association tests. The whole-genome sequence data and the genome-wide single-nucleotide polymorphism chip data for Mexican American individuals provided by Genetic Analysis Workshop 18 (GAW18) presents a unique opportunity to evaluate and compare methods for the statistical analysis of admixed genetic data. We summarize here the five contributions from the GAW18 working group on admixture mapping and adjusting for admixture. Although group members considered a variety of research topics, the general theme was inference and consideration of ancestry admixture in genetic analyses. The topics considered can be grouped into three categories: (1) global and local ancestry inference and estimation, (2) association and admixture mapping, and (3) genotype imputation in admixed samples. We describe the approaches that were used and the most relevant findings from each contribution. We also provide insight into the strengths and limitations of the state-of-the-art methods considered for genetic analyses in admixed populations.

| S-EPMC4339867 | biostudies-literature

Optimality of general lattice transformations with applications to the Bain strain in steel.

Project description:This article provides a rigorous proof of a conjecture by E. C. Bain in 1924 on the optimality of the so-called Bain strain based on a criterion of least atomic movement. A general framework that explores several such optimality criteria is introduced and employed to show the existence of optimal transformations between any two Bravais lattices. A precise algorithm and a graphical user interface to determine this optimal transformation is provided. Apart from the Bain conjecture concerning the transformation from face-centred cubic to body-centred cubic, applications include the face-centred cubic to body-centred tetragonal transition as well as the transformation between two triclinic phases of terephthalic acid.

| S-EPMC4892280 | biostudies-literature

Survival associated pathway identification with group Lp penalized global AUC maximization.

Project description:It has been demonstrated that genes in a cell do not act independently. They interact with one another to complete certain biological processes or to implement certain molecular functions. How to incorporate biological pathways or functional groups into the model and identify survival associated gene pathways is still a challenging problem. In this paper, we propose a novel iterative gradient based method for survival analysis with group Lp penalized global AUC summary maximization. Unlike LASSO, Lp (p < 1) (with its special implementation entitled adaptive LASSO) is asymptotic unbiased and has oracle properties 1. We first extend Lp for individual gene identification to group Lp penalty for pathway selection, and then develop a novel iterative gradient algorithm for penalized global AUC summary maximization (IGGAUCS). This method incorporates the genetic pathways into global AUC summary maximization and identifies survival associated pathways instead of individual genes. The tuning parameters are determined using 10-fold cross validation with training data only. The prediction performance is evaluated using test data. We apply the proposed method to survival outcome analysis with gene expression profile and identify multiple pathways simultaneously. Experimental results with simulation and gene expression data demonstrate that the proposed procedures can be used for identifying important biological pathways that are related to survival phenotype and for building a parsimonious model for predicting the survival times.

| S-EPMC2930641 | biostudies-literature

Bio-orthogonal phosphatidylserine conjugates for delivery and imaging applications.

Project description:The syntheses of phosphatidylserine (PS) conjugates are described, including fluorescent derivatives for potential cellular delivery and bioimaging applications. Installation of terminal functional groups (amine, thiol, or alkyne) onto the sn-2 chain provides reactive sites for bio-orthogonal conjugation of cargo with suitably protected PS derivatives. An amine-containing PS forms amide bonds with peptidic cargo, a thiol derivative is designed for conjugation to cargo that contain alpha-halo carbonyls or Michael acceptors, and the terminal alkyne PS analogue permits "click" conjugation with any azide-tagged molecule. This latter conjugation method is quite versatile as it can be performed without PS headgroup protection, in aqueous media, and with acid-labile cargo.

| S-EPMC2856328 | biostudies-literature

Protein aggregation: in silico algorithms and applications.

Project description:Protein aggregation is a topic of immense interest to the scientific community due to its role in several neurodegenerative diseases/disorders and industrial importance. Several in silico techniques, tools, and algorithms have been developed to predict aggregation in proteins and understand the aggregation mechanisms. This review attempts to provide an essence of the vast developments in in silico approaches, resources available, and future perspectives. It reviews aggregation-related databases, mechanistic models (aggregation-prone region and aggregation propensity prediction), kinetic models (aggregation rate prediction), and molecular dynamics studies related to aggregation. With a multitude of prediction models related to aggregation already available to the scientific community, the field of protein aggregation is rapidly maturing to tackle new applications.

| S-EPMC7930180 | biostudies-literature

Cellular frustration algorithms for anomaly detection applications.

Project description:Cellular frustrated models have been developed to describe how the adaptive immune system works. They are composed by independent agents that continuously pair and unpair depending on the information that one sub-set of these agents display. The emergent dynamics is sensitive to changes in the displayed information and can be used to detect anomalies, which can be important to accomplish the immune system main function of protecting the host. Therefore, it has been hypothesized that these models could be adequate to model the immune system activation. Likewise it has been hypothesized that these models could provide inspiration to develop new artificial intelligence algorithms for data mining applications. However, computational algorithms do not need to follow strictly the immunological reality. Here, we investigate efficient implementation strategies of these immune inspired ideas for anomaly detection applications and use real data to compare the performance of cellular frustration algorithms with standard implementations of one-class support vector machines and deep autoencoders. Our results demonstrate that more efficient implementations of cellular frustration algorithms are possible and also that cellular frustration algorithms can be advantageous for semi-supervised anomaly detection applications given their robustness and accuracy.

| S-EPMC6613704 | biostudies-literature

Fast and scalable likelihood maximization for Exponential Random Graph Models with local constraints.

Project description:Exponential Random Graph Models (ERGMs) have gained increasing popularity over the years. Rooted into statistical physics, the ERGMs framework has been successfully employed for reconstructing networks, detecting statistically significant patterns in graphs, counting networked configurations with given properties. From a technical point of view, the ERGMs workflow is defined by two subsequent optimization steps: the first one concerns the maximization of Shannon entropy and leads to identify the functional form of the ensemble probability distribution that is maximally non-committal with respect to the missing information; the second one concerns the maximization of the likelihood function induced by this probability distribution and leads to its numerical determination. This second step translates into the resolution of a system of O(N) non-linear, coupled equations (with N being the total number of nodes of the network under analysis), a problem that is affected by three main issues, i.e. accuracy, speed and scalability. The present paper aims at addressing these problems by comparing the performance of three algorithms (i.e. Newton's method, a quasi-Newton method and a recently-proposed fixed-point recipe) in solving several ERGMs, defined by binary and weighted constraints in both a directed and an undirected fashion. While Newton's method performs best for relatively little networks, the fixed-point recipe is to be preferred when large configurations are considered, as it ensures convergence to the solution within seconds for networks with hundreds of thousands of nodes (e.g. the Internet, Bitcoin). We attach to the paper a Python code implementing the three aforementioned algorithms on all the ERGMs considered in the present work.

| S-EPMC8316481 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data