Improving calculations of the number of distinct alignments of two strings

In a recent work, M. Covington discusses the enumeration of two different sets of alignments of two strings of symbols using elementary combinatorial techniques. He defines two functions a(m, n) and A(m, n) to count the number of two

• Type: Journal
• Year: 2006
• Where: JQL
• Authors: Øystein J. Rødseth, James A. Sellers
• Keywords: Combinatorial, Elementary Combinatorial Techniques, Enumeration, JQL 2006