Bubbles are pairs of internally vertex-disjoint (s, t)-paths in a directed graph. In de Bruijn graphs built from reads RNA and DNA data, bubbles represent interesting biological events, such as alternative splicing (AS) allelic differences (SNPs indels). However, the set all graph real data is usually too large to be efficiently enumerated analysed practice. particular, despite significant rese...

Depth First Search (DFS) tree is a fundamental data structure for graphs used in solving various algorithmic problems. However, very few results are known for maintaining DFS tree in a dynamic environment insertion or deletion of edges. The only non-trivial result for this problem is by Franciosa et al. [4]. They showed that, for a directed acyclic graph on n vertices, a DFS tree can be maintai...

Discovering the underlying structures present in large real world graphs is a fundamental scienti€c problem. Recent work at the intersection of formal language theory and graph theory has found that a Hyperedge Replacement Grammar (HRG) can be extracted from a tree decomposition of any graph. Œis HRG can be used to generate new graphs that share properties that are similar to the original graph...

We study the Steiner Tree problem, in which a set of terminal vertices needs to be connected in the cheapest possible way in an edge-weighted graph. This problem has been extensively studied from the viewpoint of approximation and also parametrization. In particular, on one hand Steiner Tree is known to be APX-hard, and W[2]-hard on the other, if parameterized by the number of non-terminals (St...

A technique is presented for verifying real-time system speciications. A visual conceptual modeling language called ECM is used as a real-time speciication language. Speciications are translated into augmented Petri nets with timing and temporal logic constraints. A reachability tree of legal system states is generated from the timing constraints in the Petri net. Past temporal logic constraint...

MODIS data is of significant for the classification of regional forest cover due to its high temporal resolution and high spectral resolution. Forest cover is an important parameter for forest ecosystem. The objective of this preliminary study is to mapping forest cover from mutli-temporal MODIS data with decision tree. The classification forest samples were selected from four global land cover...