This paper introduces a new problem of inferring strings from graphs, and inferring strings from arrays. Given a graph G or an array A, we infer a string that suits the graph, or the array, under some condition. Firstly, we solve the problem of finding a string w such that the directed acyclic subsequence graph (DASG) of w is isomorphic to a given graph G. Secondly, we consider directed acyclic...

February 28, 2012 Type Package Title Detection of differentially expressed segments in tiling array data Version 0.2.0 Date 2011-04-08 Author Christian Otto, Kristin Reiche, Joerg Hackermueller Depends R (>= 2.1.0) Imports multtest, affxparser, intervals, genomeIntervals, utils, Biobase, limma Suggests Starr Maintainer Christian Otto Description This package co...

such that Ijy^j (j=l(l)n) and the latter asks for the number of permutations for which there are a fixed number of j such that lj<lj+i. Two notational conventions will prove useful in what follows. First, it shall be convenient to write the permutation (1.1) as the one line array (h, k, ■ • • , ln) and, secondly, when enumerating permutations by number of rises, we shall attach an initial rise....

Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each symbol occurs the same number of times in each codeword. The problem is to find a set of codewords such that any pair of codewords are a given uniform Hamming distance apart. The equidistant case is of special interes...

In partitioning problems we are asked to divide a set of elements into groups such that some properties are satisfied. Local search algorithms solve these problems representing a candidate solution by an array that maps each element to one of the groups. Yet the name of the group is not a relevant information and a simple permutation of the labels of the groups yields an equivalent solution. In...

The handling of the sparse matrix vector product(SMVP) is a common kernel in many scientific applications. This kernel is an irregular problem, which has led to the development of several compressed storage formats such as CRS, CCS, and JDS among others. We propose an alternative storage format, the Transpose Jagged Diagonal Storage(TJDS), which is inspired from the Jagged Diagonal Storage form...

Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each symbol occurs the same number of times in each codeword. The problem is to find a set of codewords such that any pair of codewords are a given uniform Hamming distance apart. The equidistant case is of special interes...

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...