We present an algorithm for finding a nearest pair of points in two convex sets of R n, and therefore, their distance. The algorithm is based on the fixed-point theory of nonexpansive operators on a Hilbert space. Its practical implementation requires a fast projection algorithm. We introduce such a
An algorithm to find distant repeats in a pair of protein sequences
โ Scribed by R. Sabarinathan; Nirjhar Banerjee; N. Balakrishnan; K. Sekar
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 220 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0167-8655
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper proposes an efficient algorithm to solve a sequence of linear algebraic equations resulting from approximating the nonlinear H ~ control law by Taylor series. A characterization of the eigenstructure of a class of matrices that define the linear equations is first given. This characteriza
The human spliceosomal Sm B/Bะ proteins are essential for the biogenesis of the snRNP particles. B/Bะ proteins contain several clusters of the PPPPGM/IR sequence, which occurs within the C-terminus of Sm B/Bะ. This sequence is very similar to the PPPPPGHR sequence of the cytoplasmic tail of the CD2