8 papers · ranked by Valyu relevance
Deniz Akdemir
Missing data present an important challenge when dealing with high dimensional data arranged in the form of an array. In this paper, we propose methods for estimation of the parameters of array variate normal probability model from partially observed multi-way data. The methods developed here are useful for missing…
Sarthak Mishra, Megan L. Smith, Matthew W. Hahn
Reconciliation algorithms provide an accounting of the evolutionary history of individual gene trees given a species tree. Many reconciliation algorithms consider only duplication and loss events (and sometimes horizontal transfer), ignoring effects of the coalescent process, including incomplete lineage sorting (ILS).…
Qiong Wu, Zhen Zhang, James Waltz, Tianzhou Ma + 2 more
Link prediction is a fundamental problem in network analysis. In a complex network, links can be unreported and/or under detection limits due to heterogeneous noises and technical challenges during data collection. The incomplete network data can lead to an inaccurate inference of network based data analysis. We…
Ragheb Raad, Deep Ray, Bino Varghese, Darryl Hwang + 3 more
Image imputation refers to the task of generating a type of medical image given images of another type. This task becomes challenging when the difference between the available images, and the image to be imputed is large. In this manuscript, one such application, derived from the dynamic contrast enhanced computed…
Moritz Groden, Hannah M. Moessinger, Barbara Schaffran, Javier DeFelipe + 3 more
Investigating and modelling the functionality of human neurons remains challenging due to the technical limitations, resulting in scarce and incomplete 3D anatomical reconstructions. Here we used a morphological modelling approach based on optimal wiring to repair the parts of a dendritic morphology that were lost due…
Peter L. Bartlett, Chris Junchi Li, Jingfeng Wu, Bin Yu
In the field of optimization, developing accelerated methods for solving minimax and fixed-point problems remains a fundamental challenge. This paper presents a novel family of dual accelerated algorithms that achieve optimal convergence rates for both minimax and fixed-point problems. By exploring new anchoring…
Wilfried Agbeto, Camille Coti, Vladimir Reinharz
Subgraph isomorphism is a combinatorial problem that involves finding one or all occurrences of a pattern graph within a target graph. Subgraph isomorphism has numerous applications in fields such as biology, chemistry, social network analysis, and pattern recognition. Although subgraph isomorphism is generally…
Jing Xie, Qi Duan
Biological pathway analysis often requires identifying interventions that block reachability to an undesirable state, such as a disease-associated module, toxic byproduct, or adverse phenotype, while preserving reachability among essential biological functions. Motivated by this setting, we study the Reachability…