Results 1  10
of
17
An Incremental Algorithm for a Generalization of the ShortestPath Problem
, 1992
"... The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsume ..."
Abstract

Cited by 116 (1 self)
 Add to MetaCart
The grammar problem, a generalization of the singlesource shortestpath problem introduced by Knuth, is to compute the minimumcost derivation of a terminal string from each nonterminal of a given contextfree grammar, with the cost of a derivation being suitably defined. This problem also subsumes the problem of finding optimal hyperpaths in directed hypergraphs (under varying optimization criteria) that has received attention recently. In this paper we present an incremental algorithm for a version of the grammar problem. As a special case of this algorithm we obtain an efficient incremental algorithm for the singlesource shortestpath problem with positive edge lengths. The aspect of our work that distinguishes it from other work on the dynamic shortestpath problem is its ability to handle "multiple heterogeneous modifications": between updates, the input graph is allowed to be restructured by an arbitrary mixture of edge insertions, edge deletions, and edgelength changes.
Directed Hypergraphs And Applications
, 1992
"... We deal with directed hypergraphs as a tool to model and solve some classes of problems arising in Operations Research and in Computer Science. Concepts such as connectivity, paths and cuts are defined. An extension of the main duality results to a special class of hypergraphs is presented. Algorith ..."
Abstract

Cited by 100 (5 self)
 Add to MetaCart
We deal with directed hypergraphs as a tool to model and solve some classes of problems arising in Operations Research and in Computer Science. Concepts such as connectivity, paths and cuts are defined. An extension of the main duality results to a special class of hypergraphs is presented. Algorithms to perform visits of hypergraphs and to find optimal paths are studied in detail. Some applications arising in propositional logic, AndOr graphs, relational data bases and transportation analysis are presented. January 1990 Revised, October 1992 ( * ) This research has been supported in part by the "Comitato Nazionale Scienza e Tecnologia dell'Informazione", National Research Council of Italy, under Grant n.89.00208.12, and in part by research grants from the National Research Council of Canada. 1 Dipartimento di Informatica, Università di Pisa, Italy 2 Département d'Informatique et de Recherche Opérationnelle, Université de Montréal, Canada 2 INTRODUCTION Hypergraphs, a generaliz...
Reconstructing a History of Recombinations From a Set of Sequences
 Discrete Appl. Math
, 1998
"... One of the classic problems in computational biology is the reconstruction of evolutionary history. A recent trend in the area is to increase the explanatory power of the models that are considered by incorporating higherorder evolutionary events that more accurately reflect the mechanisms of mutat ..."
Abstract

Cited by 39 (6 self)
 Add to MetaCart
One of the classic problems in computational biology is the reconstruction of evolutionary history. A recent trend in the area is to increase the explanatory power of the models that are considered by incorporating higherorder evolutionary events that more accurately reflect the mechanisms of mutation at the level of the chromosome. We take a step in this direction by considering the problem of reconstructing an evolutionary history for a set of genetic sequences that have evolved by recombination. Recombination is a nontreelike event that produces a child sequence by crossing two parent sequences. We present polynomialtime algorithms for reconstructing a parsimonious history of such events for several models of recombination when all sequences, including those of ancestors, are present in the input. We also show that these models appear to be near the limit of what can be solved in polynomial time, in that several natural generalizations are NPcomplete. Keywords Computational bio...
Optimal Traversal of Directed Hypergraphs
, 1992
"... A directed hypergraph is defined by a set of nodes and a set of hyperarcs, each connecting a set of source nodes to a single target node. Directed hypergraphs are used in several contexts to model different combinatorial structures, such as functional dependencies [Ull82], Horn clauses in proposi ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
A directed hypergraph is defined by a set of nodes and a set of hyperarcs, each connecting a set of source nodes to a single target node. Directed hypergraphs are used in several contexts to model different combinatorial structures, such as functional dependencies [Ull82], Horn clauses in propositional calculus [AI91], ANDOR graphs [Nil82], Petri nets [Pet62]. A hyperpath, similarly to the notion of path in directed graphs, consists of a connection among nodes using hyperarcs. Unlike paths in graphs, hyperpaths are suitable of different definitions of measure, corresponding to different concepts arising in various applications. In this paper we consider the problem of finding minimal hyperpaths according to several measures. We show that some of these problems are, not surprisingly, NPhard. However, if the measure function on hyperpaths matches certain conditions (which we define as valuebased measure functions) , the problem turns out to be solvable in polynomial time. We...
On The Computational Complexity of Inferring Evolutionary Trees
, 1993
"... The process of reconstructing evolutionary trees can be viewed formally as an optimization problem. Recently, decision problems associated with the most commonly used approaches to reconstructing such trees have been shown to be NPcomplete [Day87, DJS86, DS86, DS87, GF82, Kri88, KM86]. In this t ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
The process of reconstructing evolutionary trees can be viewed formally as an optimization problem. Recently, decision problems associated with the most commonly used approaches to reconstructing such trees have been shown to be NPcomplete [Day87, DJS86, DS86, DS87, GF82, Kri88, KM86]. In this thesis, a framework is established that incorporates all such problems studied to date. Within this framework, the NPcompleteness results for decision problems are extended by applying theorems from [CT91, Gas86, GKR92, JVV86, KST89, Kre88, Sel91] to derive bounds on the computational complexity of several functions associated with each of these problems, namely ffl evaluation functions, which return the cost of the optimal tree(s), ffl solution functions, which return an optimal tree, ffl spanning functions, which return the number of optimal trees, ffl enumeration functions, which systematically enumerate all optimal trees, and ffl randomselection functions, which return a random...
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms
 Lecture Notes in Computer Science
