Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Duplication with transposition distance to the root for qq-ary strings

Published 17 Jan 2020 in cs.IT and math.IT | (2001.06242v1)

Abstract: We study the duplication with transposition distance between strings of length nn over a qq-ary alphabet and their roots. In other words, we investigate the number of duplication operations of the form x=(abcd)→y=(abcbd)x = (abcd) \to y = (abcbd), where xx and yy are strings and aa, bb, cc and dd are their substrings, needed to get a qq-ary string of length nn starting from the set of strings without duplications. For exact duplication, we prove that the maximal distance between a string of length at most nn and its root has the asymptotic order n/log⁡nn/\log n. For approximate duplication, where a β\beta-fraction of symbols may be duplicated incorrectly, we show that the maximal distance has a sharp transition from the order n/log⁡nn/\log n to log⁡n\log n at β=(q−1)/q\beta=(q-1)/q. The motivation for this problem comes from genomics, where such duplications represent a special kind of mutation and the distance between a given biological sequence and its root is the smallest number of transposition mutations required to generate the sequence.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.