关于子序列计数与高阶斐波那契数
On Counting Subsequences and Higher-Order Fibonacci Numbers
AI总结:
本文研究基于阵列的DNA合成中,具有长度不超过t的公共超序列的n条DNA链无序集合的数量,通过子序列计数与四阶斐波那契数的联系进行分析。
摘要:
在基于阵列的DNA合成中,多条DNA链被并行合成,以将时间成本从它们的长度之和减少到它们的最短公共超序列的长度。为了在有限时间内最大化可以合成到DNA中的信息量,我们研究了具有长度至多为$t$的公共超序列的$n$条DNA链的无序集合的数量。我们的分析源于以下联系:序列A C G T A C G T A C G T ...的子序列数量是四阶斐波那契数的部分和(前缀和)。
英文摘要:
In array-based DNA synthesis, multiple strands of DNA are synthesized in parallel to reduce the time cost from the sum of their lengths to the length their shortest common supersequences. To maximize the amount of information that can be synthesized into DNA within a finite amount of time, we study the number of unordered sets of $n$ strands of DNA that have a common supersequence whose length is at most $t$. Our analysis stems from the following connection: The number of subsequences of A C G T A C G T A C G T ... is the partial sum (prefix sum) of the fourth-order Fibonacci numbers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。