Telling Stories Fast - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Telling Stories Fast

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.
No file

Dates and versions

hal-00835201 , version 1 (18-06-2013)

Identifiers

  • HAL Id : hal-00835201 , version 1

Cite

Michele Borassi, Pierluigi Crescenzi, Vincent Lacroix, Andrea Marino, Marie-France Sagot, et al.. Telling Stories Fast. 12th International Symposium Experimental Algorithms (SEA), Jun 2013, Rome, Italy. pp.200-211. ⟨hal-00835201⟩
134 View
0 Download

Share

Gmail Facebook X LinkedIn More