We study the generating functions for pattern-restricted k-ary words of length n corresponding to the longest alternating subsequence statistic in which the pattern is any one of the six permutations of length three.

This paper presents an algorithm for computing Longest Common Subsequences for two sequences. Given two strings X and Y of length m and n, we present a greedy algorithm, which requires O(n log s) preprocessing time, where s is distinct symbols appearing in string Y and O(m) time to determines Longest Common Subsequences.

We provide conditions on the minimum degree, the girth and the length of a longest path for a digraph to have the following property: Every longest path intersects every maximal independent set. Digraphs with this property satisfy, in a strong sense, the Laborde-PayanXuong conjecture (see [10]).

We present exact and analytically accurate results for the problem of a flexible polymer chain in shear flow. Under such a flow the polymer tumbles, and the probability distribution of the tumbling times tau of the polymer decays exponentially as approximately exp(-alphatau/tau_{0}) (where tau_{0} is the longest relaxation time). We show that for a Rouse chain this nontrivial constant alpha can...

A word is called unbordered, if it has no proper prefix which is also a suffix of that word. Let μ(w) denote the length of the longest unbordered factor of a word w. Let a word where the longest unbordered prefix is equal to μ(w) be called Duval extension. A Duval extension is called trivial, if its longest unbordered factor is of the length of the period of that Duval extension. In 1982 it was...

st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the past to compute an st-orientation of a biconnected graph. In this paper, we present new algorithms that compute such orientations with certain (parameterized) characteristics in the final st-oriented graph, such as the l...