Results 221 to 230 of about 494,508 (266)

Modtector: ultra-fast modification signal mining on mapped sequencing reads. [PDF]

Bioinformatics
Zhou T, Hong Y, Li P, Liu X, Zhang J, Wang X, Li A, Sun L.   +7 more
europepmc   +1 more source

Counting With Rational Generating Functions

Journal of Symbolic Computation, 2008
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input variables of the (quasi-polynomial) function are fixed, there is a polynomial time algorithm which converts between the ...
Sven Verdoolaege, Kevin Woods
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

On learning counting functions with queries

Proceedings of the seventh annual conference on Computational learning theory - COLT '94, 1994
We investigate the problem of learning disjunctions of counting functions, generalizations of parity and modulo functions, with equivalence and membership queries. We prove that, for any prime number p, the class of disjunctions of integer-weighted counting functions with modulus p over the domain Znq (or Zn) for any given integer q≥2, is polynomial ...
Homer, Steven, Chen, Zhixiang
openaire   +1 more source

A SURVEY OF FACTORIZATION COUNTING FUNCTIONS

International Journal of Number Theory, 2005
The general field of additive number theory considers questions concerning representations of a given positive integer n as a sum of other integers. In particular, partitions treat the sums as unordered combinatorial objects, and compositions treat the sums as ordered. Sometimes the sums are restricted, so that, for example, the summands are distinct,
Knopfmacher, A., Mays, M. E.
openaire   +1 more source