MOTIVATION The goal of motif discovery is to detect novel, unknown, and important signals from biology sequences. In most models, the importance of a motif is equal to the sum of the similarity of every single position. In 2006, Song et al. introduced Aggregated Related Column Score (ARCS) measure which includes correlation information to the evaluation of motif importance. The paper showed tha...

We consider a vibrating string that is fixed at one end with Neumann control action at the other end. We investigate the optimal control problem of steering this system from given initial data to rest, in time T , by minimizing an objective functional that is the convex sum of the L-norm of the control and of a boundary Neumann tracking term. We provide an explicit solution of this optimal cont...

Given a directed graph G V A the maximum acyclic subgraph problem is to compute a subset A of arcs of maximum size or total weight so that G V A is acyclic We discuss several approximation algorithms for this problem Our main result is an O jAj d max algorithm that produces a solution with at least a fraction p dmax of the number of arcs in an optimal solution Here dmax is the maximum vertex de...

a graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. in this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

We show that doubling, linearly connected metric spaces are quasiarc connected. This gives a new and short proof of a theorem of Tukia.