Introduction Researchers who work with large sequential datasets are often limited in the kinds of analytic strategies they can use because of the sheer size of the data. Automated techniques for analyzing sequences were developed in the 1960s by scientists studying DNA, RNA, and proteins. In a classic volume on sequence analysis, Sankoff and Kruskal (1983) demonstrated its potential applicatio...

IASSIST Quarterly Introduction Researchers who work with large sequential datasets are often limited in the kinds of analytic strategies they can use because of the sheer size of the data. Automated techniques for analyzing sequences were developed in the 1960s by scientists studying DNA, RNA, and proteins. In a classic volume on sequence analysis, Sankoff and Kruskal (1983) demonstrated its po...

Imposing constraints is an effective means to incorporate biological knowledge into alignment procedures. As in the PROSITE database, functional sites of proteins can be effectively described as regular expressions. In an alignment of protein sequences it is natural to expect that functional motifs should be aligned together. Due to this motivation, Arslan introduced the regular expression cons...

let $r$ be an associative ring with identity. an element $x in r$ is called $mathbb{z}g$-regular (resp. strongly $mathbb{z}g$-regular) if there exist $g in g$, $n in mathbb{z}$ and $r in r$ such that $x^{ng}=x^{ng}rx^{ng}$ (resp. $x^{ng}=x^{(n+1)g}$). a ring $r$ is called $mathbb{z}g$-regular (resp. strongly $mathbb{z}g$-regular) if every element of $r$ is $mathbb{z}g$-regular (resp. strongly $...

Message Sequence Charts (MSCs) are drawn by software designers in order to model the typical behaviors of some communication protocol at an early stage of its design. The important question of whether some given set of scenarios is realizable by some message passing system has already been investigated in different ways. We consider here deadlock-free implementations up to additional message co...

Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication software. A standard method to describe multiple communication scenarios is to use message sequence graphs (MSGs). A message sequence graph allows the protocol designer to write a finite specification which combines MSCs...

A number of bioinformatics tools use regular expression (RE) matching to locate protein or DNA sequence motifs that have been discovered by researchers in the laboratory. For example, patterns representing nuclear localisation signals (NLSs) are used to predict nuclear localisation. NLSs are not yet well understood, and so the set of currently known NLSs may be incomplete. Here we use genetic p...

Let K be a finite field and let X be the set of doubly infinite sequences over K, that is, X = K where Z denotes the set of integers. In this paper I shall study some problems about mappings from X to itself which are related to earlier results in topological dynamics and cryptography. The second section includes a characterization of some algebra homomorphisms in terms of ultrafilters. Element...

Let it(G) be the number of independent sets of size t in a graph G. Alavi, Erdős, Malde and Schwenk made the conjecture that if G is a tree then the independent set sequence {it(G)}t≥0 of G is unimodal; Levit and Mandrescu further conjectured that this should hold for all bipartite G. We consider the independent set sequence of finite regular bipartite graphs, and graphs obtained from these by ...