Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.17499 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917677025460224 |
|---|---|
| author | Wang, Hsin-Po Chin, Chi-Wei |
| author_facet | Wang, Hsin-Po Chin, Chi-Wei |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_17499 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On Counting Subsequences and Higher-Order Fibonacci Numbers Wang, Hsin-Po Chin, Chi-Wei Information Theory 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. |
| title | On Counting Subsequences and Higher-Order Fibonacci Numbers |
| topic | Information Theory |
| url | https://arxiv.org/abs/2405.17499 |