#### Filter Results:

#### Publication Year

1986

2012

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We study the algebraic varieties defined by the conditional independence statements of Bayesian networks. A complete algebraic classification is given for Bayesian networks on at most five random variables. Hidden variables are related to the geometry of higher secant varieties.

Evaluating the likelihood function of parameters in highly-structured population genetic models from extant deoxyribonucleic acid (DNA) sequences is computationally prohibitive. In such cases, one may approximately infer the parameters from summary statistics of the data such as the site-frequency-spectrum (SFS) or its linear combinations. Such methods are… (More)

In the present paper we study algorithms based on the theory of Gröbner bases for computing free resolutions of modules over polynomial rings. We propose a technique which consists in the application of special selection strategies to the Schreyer algorithm. The resulting algorithm is efficient and, in the graded case, allows a straightforward… (More)

In this note we describe aspects of the cohomology of coherent sheaves on a complete toric variety X over a field k and, more generally, the local cohomology, with supports in a monomial ideal, of a finitely generated module over a polynomial ring S. This leads to an efficient way of computing such cohomology, for which we give explicit algorithms. The… (More)

Boolean networks have long been used as models of molecular networks and play an increasingly important role in systems biology. This paper describes a software package, Polynome, offered as a web service, that helps users construct Boolean network models based on experimental data and biological input. The key feature is a discrete analog of parameter… (More)

<italic>Macaulay</italic> is a system for computing in algebraic geometry and cummutative algebra; it is capable of a variety of computations which are tedious or impossible to perform by hand. The primitive types in the system are polynomials, matrices, ideals, polynomial rings, modules, maps between rings, and complexes of modules. The system performs… (More)

- Bjarke Hammersholt, Roune, Michael Stillman
- 2012

We report on our experiences exploring state of the art Gröb-ner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature based Gröbner basis algorithms and more traditional variations of the classic Buchberger algorithm. Our conclusions are… (More)