On the Number of Many-to-Many Alignments of Multiple Sequences

  title={On the Number of Many-to-Many Alignments of Multiple Sequences},
  author={Steffen Eger},
  journal={J. Autom. Lang. Comb.},
  • Steffen Eger
  • Published 2016
  • Computer Science, Mathematics
  • J. Autom. Lang. Comb.
We count the number of alignments of $N \ge 1$ sequences when match-up types are from a specified set $S\subseteq \mathbb{N}^N$. Equivalently, we count the number of nonnegative integer matrices whose rows sum to a given fixed vector and each of whose columns lie in $S$. We provide a new asymptotic formula for the case $S=\{(s_1,\ldots,s_N) \:|\: 1\le s_i\le 2\}$. 

Tables and Topics from this paper

The Combinatorics of Weighted Vector Compositions
This work investigates congruence properties of the number of weighted vector compositions, for fixed and arbitrary number of parts, many of which are analogous to those of ordinary binomial coefficients and related quantities. Expand
How Many Stemmata with Root Degree k?
It is shown in this paper that for the whole class of trees corresponding to Maasian reconstructed stemmata and likewise for the class of Trees corresponding to complete historical manuscript genealogies, root bifurcations are apriori the most expectable root degree type. Expand


On the number of alignments ofk sequences
It is shown by a combinatorial argument that for any fixedk≥1, the numberf(k, n) ofk alignments of lengthn grows like (ck)nas n → ∞, whereck = (21/k − 1)-k. Expand
Improving calculations of the number of distinct alignments of two strings*
With the generating functions in hand, improvements on Covington's recurrences are provided, making the calculation of a(m, n) and A(m), n much more efficient. Expand
The number of reduced alignments between two DNA sequences
A unified approach for a wide class of alignments between two DNA sequences has been provided and, if complemented by software development, will provide a deeper insight into the theory of sequence alignment and give rise to new comparison methods. Expand
On the Probability that Certain Compositions Have the Same Number Of Parts
We compute the asymptotic probability that two randomly selected compositions of n into parts equal to a or b have the same number of parts. In addition, we provide bijections in the case of parts ofExpand
The Number of Distinct Alignments of Two Strings
  • M. Covington
  • Mathematics, Computer Science
  • J. Quant. Linguistics
  • 2004
This paper presents formulae for the number of distinct alignments of two strings, using various critera of distinctness, which give the size of the search space for inexact string matching, DNA sequence alignment, and the first step in comparative reconstruction of ancient languages. Expand
An Exact Formula for the Number of Alignments Between Two DNA Sequences
In this short communication, an exact formula is given for the number of possible alignments using the theory of difference equations for DNA sequences. Expand
Integer compositions with part sizes not exceeding k
We study the compositions of an integer n whose part sizes do not exceed a fixed integer k. We use the methods of analytic combinatorics to obtain precise asymptotic formulas for the number of suchExpand
The Combinatorics of String Alignments: Reconsidering the Problem*
  • Steffen Eger
  • Mathematics, Computer Science
  • J. Quant. Linguistics
  • 2012
This work defines an alignment in an abstract manner as a set of pairs and then defines three properties on such sets and specifies the numbers of possibilities of aligning two strings in each case. Expand
The On-Line Encyclopedia of Integer Sequences
  • N. Sloane
  • Mathematics, Computer Science
  • Electron. J. Comb.
  • 1994
The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used. Expand
Twenty Combinatorial Examples of Asymptotics Derived from Multivariate Generating Functions
The Morse-theoretic underpinnings of some new asymptotic techniques are described, and the use of these techniques on a variety of problems of combinatorial interest is illustrated. Expand