We define the locally maximal subwords and locally minimal superwords common to a finite set of words. We also define the corresponding sets of alignments. We give a partial order relation between such sets of alignments, as well as two operations between them. We show that the constructed family of sets of alignments has the lattice structure. The study of analogical proportion in lattices giv...

This paper deals with the analysis of performance of source trajectory estimation by using the measurements provided by multiple towed arrays (or platforms). In numerous practical situations, the maneuvering ability of the receiver (e.g. a ship towing linear arrays) is limited leading thus to consider that the observer motion is rectilinear and uniform. Even if this hypothesis appears quite lim...

We show how prior domain knowledge can be used in a system for mining databases of biological data. Our system performs automated discovery of diagnostic patterns from a database of protein sequences. Such patterns are used for classiication of new sequences, and identiication of biologically interesting positions in the proteins. The patterns have a simple syntax and can be translated into reg...

There are many ways to generate a set of nodes on the sphere for use in a variety of problems in numerical analysis. We present a survey of quickly generated point sets on S2, examine their equidistribution properties, separation, covering, and mesh ratio constants and present a new point set, equal area icosahedral points, with low mesh ratio. We analyze numerically the leading order asymptoti...

Assume 〈א0,א1〉 → 〈λ, λ +〉. Assume M is a model of a first order theory T of cardinality at most λ+ in a vocabulary L(T ) of cardinality ≤ λ. Let N be a model with the same vocabulary. Let ∆ be a set of first order formulas in L(T ) and let D be a regular filter on λ. Then M is ∆-embeddable into the reduced power N /D, provided that every ∆-existential formula true in M is true also in N . We ob...

in this article we study two different generalizations of von neumann regularity, namely strong topological regularity and weak regularity, in the banach algebra context. we show that both are hereditary properties and under certain assumptions, weak regularity implies strong topological regularity. then we consider strong topological regularity of certain concrete algebras. moreover we obtain ...

A sequence is said to be k-automatic if the n term of this sequence is generated by a finite state machine with n in base k as input. A result due to Cobham states that if a sequence is both kand `-automatic and k and ` are multiplicatively independent, then the sequence is eventually periodic. Allouche and Shallit defined (R, k)-regular sequences as a natural generalization of k-automatic sequ...

in this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.

Experiments involving the evolution of protein motifs using genetic programming are presented. The motifs use a stochastic regular expression language that uses codon-level probabilities within conserved sets (masks). Experiments compared basic genetic programming with Lamarckian evolution, as well as the use of “natural” probability distributions for masks obtained from the sequence database. ...

In this paper, we propose Simplified Regular Expression (SRE) signature, which uses multiple sequence alignment techniques, drawn from bioinformatics, in a novel approach to generating more accurate exploit-based signatures. We also provide formal definitions of what is ‘‘a more specific’’ and what is ‘‘the most specific’’ signature for a polymorphic worm and show that the most specific exploit...