Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1808.06062 (cs)
[Submitted on 18 Aug 2018]

Title:The Capacity of Some Pólya String Models

Authors:Ohad Elishco, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck
View PDF
Abstract:We study random string-duplication systems, which we call Pólya string models. These are motivated by DNA storage in living organisms, and certain random mutation processes that affect their genome. Unlike previous works that study the combinatorial capacity of string-duplication systems, or various string statistics, this work provides exact capacity or bounds on it, for several probabilistic models. In particular, we study the capacity of noisy string-duplication systems, including the tandem-duplication, end-duplication, and interspersed-duplication systems. Interesting connections are drawn between some systems and the signature of random permutations, as well as to the beta distribution common in population genetics.
Subjects: Information Theory (cs.IT); Combinatorics (math.CO)
Cite as: arXiv:1808.06062 [cs.IT]
  (or arXiv:1808.06062v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1808.06062

Submission history

From: Moshe Schwartz [view email]
[v1] Sat, 18 Aug 2018 09:08:21 UTC (233 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2018-08
Change to browse by:
cs
math
math.CO
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Ohad Elishco
Farzad Farnoud
Moshe Schwartz
Jehoshua Bruck
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)