2597 search results - page 17 / 520 » On numbers of Davenport-Schinzel sequences |
ALGORITHMICA
2006
13 years 7 months ago
2006
We show that the number of t-ary trees with path length equal to p is t h(t-1) tp log2 p(1+o(1)) , where h(x)=-x log2 x-(1-x) log2(1-x) is the binary entropy function. Besides its...
JGT
2006
13 years 7 months ago
2006
Given a configuration of pebbles on the vertices of a graph G, a pebbling move consists of taking two pebbles off some vertex v and putting one of them back on a vertex adjacent t...
APCCAS
2006
IEEE
13 years 11 months ago
2006
IEEE
This paper considers z-domain transfer functions whose denominator polynomial possesses the property that the coefficient of zi is greater than the coefficient of zi-1 . Such trans...
IJDMB
2006
13 years 7 months ago
2006
: Most motif discovery algorithms from DNA sequences require the motif's length as input. Styczynski et al. introduced the Extended (l,d)-Motif Problem (EMP) where the motif&#...
CANDC
2000
ACM
13 years 7 months ago
2000
ACM
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...