This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...

We study the problem of reconstructing a sparse polynomial in a basis of Chebyshev polynomials (Chebyshev basis in short) from given samples on a Chebyshev grid of [−1, 1]. A polynomial is called M -sparse in a Chebyshev basis, if it can be represented by a linear combination of M Chebyshev polynomials. For a polynomial with known and unknown Chebyshev sparsity, respectively, we present efficie...

A variety of techniques have been developed for the approximation non-periodic functions. In particular, there are based on rank-1 lattices and transformed lattices, including methods that use sampling sets consisting Chebyshev- tent-transformed nodes. We compare these with a parameterized Fourier system yields similar $$\ell _2$$ -approximation errors.

We characterize the generalized Chebyshev polynomials of the second kind (Chebyshev-II), and then we provide a closed form of the generalized Chebyshev-II polynomials using the Bernstein basis. These polynomials can be used to describe the approximation of continuous functions by Chebyshev interpolation and Chebyshev series and how to efficiently compute such approximations. We conclude the pap...

Similarity measure is a very important problem in fuzzy soft set theory. In this paper, seven similarity measures of fuzzy soft sets are introduced, which are based on the normalized Hamming distance, the normalized Euclidean distance, the generalized normalized distance, the Type-2 generalized normalized distance, the Type-2 normalized Euclidean distance, the Hausdorff distance and the Chebysh...

We study the asymptotic structure of polynomials with integer coef cients and smallest uniform norms on an interval of the real line Introducing methods of the weighted potential theory into this problem we improve the bounds for the multiplicities of some factors of the integer Chebyshev polynomials Introduction Let Pn C and Pn Z be the sets of algebraic polynomials of degree at most n respect...

We describe the development of a scoring function designed to model the hydrophobic effect in protein folding. An optimization technique is used to determine the best functional form of the hydrophobic potential. The scoring function is expanded using the Chebyshev polynomials, for which the coefficients are determined by minimizing the Z-score of native structures in the ensembles of alternate...

Keywords: Set-valued mapping Chebyshev center Uniformly convex Locally uniformly convex Chebyshev fixed point a b s t r a c t The existence of a continuous Chebyshev selection for a Hausdorff continuous set-valued mapping is studied in a Banach space with some uniform convexity. As applications, some existence results of Chebyshev fixed point for condensing set-valued mappings are given, and th...

The Orr-Sommerfeld equation is solved numerically using expansions in Chebyshevpolynomials and the QR matrix eigenvalue algorithm. It is shown that results of great accuracy are obtained very economically. The method is applied to the stability of plane Poiseuille flow; it is found that the critical Reynolds number is 5772.22. It is explained why expansions in Chebyshev polynomials are better s...