The Capacity of String-Duplication Systems

DOI10.1109/TIT.2015.2505735zbMath1359.94317arXiv1401.4634WikidataQ59902755 ScholiaQ59902755MaRDI QIDQ2977005

Jehoshua Bruck, Moshe Schwartz, Farzad Farnoud (Hassanzadeh)

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.4634

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Related Items (6)

Tandem Duplications, Segmental Duplications and Deletions, and Their Applications ⋮ On the maximum number of non-confusable strings evolving under short tandem duplications ⋮ Deciding the Confusability of Words under Tandem Repeats in Linear Time ⋮ Bound-decreasing duplication system ⋮ Computing the Tandem Duplication Distance is NP-Hard ⋮ The tandem duplication distance problem is hard over bounded alphabets

This page was built for publication: The Capacity of String-Duplication Systems