Recent developments in molecular biology have resulted in experimental data that entails the relationships and interactions between biomolecules. Biomolecular interaction data, generally referred to as biological or cellular networks, are frequently abstracted using graph models. In systems biology, comparative analysis of these networks provides understanding of functional modularity in the cell by integrating cellular organization, functional hierarchy, and evolutionary conservation. In this study, we address a number of algorithmic issues associated with comparative analysis of molecular interaction networks. We first discuss the problem of identifying common sub-networks in a collection of molecular interaction networks belonging to diverse species. With a view to understanding the conservation and divergence of functional modules, we also develop network alignment techniques, grounded in theoretical models of network evolution. Finally, we probabilistically analyze the existence of highly connected and conserved subgraphs in random graphs, in order to assess the statistical significance of the patterns identified by our algorithms.
"Sinopsis" puede pertenecer a otra edición de este libro.
Recent developments in molecular biology have resulted in experimental data that entails the relationships and interactions between biomolecules. Biomolecular interaction data, generally referred to as biological or cellular networks, are frequently abstracted using graph models. In systems biology, comparative analysis of these networks provides understanding of functional modularity in the cell by integrating cellular organization, functional hierarchy, and evolutionary conservation. In this study, we address a number of algorithmic issues associated with comparative analysis of molecular interaction networks. We first discuss the problem of identifying common sub-networks in a collection of molecular interaction networks belonging to diverse species. With a view to understanding the conservation and divergence of functional modules, we also develop network alignment techniques, grounded in theoretical models of network evolution. Finally, we probabilistically analyze the existence of highly connected and conserved subgraphs in random graphs, in order to assess the statistical significance of the patterns identified by our algorithms.
Mehmet Koyutürk received his M.S. degree in Computer Engineering (1998) and Ph.D. degree Computer Science (2006), respectively from Bilkent University and Purdue University. In 2007, he joined the Electrical Engineering & Computer Science Department of Case Western Reserve University as T. & D. Schroeder Assistant Professor.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: moluna, Greven, Alemania
Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Koyutuerk MehmetMehmet Koyutuerk received his M.S. degree in Computer Engineeringn(1998) and Ph.D. degree Computer Science (2006), respectivelynfrom Bilkent University and Purdue University. In 2007, henjoined the Electrical Engineeri. Nº de ref. del artículo: 4958355
Cantidad disponible: Más de 20 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 136 pages. 8.66x5.91x0.34 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: 3639110358
Cantidad disponible: 1 disponibles