𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Application of Gröbner basis techniques to enzyme kinetics

✍ Scribed by Ercan Çelik; Mustafa Bayram

Book ID
108395890
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
269 KB
Volume
153
Category
Article
ISSN
0096-3003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Generalization of Gröbner Basis Algori
A Generalization of Gröbner Basis Algorithms to Polycyclic Group Rings
✍ Klaus Madlener; Birgit Reinert 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 656 KB

It is well-known that for the integral group ring of a polycyclic group several decision problems are decidable, in particular the ideal membership problem. In this paper we define an effective reduction relation for group rings over polycyclic groups. This reduction is based on left multiplication

Properties of Gröbner Bases and Applicat
Properties of Gröbner Bases and Applications to Doubly Periodic Arrays
✍ Mulan Liu; Lei Hu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 430 KB

In this paper the properties of Gröbner bases of zero-dimensional ideals are studied. A basis of the space of linear recurring arrays and the trace expression of linear recurring arrays are given.

Application of Gröbner bases to problems
Application of Gröbner bases to problems of movement of a particle
✍ N.I. Ioakimidis; E.G. Anastasselou 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 608 KB

The cfassicd method of Grijbner bases for multivariate polynomials in computer alge bra and the related Buchberger's algorithm and its modifications for the computation of such bases are applied to some elementary problems of kinematics as well as to the classical Kepler-Newton problem in celestial

An Optimal Algorithm for Constructing th
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups
✍ Ulla Koppenhagen; Ernst W. Mayr 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 404 KB

It is known that the reduced Gröbner basis of general polynomial ideals can be computed in exponential space. The algorithm, obtained by Kühnle and Mayr, is, however, based on rather complex parallel computations, and, above that, makes extensive use of the parallel computation thesis. In this paper