MOTIVATION Translation initiation sites (TISs) of genes are the key points of protein synthesis. Exact recognition of TISs in eukaryotic genes is one of the most important tasks in gene-finding algorithms. However, the task has not been satisfactorily fulfilled up to the present. Here, we propose a cooperatively scanning model for recognizing TISs and the first exons of eukaryotic genes on the ...

Image processing algorithms can be conventionally divided into several levels. Algorithms of low level (I) image processing are typically performed as a sequence of simple operations such as a look-up-table, binarization, median filtering, convolution. logic operation and others. The middle level (II) image processing does image segmentation, object localisation, form recognizing and character ...

The k-th power H of a graph H is obtained from H by adding new edges between every two distinct vertices having distance at most k in H . Lau [Bipartite roots of graphs, ACM Transactions on Algorithms 2 (2006) 178–208] conjectured that recognizing k-th powers of some graph is NP-complete for all fixed k ≥ 2 and recognizing k-th powers of a bipartite graph is NP-complete for all fixed k ≥ 3. We ...

In this paper, we focus on the intuitionistic propositional logic extended with a local operator [22] (also called nucleus [21]); such is commonly named lax after [9]. We prove that unification finitary in and supply algorithms for computing basis of unifiers recognizing admissibility inference rules, following analogous known results logic.

Human face recognition is one of the most intensely researched areas of machine vision. Many machine vision algorithms have been adapted or developed specifically for the task of face recognition. By comparison, very little research has been done to develop systems for the recognition of other classes of objects. This paper will review a selection of the most popular face recognition algorithms...