Duplication Distance to the Root for Binary Sequences

DOI10.1109/TIT.2017.2730864zbMath1390.94811arXiv1611.05537MaRDI QIDQ4566608

Jehoshua Bruck, Noga Alon, Siddharth Jain, Farzad Farnoud (Hassanzadeh)

Publication date: 27 June 2018

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

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

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Measures of information, entropy (94A17)

Related Items (3)

Tandem Duplications, Segmental Duplications and Deletions, and Their Applications ⋮ Computing the Tandem Duplication Distance is NP-Hard ⋮ The tandem duplication distance problem is hard over bounded alphabets

This page was built for publication: Duplication Distance to the Root for Binary Sequences