7 search results - page 1 / 2 » On the Relation between Polynomial Identity Testing and Find... |
ICALP
2010
Springer
14 years 11 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
CSCLP
2007
Springer
15 years 16 days ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
BMCBI
2006
14 years 6 months ago
2006
Background: Two-dimensional gel electrophoresis (2DE) is a powerful technique to examine post-translational modifications of complexly modulated proteins. Currently, spot detectio...
BMCBI
2006
14 years 6 months ago
2006
Background: The identification of biologically interesting genes in a temporal expression profiling dataset is challenging and complicated by high levels of experimental noise. Mo...
BIBE
2007
IEEE
15 years 21 days ago
2007
IEEE
— In this paper, we propose a system for finding partial positive and negative coregulated gene clusters in microarray data. Genes are clustered together if they show the same p...