Measuring Phenotype-Phenotype Similarity Through the Interactome Jiajie Peng, Weiwei Hui and Xuequn Shang*
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Dual Proteome-Scale Networks Reveal Cell-Specific Remodeling of the Human Interactome
bioRxiv preprint doi: https://doi.org/10.1101/2020.01.19.905109; this version posted January 19, 2020. The copyright holder for this preprint (which was not certified by peer review) is the author/funder. All rights reserved. No reuse allowed without permission. Dual Proteome-scale Networks Reveal Cell-specific Remodeling of the Human Interactome Edward L. Huttlin1*, Raphael J. Bruckner1,3, Jose Navarrete-Perea1, Joe R. Cannon1,4, Kurt Baltier1,5, Fana Gebreab1, Melanie P. Gygi1, Alexandra Thornock1, Gabriela Zarraga1,6, Stanley Tam1,7, John Szpyt1, Alexandra Panov1, Hannah Parzen1,8, Sipei Fu1, Arvene Golbazi1, Eila Maenpaa1, Keegan Stricker1, Sanjukta Guha Thakurta1, Ramin Rad1, Joshua Pan2, David P. Nusinow1, Joao A. Paulo1, Devin K. Schweppe1, Laura Pontano Vaites1, J. Wade Harper1*, Steven P. Gygi1*# 1Department of Cell Biology, Harvard Medical School, Boston, MA, 02115, USA. 2Broad Institute, Cambridge, MA, 02142, USA. 3Present address: ICCB-Longwood Screening Facility, Harvard Medical School, Boston, MA, 02115, USA. 4Present address: Merck, West Point, PA, 19486, USA. 5Present address: IQ Proteomics, Cambridge, MA, 02139, USA. 6Present address: Vor Biopharma, Cambridge, MA, 02142, USA. 7Present address: Rubius Therapeutics, Cambridge, MA, 02139, USA. 8Present address: RPS North America, South Kingstown, RI, 02879, USA. *Correspondence: [email protected] (E.L.H.), [email protected] (J.W.H.), [email protected] (S.P.G.) #Lead Contact: [email protected] bioRxiv preprint doi: https://doi.org/10.1101/2020.01.19.905109; this version posted January 19, 2020. The copyright holder for this preprint (which was not certified by peer review) is the author/funder. -
Lowest Common Ancestors in Trees and Directed Acyclic Graphs1
Lowest Common Ancestors in Trees and Directed Acyclic Graphs1 Michael A. Bender2 3 Martín Farach-Colton4 Giridhar Pemmasani2 Steven Skiena2 5 Pavel Sumazin6 Version: We study the problem of finding lowest common ancestors (LCA) in trees and directed acyclic graphs (DAGs). Specifically, we extend the LCA problem to DAGs and study the LCA variants that arise in this general setting. We begin with a clear exposition of Berkman and Vishkin’s simple optimal algorithm for LCA in trees. The ideas presented are not novel theoretical contributions, but they lay the foundation for our work on LCA problems in DAGs. We present an algorithm that finds all-pairs-representative : LCA in DAGs in O~(n2 688 ) operations, provide a transitive-closure lower bound for the all-pairs-representative-LCA problem, and develop an LCA-existence algorithm that preprocesses the DAG in transitive-closure time. We also present a suboptimal but practical O(n3) algorithm for all-pairs-representative LCA in DAGs that uses ideas from the optimal algorithms in trees and DAGs. Our results reveal a close relationship between the LCA, all-pairs-shortest-path, and transitive-closure problems. We conclude the paper with a short experimental study of LCA algorithms in trees and DAGs. Our experiments and source code demonstrate the elegance of the preprocessing-query algorithms for LCA in trees. We show that for most trees the suboptimal Θ(n log n)-preprocessing Θ(1)-query algorithm should be preferred, and demonstrate that our proposed O(n3) algorithm for all- pairs-representative LCA in DAGs performs well in both low and high density DAGs. -
Protein Interaction Network Across Vast Evolutionary Distance
An inter-species protein-protein interaction network across vast evolutionary distance The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation Zhong, Q., S. J. Pevzner, T. Hao, Y. Wang, R. Mosca, J. Menche, M. Taipale, et al. “An Inter-Species Protein-Protein Interaction Network Across Vast Evolutionary Distance.” Molecular Systems Biology 12, no. 4 (April 22, 2016): 865–865. As Published http://dx.doi.org/10.15252/msb.20156484 Publisher EMBO Press Version Final published version Citable link http://hdl.handle.net/1721.1/103049 Terms of Use Creative Commons Attribution Detailed Terms http://creativecommons.org/licenses/by/4.0/ Published online: April 22, 2016 Article An inter-species protein–protein interaction network across vast evolutionary distance Quan Zhong1,2,3,†,****, Samuel J Pevzner1,2,4,5,†, Tong Hao1,2, Yang Wang1,2, Roberto Mosca6, Jörg Menche1,7, Mikko Taipale8, Murat Tasßan1,9,10,11, Changyu Fan1,2, Xinping Yang1,2, Patrick Haley1,2, Ryan R Murray1,2, Flora Mer1,2, Fana Gebreab1,2, Stanley Tam1,2, Andrew MacWilliams1,2, Amélie Dricot1,2, Patrick Reichert1,2, Balaji Santhanam1,2, Lila Ghamsari1,2, Michael A Calderwood1,2, Thomas Rolland1,2, Benoit Charloteaux1,2, Susan Lindquist8,12,13, Albert-László Barabási1,7,14, David E Hill1,2, Patrick Aloy6,15, Michael E Cusick1,2, Yu Xia1,16,***, Frederick P Roth1,9,10,11,17,** & Marc Vidal1,2,* Abstract proteomes beyond human–yeast homologs. Our data support evolutionary selection against biophysical interactions between In cellular systems, biophysical interactions between macro- proteins with little or no co-functionality. -
Minimum Cut in $ O (M\Log^ 2 N) $ Time
Minimum Cut in O(m log2 n) Time Pawe lGawrychowski1, Shay Mozes2, and Oren Weimann3 1 University of Wroc law, Poland, [email protected] 2 The Interdisciplinary Center Herzliya, Israel, [email protected] 3 University of Haifa, Israel, [email protected] Abstract We give a randomized algorithm that finds a minimum cut in an undirected weighted m-edge n-vertex graph G with high probability in O(m log2 n) time. This is the first improvement to Karger's celebrated O(m log3 n) time algorithm from 1996. Our main technical contribution is a deterministic O(m log n) time algorithm that, given a spanning tree T of G, finds a minimum cut of G that 2-respects (cuts two edges of) T . arXiv:1911.01145v5 [cs.DS] 3 Aug 2020 1 Introduction The minimum cut problem is one of the most fundamental and well-studied optimization problems in theoretical computer science. Given an undirected edge-weighted graph G = (V; E), the problem asks to find a subset of vertices S such that the total weight of all edges between S and V n S is minimized. The vast literature on the minimum cut problem can be classified into three main approaches: The maximum-flow approach. The minimum cut problem was originally solved by computing the maximum st-flow [3] for all pairs of vertices s and t. In 1961, Gomory and Hu [10] showed that only O(n) maximum st-flow computations are required, and in 1994 Hao and Orlin [11] showed that in fact a single maximum st-flow computation suffices. -
Compressed Range Minimum Queries⋆
Compressed Range Minimum Queries? Seungbum Jo1, Shay Mozes2, and Oren Weimann3 1 University of Haifa [email protected] 2 Interdisciplinary Center Herzliya [email protected] 3 University of Haifa [email protected] Abstract. Given a string S of n integers in [0; σ), a range minimum query RMQ(i; j) asks for the index of the smallest integer in S[i : : : j]. It is well known that the problem can be solved with a succinct data structure of size 2n + o(n) and constant query-time. In this paper we show how to preprocess S into a compressed representation that allows fast range minimum queries. This allows for sublinear size data struc- tures with logarithmic query time. The most natural approach is to use string compression and construct a data structure for answering range minimum queries directly on the compressed string. We investigate this approach using grammar compression. We then consider an alternative approach. Even if S is not compressible, its Cartesian tree necessar- ily is. Therefore, instead of compressing S using string compression, we compress the Cartesian tree of S using tree compression. We show that this approach can be exponentially better than the former, and is never worse by more than an O(σ) factor (i.e. for constant alphabets it is never asymptotically worse). 1 Introduction Given a string S of n integers in [0; σ), a range minimum query RMQ(i; j) returns the index of the smallest integer in S[i : : : j]. A range minimum data structure consists of a preprocessing algorithm and a query algorithm. -
A Proteome-Scale Map of the Human Interactome Network
Resource A Proteome-Scale Map of the Human Interactome Network Thomas Rolland,1,2,19 Murat Tasxan,1,3,4,5,19 Benoit Charloteaux,1,2,19 Samuel J. Pevzner,1,2,6,7,19 Quan Zhong,1,2,8,19 Nidhi Sahni,1,2,19 Song Yi,1,2,19 Irma Lemmens,9 Celia Fontanillo,10 Roberto Mosca,11 Atanas Kamburov,1,2 Susan D. Ghiassian,1,12 Xinping Yang,1,2 Lila Ghamsari,1,2 Dawit Balcha,1,2 Bridget E. Begg,1,2 Pascal Braun,1,2 Marc Brehme,1,2 Martin P. Broly,1,2 Anne-Ruxandra Carvunis,1,2 Dan Convery-Zupan,1,2 Roser Corominas,13 Jasmin Coulombe-Huntington,1,14 Elizabeth Dann,1,2 Matija Dreze,1,2 Ame´ lie Dricot,1,2 Changyu Fan,1,2 Eric Franzosa,1,14 Fana Gebreab,1,2 Bryan J. Gutierrez,1,2 Madeleine F. Hardy,1,2 Mike Jin,1,2 Shuli Kang,13 Ruth Kiros,1,2 Guan Ning Lin,13 Katja Luck,1,2 Andrew MacWilliams,1,2 Jo¨ rg Menche,1,12 Ryan R. Murray,1,2 Alexandre Palagi,1,2 Matthew M. Poulin,1,2 Xavier Rambout,1,2,15 John Rasla,1,2 Patrick Reichert,1,2 Viviana Romero,1,2 Elien Ruyssinck,9 Julie M. Sahalie,1,2 Annemarie Scholz,1,2 Akash A. Shah,1,2 Amitabh Sharma,1,12 Yun Shen,1,2 Kerstin Spirohn,1,2 Stanley Tam,1,2 Alexander O. Tejeda,1,2 Shelly A. Trigg,1,2 Jean-Claude Twizere,1,2,15 Kerwin Vega,1,2 Jennifer Walsh,1,2 Michael E. -
Large-Scale Analysis of Disease Pathways in the Human Interactome
Large-scale analysis of disease pathways in the human interactome 1, 1, 1,2 Monica Agrawal ‡, Marinka Zitnik ‡, and Jure Leskovec 1Department of Computer Science, Stanford University, Stanford, CA, USA 2Chan Zuckerberg Biohub, San Francisco, CA, USA ‡Equal contribution; Email: {agrawalm, marinka, jure}@cs.stanford.edu Discovering disease pathways, which can be defined as sets of proteins associated with a given dis- ease, is an important problem that has the potential to provide clinically actionable insights for dis- ease diagnosis, prognosis, and treatment. Computational methods aid the discovery by relying on protein-protein interaction (PPI) networks. They start with a few known disease-associated proteins and aim to find the rest of the pathway by exploring the PPI network around the known disease pro- teins. However, the success of such methods has been limited, and failure cases have not been well understood. Here we study the PPI network structure of 519 disease pathways. We find that 90% of pathways do not correspond to single well-connected components in the PPI network. Instead, proteins associated with a single disease tend to form many separate connected components/regions in the network. We then evaluate state-of-the-art disease pathway discovery methods and show that their performance is especially poor on diseases with disconnected pathways. Thus, we conclude that network connectivity structure alone may not be sufficient for disease pathway discovery. However, we show that higher-order network structures, such as small subgraphs of the pathway, provide a promising direction for the development of new methods. Keywords: disease pathways, disease protein discovery, protein-protein interaction networks 1. -
Common Ancestor Algorithms in Dags
TUM INSTITUTF URINFORMATIK¨ A Path Cover Technique for LCAs in Dags Andrzej Lingas Miroslaw Kowaluk Johannes Nowak ABCDE FGHIJ KLMNO TUM-I0809 April 08 TECHNISCHEUNIVERSIT ATM¨ UNCHEN¨ TUM-INFO-04-I0809-0/1.-FI Alle Rechte vorbehalten Nachdruck auch auszugsweise verboten c 2008 Druck: Institut f¨urInformatik der Technischen Universit¨atM¨unchen A Path Cover Technique for LCAs in Dags Mirosław Kowaluk ∗ Andrzej Lingas † Johannes Nowak ‡ Abstract We develop a path cover technique to solve lowest common ancestor (LCA for short) problems in a directed acyclic graph (dag). Our method yields improved upper bounds for two recently studied problem variants, com- puting one (representative) LCA for all pairs of vertices and computing all LCAs for all pairs of vertices. The bounds are expressed in terms of the number n of vertices and the so called width w(G) of the input dag G. For the first problem we achieve Oe(n2w(G)) time which improves the upper bound of [?] for dags with w(G) = O(n0.376−δ) for a constant δ > 0. For the second problem our Oe(n2w(G)2) upper time bound subsumes the O(n3.334) bound established in [?] for w(G) = O(n0.667−δ). As a second major result we show how to combine the path cover technique with LCA solu- tions for dags with small depth [?]. Our algorithm attains the best known upper time bound for this problem of O(n2.575). However, most notably, the algorithm performs better on a vast amount of input dags, i.e., dags that do not have an almost linear-sized subdag of extremely regular structure. -
Protein Interaction Networks from Yeast to Human Peer Bork1,2, Lars J Jensen1, Christian Von Mering1, Arun K Ramani3, Insuk Lee3 and Edward M Marcotte3,4
Protein interaction networks from yeast to human Peer Bork1,2, Lars J Jensen1, Christian von Mering1, Arun K Ramani3, Insuk Lee3 and Edward M Marcotte3,4 Protein interaction networks summarize large amounts of genes to various degrees were published in the same protein–protein interaction data, both from individual, small- period (e.g. localization data, double knockouts, etc.) scale experiments and from automated high-throughput and other sources, such as spotted microarrays, have been screens. The past year has seen a flood of new experimental used to extract interaction information [8]. In the light of data, especially on metazoans, as well as an increasing number these developments, several databases storing interaction of analyses designed to reveal aspects of network topology, data became very popular, derived at first mainly from modularity and evolution. As only minimal progress has been small-scale experiments (e.g. [9–12]) and increasingly made in mapping the human proteome using high-throughput becoming warehouses for large-scale assay data, while screens, the transfer of interaction information within and across novel databases continue to be developed [13]. species has become increasingly important. With more and more heterogeneous raw data becoming available, proper data This data collection phase was accompanied by intensive integration and quality control have become essential for reliable analysis and comparison of networks, particularly based protein network reconstruction, and will be especially important on the large protein interaction data sets mentioned for reconstructing the human protein interaction network. above. The networks were compared to each other, to known protein complexes, to functional annotation and Addresses to other types of high-throughput experimental data. -
Comparison of Human Protein-Protein Interaction Maps
Comparison of Human Protein-Protein Interaction Maps Matthias E. Futschik 1 , Gautam Chaurasia1,2 , Erich Wanker2 and Hanspeter Herzel1 1 Institute for Theoretical Biology, Charité, Humboldt-Universität and 2 Max-Delbrück-Centrum, Invalidenstrasse 43 10115 Berlin, Germany [email protected] Abstract: Large-scale mappings of protein-protein interactions have started to give us new views of the complex molecular mechanisms inside a cell. After initial projects to systematically map protein interactions in model organisms such as yeast, worm and fly, researchers have begun to focus on the mapping of the human interactome. To tackle this enormous challenge, different approaches have been proposed and pursued. While several large-scale human protein interaction maps have recently been published, their quality remains to be critically assessed. We present here a first comparative analysis of eight currentlyavailable large-scale maps with a total of over 10000 unique proteins and 57000 interactions included. They are based either on literature search, orthology or by yeast-two-hybrid assays. Comparison reveals only a small, but statistically significant overlap. More importantly, our analysis gives clear indications that all interaction maps suffer under selection and detection biases. These results have to be taken into account for future assembly of the human interactome. 1 Introduction Interactions between proteinsunderlie the vast majority of cellular processes. They are essential for a wide range of tasks and form a network of astonishing complexity. Until recently, our knowledge of this complex network was rather limited. The emergence of large scale protein-protein interaction maps has given us new possibilities to systematically survey and study the underlying biological system. -
Race Detection in Two Dimensions
Race Detection in Two Dimensions Dimitar Dimitrov Martin Vechev Vivek Sarkar Department of Computer Department of Computer Department of Computer Science, ETH Zürich Science, ETH Zürich Science, Rice University Universitätstrasse 6 Universitätstrasse 6 6100 Main St., 8092 Zürich, Switzerland 8092 Zürich, Switzerland Houston, TX, USA [email protected] [email protected] [email protected] ABSTRACT Race detection challenges. Dynamic data race detection is a program analysis technique Automatic data race detection techniques are extremely for detecting errors provoked by undesired interleavings of valuable in detecting potentially harmful sources of concur- concurrent threads. A primary challenge when designing rent interference, and therefore in ensuring that a parallel efficient race detection algorithms is to achieve manageable program behaves as expected. Designing precise race detec- space requirements. tion algorithms (i.e., not reporting false positives) which scale State of the art algorithms for unstructured parallelism to realistic parallel programs is a very challenging problem. require Θ(n) space per monitored memory location, where n In particular, it is important that a race detection algorithm is the total number of tasks. This is a serious drawback when continues to perform well as the number of concurrently analyzing programs with many tasks. In contrast, algorithms executing threads increases. for programs with a series-parallel (SP) structure require only Unfortunately, state of the art race detection techniques [13] Θ(1) space. Unfortunately, it is currently poorly understood that handle arbitrary parallelism suffer from scalability issues: if there are classes of parallelism beyond SP that can also their memory usage is Θ(n) per monitored memory location, benefit from and be analyzed with Θ(1) space complexity. -
Arxiv:2001.07765V1 [Cs.DS] 21 Jan 2020 749022 and Has Been Supported by Pareto-Optimal Parameterized Algorithms, ERC Starting Grant 715744
Faster and Enhanced Inclusion-Minimal Cograph Completion ? ?? Christophe Crespelle1, Daniel Lokshtanov1, Thi Ha Duong Phan2, and Eric Thierry3 1 University of Bergen, Department of Informatics, N-5020 Bergen, NORWAY [email protected], [email protected] 2 Institute of Mathematics, Vietnam Academy of Science and Technology, 18 Hoang Quoc Viet, Hanoi, Vietnam [email protected] 3 Univ Lyon, ENS de Lyon, UCB Lyon 1, CNRS, Inria, LIP UMR 5668, 15 parvis Ren´eDescartes, F-69342, Lyon, FRANCE [email protected] Abstract. We design two incremental algorithms for computing an inclusion-minimal completion of an arbitrary graph into a cograph. The first one is able to do so while providing an additional property which is crucial in practice to obtain inclusion-minimal completions using as few edges as possible : it is able to compute a minimum-cardinality com- pletion of the neighbourhood of the new vertex introduced at each in- cremental step. It runs in O(n + m0) time, where m0 is the number of edges in the completed graph. This matches the complexity of the al- gorithm in [41] and positively answers one of their open questions. Our second algorithm improves the complexity of inclusion-minimal comple- tion to O(n + m log2 n) when the additional property above is not re- quired. Moreover, we prove that many very sparse graphs, having only O(n) edges, require Ω(n2) edges in any of their cograph completions. For these graphs, which include many of those encountered in applications, the improvement we obtain on the complexity scales as O(n= log2 n).