Mathematics – Combinatorics
Scientific paper
2008-01-16
Theoretical Computer Science 410, 8-10 (2009)
Mathematics
Combinatorics
Scientific paper
10.1016/j.tcs.2008.11.017
In Soda'06, Chaudhuri, Chen, Mihaescu and Rao study algorithmic properties of the tandem duplication - random loss model of genome rearrangement, well-known in evolutionary biology. In their model, the cost of one step of duplication-loss of width k is $\alpha^k$ for $\alpha =1$ or $\alpha >=2 $. In this paper, we study a variant of this model, where the cost of one step of width $k$ is 1 if $k <= K$ and $\infty$ if $k > K$, for any value of the parameter $K in N$. We first show that permutations obtained after $p$ steps of width $K$ define classes of pattern-avoiding permutations. We also compute the numbers of duplication-loss steps of width $K$ necessary and sufficient to obtain any permutation of $S_n$, in the worst case and on average. In this second part, we may also consider the case $K=K(n)$, a function of the size $n$ of the permutation on which the duplication-loss operations are performed.
Bouvel Mathilde
Rossin Dominique
No associations
LandOfFree
A variant of the tandem duplication - random loss model of genome rearrangement does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A variant of the tandem duplication - random loss model of genome rearrangement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A variant of the tandem duplication - random loss model of genome rearrangement will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-160030