國立虎尾科技大學 |

Analysis and Enumeration = Algorithms for Biological Graphs /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Analysis and Enumeration/ by Andrea Marino.
Reminder of title:	Algorithms for Biological Graphs /
Author:	Marino, Andrea.
Description:	XVII, 151 p. 39 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.2991/978-94-6239-097-3
ISBN:	9789462390973

Analysis and Enumeration = Algorithms for Biological Graphs /
Marino, Andrea.

Analysis and EnumerationAlgorithms for Biological Graphs /[electronic resource] :by Andrea Marino. - 1st ed. 2015. - XVII, 151 p. 39 illus.online resource. - Atlantis Studies in Computing,62212-8557 ;. - Atlantis Studies in Computing,6.

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.

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.

ISBN: 9789462390973

Standard No.: 10.2991/978-94-6239-097-3doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Analysis and Enumeration = Algorithms for Biological Graphs /
LDR:04239nam a22003975i 4500 001 970520
003 DE-He213
005 20200706162633.0
007 cr nn 008mamaa
008 201211s2015 fr | s |||| 0|eng d
020 $a 9789462390973 $9 978-94-6239-097-3
024 7 $a 10.2991/978-94-6239-097-3 $2 doi
035 $a 978-94-6239-097-3
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
100 1 $a Marino, Andrea. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1266066
245 1 0 $a Analysis and Enumeration $h [electronic resource] : $b Algorithms for Biological Graphs / $c by Andrea Marino.
250 $a 1st ed. 2015.
264 1 $a Paris : $b Atlantis Press : $b Imprint: Atlantis Press, $c 2015.
300 $a XVII, 151 p. 39 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Atlantis Studies in Computing, $x 2212-8557 ; $v 6
505 0 $a 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.
520 $a 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.
650 0 $a Algorithms. $3 527865
650 0 $a Data mining. $3 528622
650 0 $a Bioinformatics. $3 583857
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Data Mining and Knowledge Discovery. $3 677765
650 2 4 $a Computational Biology/Bioinformatics. $3 677363
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9789462390980
776 0 8 $i Printed edition: $z 9789462390966
830 0 $a Atlantis Studies in Computing, $x 2212-8557 ; $v 6 $3 1266067
856 4 0 $u https://doi.org/10.2991/978-94-6239-097-3
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)