Graph Theoretical Approaches to Delineate Dynamics of Biological Processes

Graphs are used in Computational Biology to model the relati onships between biological entities. For example, experimentally determine d protein interactions are commonly represented by a graph, the so-called protein interaction network , where proteins are nodes and every pair of interacting proteins is connected by an edge. Even though such a representation may not capture all the com plexity of protein interactions in underlying biological processes, the study of th e topological properties of these networks has become an important tool in searching for general principles that govern the organization of molecular networks. For example , it was observed that in protein interaction networks some types of small-size subn etworks are much more abundant than would be expected by chance [53]. The discover y f these overrepresented subnetworks or network motifshas led to investigation of their information processing properties [64] and network evolution mechanis ms that could account for their emergence [52]. Usage of graph theoretical tools is no t limited to the study of protein interaction networks, graphs are also used to mod el metabolic networks (processes), gene co-expression, gene co-regulation, phy logenies, etc. In general, graphs are not required to have any type of regula rity. This makes them very flexible combinatorial objects, which are able to repre sent complex and diverse relationships. In practice, however, graphs that model rea l world phenomena often belong to families of graphs with a special structure, which can be exploited to gain

[1]  S. Benzer ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE. , 1959, Proceedings of the National Academy of Sciences of the United States of America.

[2]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[3]  E. Wilson A Consistency Test for Phylogenies Based on Contemporaneous Species , 1965 .

[4]  L. Cavalli-Sforza,et al.  PHYLOGENETIC ANALYSIS: MODELS AND ESTIMATION PROCEDURES , 1967, Evolution; international journal of organic evolution.

[5]  W. Fitch Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology , 1971 .

[6]  F. Gavril The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[7]  Miss A.O. Penney (b) , 1974, The New Yale Book of Quotations.

[8]  Peter Buneman,et al.  A characterisation of rigid circuit graphs , 1974, Discret. Math..

[9]  Robert E. Tarjan,et al.  Algorithmic aspects of vertex elimination , 1975, STOC.

[10]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[13]  M. Golummc Algorithmic graph theory and perfect graphs , 1980 .

[14]  Philip A. Bernstein,et al.  Power of Natural Semijoins , 1981, SIAM J. Comput..

[15]  M. Yannakakis Computing the Minimum Fill-in is NP^Complete , 1981 .

[16]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[17]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[18]  F. Radermacher,et al.  Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization , 1984 .

[19]  F. McMorris,et al.  Topics in Intersection Graph Theory , 1987 .

[20]  Fanica Gavril,et al.  Generating the Maximum Spanning Trees of a Weighted Graph , 1987, J. Algorithms.

[21]  Richard C. T. Lee,et al.  Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel , 1989, Inf. Process. Lett..

[22]  S. Fields,et al.  A novel genetic system to detect protein–protein interactions , 1989, Nature.

[23]  Sampath Kannan,et al.  Inferring evolutionary history from DNA sequences , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[24]  Dan Gusfield,et al.  Efficient algorithms for inferring evolutionary trees , 1991, Networks.

[25]  Sampath Kannan,et al.  Triangulating three-colored graphs , 1991, SODA '91.

[26]  Michael R. Fellows,et al.  Two Strikes Against Perfect Phylogeny , 1992, ICALP.

[27]  David Fernández-Baca,et al.  A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed , 1993, FOCS.

[28]  Fred R. McMorris,et al.  Triangulating vertex colored graphs , 1994, SODA '93.

[29]  Ton Kloks,et al.  A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs , 1993, J. Algorithms.

[30]  Alejandro A. Schäffer,et al.  Triangulating Three-Colored Graphs in Linear Time and Linear Space , 1993, SIAM J. Discret. Math..

[31]  A. George,et al.  Graph theory and sparse matrix computation , 1993 .

[32]  Sampath Kannan,et al.  Inferring Evolutionary History from DNA Sequences , 1994, SIAM J. Comput..

[33]  Leizhen Cai,et al.  Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties , 1996, Inf. Process. Lett..

[34]  R. Raff,et al.  Evidence for a clade of nematodes, arthropods and other moulting animals , 1997, Nature.

[35]  Stephan Olariu,et al.  The ultimate interval graph recognition algorithm? , 1998, SODA '98.

[36]  Haim Kaplan,et al.  Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs , 1999, SIAM J. Comput..

