Connecting Seed Lists of Mammalian Proteins Using Steiner Trees

Multivariate experiments and genomics studies applied to mammalian cells often produce lists of genes or proteins altered under treatment/disease vs. control/normal conditions. Such lists can be identified in known protein-protein interaction networks to produce subnetworks that “connect” the genes or proteins from the lists. Such subnetworks are valuable for biologists since they can suggest regulatory mechanisms that are altered under different conditions. Often such subnetworks are overloaded with links and nodes resulting in connectivity diagrams that are illegible due to edge overlap. In this study, we attempt to address this problem by implementing an approximation to the Steiner Tree problem to connect seed lists of mammalian proteins/genes using literature-based protein-protein interaction networks. To avoid over-representation of hubs in the resultant Steiner Trees we assign a cost to Steiner Vertices based on their connectivity degree. We applied the algorithm to lists of genes commonly mutated in colorectal cancer to demonstrate the usefulness of this approach

Query processing in distributed data bases

Bibliography: p. 22."July, 1981."Office of Naval Research contract ONR/N 00014-77-C-0532 (NR 041-519)by Victor O.K. Li

A Survey of Network Design Problems

Network design problems arise in many different application areas such as air freight, highway traffic, and communication systems. The intention of this survey is to present a coherent unified view of a number of papers in the network design literature. We discuss suggested solution procedures, computational experience, relations between various network models, and potential application areas. Promising topics of research for improving, solving, and extending the models reviewed in this survey are also indicated.Supported in part by the U.S. Department of Transportation under contract DOT-TSC-1058, Transportation Advanced Research Program (TARP)

Aviation and programmatic analyses; Volume 1, Task 1: Aviation data base development and application

A method was developed for using the NASA aviation data base and computer programs in conjunction with the GE management analysis and projection service to perform simple and complex economic analysis for planning, forecasting, and evaluating OAST programs. Capabilities of the system are discussed along with procedures for making basic data tabulations, updates and entries. The system is applied in an agricultural aviation study in order to assess its value for actual utility in the OAST working environment

Aspects of distance measures in graphs.

Thesis (Ph.D.)-University of KwaZulu-Natal, Westville, 2011.In this thesis we investigate bounds on distance measures, namely, Steiner diameter and radius, in terms of other graph parameters. The thesis consists of four chapters. In Chapter 1, we define the most significant terms used throughout the thesis, provide an underlying motivation for our research and give background in relevant results. Let G be a connected graph of order p and S a nonempty set of vertices of G. Then the Steiner distance d(S) of S is the minimum size of a connected subgraph of G whose vertex set contains S. If n is an integer, 2 ≤ n ≤ p, the Steiner n-diameter, diamn(G), of G is the maximum Steiner distance of any n-subset of vertices of G. In Chapter 2, we give a bound on diamn(G) for a graph G in terms of the order of G and the minimum degree of G. Our result implies a bound on the ordinary diameter by Erdös, Pach, Pollack and Tuza. We obtain improved bounds on diamn(G) for K3-free graphs and C4-free graphs. In Chapter 3, we prove that, if G is a 3-connected plane graph of order p and maximum face length l then the radius of G does not exceed p/6 + 5l/6 + 5/6. For constant l, our bound improves on a bound by Harant. Furthermore we extend these results to 4- and 5-connected planar graphs. Finally, we complete our study in Chapter 4 by providing an upper bound on diamn(G) for a maximal planar graph G

Andrey Bely: A Critical Review

Andrey Bely, novelist, essayist, theoretician, critic, and poet, was a central figure in the Russian Symbolist movement of the 1920s, the most important literary movement in Russia in this century. Bely articulated a Symbolist aesthetic and originated a new approach to the study of Russian metrics and versification, giving rise to a new scholarly discipline that still thrives in the West. Although regarded by some critics, including Vladimir Nabokov, as the author of the greatest Russian novel of this century, Bely has been nearly forgotten in his native country for ideological reasons. In the West he remains little known and generally under-valued. But with recent English translations of Kotik Letaev and his masterpiece, Petersburg, interest in Bely is increasing. Janecek\u27s book brings together some of the best modern scholarship on Bely and the Russian Symbolist movement of the 1920s. Gerald Janecek is associate professor of Russian at the University of Kentucky.https://uknowledge.uky.edu/upk_slavic_languages_and_societies/1001/thumbnail.jp