Blick ins Buch

Analysis and Enumeration

Algorithms for Biological Graphs

Andrea Marino (Autor)

Buch | Hardcover

151 Seiten

2015
Atlantis Press (Zeger Karssen) (Verlag)
978-94-6239-096-6 (ISBN)

Lese- und Medienproben

Blick ins Buch (midvox)

Artikel merken

In this work we plan to revise the main techniques for enumeration algorithms and to show four examples of enumeration algorithms that can be applied to efficiently deal with some biological problems modelled by using biological networks: enumerating central and peripheral nodes of a network, enumerating stories, enumerating paths or cycles, and enumerating bubbles. Notice that the corresponding computational problems we define are of more general interest and our results hold in the case of arbitrary graphs. Enumerating all the most and less central vertices in a network according to their eccentricity is an example of an enumeration problem whose solutions are polynomial and can be listed in polynomial time, very often in linear or almost linear time in practice. Enumerating stories, i.e. all maximal directed acyclic subgraphs of a graph G whose sources and targets belong to a predefined subset of the vertices, is on the other hand an example of an enumeration problem with an exponential number of solutions, that can be solved by using a non trivial brute-force approach. Given a metabolic network, each individual story should explain how some interesting metabolites are derived from some others through a chain of reactions, by keeping all alternative pathways between sources and targets. Enumerating cycles or paths in an undirected graph, such as a protein-protein interaction undirected network, is an example of an enumeration problem in which all the solutions can be listed through an optimal algorithm, i.e. the time required to list all the solutions is dominated by the time to read the graph plus the time required to print all of them. By extending this result to directed graphs, it would be possible to deal more efficiently with feedback loops and signed paths analysis in signed or interaction directed graphs, such as gene regulatory networks. Finally, enumerating mouths or bubbles with a source s in a directed graph, that is enumerating all the two vertex-disjoint directed paths between the source s and all the possible targets, is an example of an enumeration problem in which all the solutions can be listed through a linear delay algorithm, meaning that the delay between any two consecutive solutions is linear, by turning the problem into a constrained cycle enumeration problem. Such patterns, in a de Bruijn graph representation of the reads obtained by sequencing, are related to polymorphisms in DNA- or RNA-seq data.

Introduction.- Enumeration Algorithms.- An Application: Biological Graph Analysis.- Telling Stories: Enumerating maximal directed acyclic graphs with constrained set of sources and targets.- Enumerating bubbles: listing pairs of vertex disjoint paths.- Enumerating Cycles and (s,t)-Paths in Undirected Graphs.- Enumerating Diametral and Radial vertices and computing Diameter and Radius of a graph.- Conclusions.

“This book is the publication of author's Ph.D. dissertation [Algorithms for biological graphs: analysis and enumeration, Univ. Florence, 2013] and is supported by the Italian Chapter of the EATCS. Only two dissertations a year might get this recognition so, as one expects, this is a high level text. … The book itself is nice to read and has an excellent bibliography.” (András Sándor Pluhár, Mathematical Reviews, April, 2017)

Reihe/Serie	Atlantis Studies in Computing ; 6
Zusatzinfo	39 Illustrations, black and white; XVII, 151 p. 39 illus.
Verlagsort	Paris
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Informatik ► Datenbanken ► Data Warehouse / Data Mining
	Informatik ► Theorie / Studium ► Algorithmen
	Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
	Naturwissenschaften ► Biologie
Schlagworte	Bubbles • Cycles and Paths • Enumeration Algorithms • Graphs • Stories
ISBN-10	94-6239-096-7 / 9462390967
ISBN-13	978-94-6239-096-6 / 9789462390966
Zustand	Neuware