[37]  Vladimir Batagelj,et al.  Pajek - Program for Large Network Analysis , 1999 .

[38]  B. Séraphin,et al.  A generic protein purification method for protein complex characterization and proteome exploration , 1999, Nature Biotechnology.

[39]  James R. Knight,et al.  A comprehensive analysis of protein–protein interactions in Saccharomyces cerevisiae , 2000, Nature.

[40]  W. Wheeler,et al.  Triploblastic relationships with emphasis on the acoelomates and the position of Gnathostomulida, Cycliophora, Plathelminthes, and Chaetognatha: a combined approach of 18S rDNA sequences and morphology. , 2000, Systematic biology.

[41]  N. Lartillot,et al.  The new animal phylogeny: reliability and implications. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[42]  K. Peterson,et al.  Animal phylogeny and the ancestry of bilaterians: inferences from morphology and 18S rDNA gene sequences , 2001, Evolution & development.

[43]  R. Ozawa,et al.  A comprehensive two-hybrid analysis to explore the yeast protein interactome , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[44]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[45]  Martin Steffen,et al.  Automated modelling of signal transduction networks , 2002, BMC Bioinformatics.

[46]  S. Shen-Orr,et al.  Networks Network Motifs : Simple Building Blocks of Complex , 2002 .

[47]  Gary D Bader,et al.  Systematic identification of protein complexes in Saccharomyces cerevisiae by mass spectrometry , 2002, Nature.

[48]  S. Shen-Orr,et al.  Network motifs in the transcriptional regulation network of Escherichia coli , 2002, Nature Genetics.

[49]  P. Bork,et al.  Functional organization of the yeast proteome by systematic analysis of protein complexes , 2002, Nature.

[50]  T. Gojobori,et al.  Bmc Evolutionary Biology the Evolutionary Position of Nematodes , 2022 .

[51]  J. Mallatt,et al.  Testing the new animal phylogeny: first use of combined large-subunit and small-subunit rRNA gene sequences to classify the protostomes. , 2002, Molecular biology and evolution.

[52]  E. Koonin,et al.  Remarkable Interkingdom Conservation of Intron Positions and Massive, Lineage-Specific Intron Loss and Gain in Eukaryotic Evolution , 2003, Current Biology.

[53]  M. Rose,et al.  Pheromone-induced polarization is dependent on the Fus3p MAPK acting through the formin Bni1p , 2004, The Journal of cell biology.

[54]  Adam J. Smith,et al.  The Database of Interacting Proteins: 2004 update , 2004, Nucleic Acids Res..

[55]  E. Koonin,et al.  Coelomata and not Ecdysozoa: evidence from genome-wide phylogenetic analysis. , 2003, Genome research.

[56]  G. Casari,et al.  Method Modular decomposition of protein-protein interaction networks , 2004 .

[57]  Yang Huang,et al.  Discovering temporal relations in molecular pathways using protein-protein interactions , 2004, RECOMB '04.

[58]  M. Dlakić The ribosomal subunit assembly line , 2005, Genome Biology.

[59]  W. Gilbert,et al.  Resolution of a deep animal divergence by the pattern of intron conservation. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[60]  L. Bardwell A walk-through of the yeast mating pheromone response pathway , 2004, Peptides.

[61]  M. Mann,et al.  Quantitative Phosphoproteomics Applied to the Yeast Pheromone Signaling Pathway*S , 2005, Molecular & Cellular Proteomics.

[62]  E. Ziv,et al.  Inferring network mechanisms: the Drosophila melanogaster protein interaction network. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[63]  B. Snel,et al.  Toward Automatic Reconstruction of a Highly Resolved Tree of Life , 2006, Science.

[64]  Roded Sharan,et al.  Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks , 2006, J. Comput. Biol..

[65]  Sean R. Collins,et al.  Global landscape of protein complexes in the yeast Saccharomyces cerevisiae , 2006, Nature.

[66]  Teresa M. Przytycka,et al.  Decomposition of overlapping protein complexes: A graph theoretical method for analyzing static and dynamic protein associations , 2005, Algorithms for Molecular Biology.

[67]  Teresa M. Przytycka,et al.  An Important Connection Between Network Motifs and Parsimony Models , 2006, RECOMB.

[68]  P. Bork,et al.  Proteome survey reveals modularity of the yeast cell machinery , 2006, Nature.