Abstract
This paper presents a linear-time delay algorithm for enumerating all directed acyclic subgraphs of a directed graph G(V,E) that have their sources and targets included in two subsets S and T of V, respectively. From these subgraphs, called pitches, the maximal ones, called stories, may be extracted in a dramatically more efficient way in relation to a previous story telling algorithm. The improvement may even increase if a pruning technique is further applied that avoids generating many pitches which have no chance to lead to a story. We experimentally demonstrate these statements by making use of a quite large dataset of real metabolic pathways and networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Acuña, V., Birmelé, E., Cottret, L., Crescenzi, P., Jourdan, F., Lacroix, V., Marchetti-Spaccamela, A., Marino, A., Milreu, P.V., Sagot, M.F., Stougie, L.: Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets. Theor. Comput. Sci. 457, 1–9 (2012)
Schwikowski, B., Speckenmeyer, E.: On enumerating all minimal solutions of feedback problems. Discrete Applied Mathematics 117(1-3), 253–265 (2002)
Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On Generating All Maximal Independent Sets. Inf. Process. Lett. 27(3), 119–123 (1988)
Avis, D., Fukuda, K.: Reverse Search for Enumeration. Discrete Applied Mathematics 65, 21–46 (1993)
Uno, T.: Two general methods to reduce delay and change of enumeration algorithms. NII Technical Report (2003)
Milreu, P.V.: Enumerating Functional Substructures of Genome-Scale Metabolic Networks: Stories, Precursors and Organisations. PhD thesis, Université Claude Bernard, Lyon 1, France (2012)
Milreu, P.V., Acuña, V., Birmelé, E., Borassi, M., Cottret, L., Junot, C., Klein, C., Marchetti-Spaccamela, A., Marino, A., Stougie, L., Jourdan, F., Lacroix, V., Crescenzi, P., Sagot, M.-F.: Metabolic stories: exploring all possible scenarios for metabolomics data analysi (in preparation, 2013)
Cottret, L., Wildridge, D., Vinson, F., Barrett, M.P., Charles, H., Sagot, M.F., Jourdan, F.: Metexplore: a web server to link metabolomic experiments and genome-scale metabolic networks. Nucleic Acids Research 38(Web-Server-Issue), 132–137 (2010)
Johnson, C.H., Gonzalez, F.J.: Challenges and opportunities of metabolomics. Journal of Cellular Physiology 227(8), 2975–2981 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borassi, M., Crescenzi, P., Lacroix, V., Marino, A., Sagot, MF., Milreu, P.V. (2013). Telling Stories Fast. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds) Experimental Algorithms. SEA 2013. Lecture Notes in Computer Science, vol 7933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38527-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-38527-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38526-1
Online ISBN: 978-3-642-38527-8
eBook Packages: Computer ScienceComputer Science (R0)