, 1998
"... . Directed hypergraphs are used in several applications to model different combinatorial structures. A directed hypergraph is defined by a set of nodes and a set of hyperarcs, each connecting a set of source nodes to a single target node. A hyperpath, similarly to the notion of path in directed ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
. Directed hypergraphs are used in several applications to model different combinatorial structures. A directed hypergraph is defined by a set of nodes and a set of hyperarcs, each connecting a set of source nodes to a single target node. A hyperpath, similarly to the notion of path in directed graphs, consists of a connection among nodes using hyperarcs. Unlike paths in graphs, however, hyperpaths are suitable of many different definitions of measure, corresponding to different concepts arising in various applications. In this paper we consider the problem of finding optimal hyperpaths according to several measures. We also provide results that may shed some light on the intrinsic complexity of finding optimal hyperpaths. 1 Introduction A directed hypergraph is a generalization of the concept of directed graph. It was first introduced in [2] to represent functional dependencies in relational data base schemata. While directed graphs are normally used for representing onet...
On Local Pruning of Association Rules Using Directed Hypergraphs
 ICDE’04 – Proc. of the 20th International Conference on Data Engeneering, IEEE
, 2003
"... In this paper we propose an adaptive local pruning method for association rules. Our method exploits the exact mapping between a certain class of association rules, namely those whose consequents are singletons and backward directed hypergraphs. The hypergraph which represents the association rules ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In this paper we propose an adaptive local pruning method for association rules. Our method exploits the exact mapping between a certain class of association rules, namely those whose consequents are singletons and backward directed hypergraphs. The hypergraph which represents the association rules is called an Association Rules Network(ARN). We propose two operations on this network for pruning rules, prove several properties of the ARN and apply the results of our approach to two popular data sets. Keywords: Association Rules Pruning, Interestingess, Directed Hypergraphs 1
Finding the K best policies in finitehorizon Markov decision processes. Submitted
, 2004
"... Directed hypergraphs represent a general modelling and algorithmic tool, which have been successfully used in many different research areas such as artificial intelligence, database systems, fuzzy systems, propositional logic and transportation networks. However, modelling Markov decision processes ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Directed hypergraphs represent a general modelling and algorithmic tool, which have been successfully used in many different research areas such as artificial intelligence, database systems, fuzzy systems, propositional logic and transportation networks. However, modelling Markov decision processes using directed hypergraphs has not yet been considered. In this paper we consider finitehorizon Markov decision processes (MDPs) with finite state and action space and present an algorithm for finding the K best policies. That is, we are interested in ranking the first K policies in nondecreasing order using an additive criterion of optimality. The algorithm uses a directed hypergraph to model the finitehorizon MDP. It is shown that the problem of finding the optimal policy can be formulated as a minimum weight hyperpath problem and be solved in linear time, with respect to the input data representing the MDP, using different additive optimality criteria.
Exploiting Functional Dependence in Query Optimization
, 2000
"... I authorize the University of Waterloo to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorize the University of Waterloo to reproduce this thesis by photocopying or by other means, in total or in part, at the request of other institutions ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
I authorize the University of Waterloo to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorize the University of Waterloo to reproduce this thesis by photocopying or by other means, in total or in part, at the request of other institutions or individuals for the purpose of scholarly research. iii The University of Waterloo requires the signatures of all persons using or photocopying this thesis. Please sign below, and give address and date. Functional dependency analysis can be applied to various problems in query optimization: selectivity estimation, estimation of (intermediate) result sizes, order optimization (in particular sort avoidance), cost estimation, and various problems in the area of semantic query optimization. Dependency analysis in an ansi sql relational model, however, is made complex due to the existence of null values, threevalued logic, outer joins, and duplicate rows. In this thesis we define the notions of strict and lax functional dependencies, strict and lax equivalence constraints, and null constraints, which capture both a