✦ LIBER ✦

Shortest string containing all permutations

✍ Scribed by P.J. Koutas; T.C. Hu

Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 1007 KB
Volume: 11
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(75)90004-7

No coin nor oath required. For personal study only.

✦ Synopsis

Revkd t 7 M

📜 SIMILAR VOLUMES

A new bound on the length of the shortes

A new bound on the length of the shortest string containing all r-permutations

✍ Cai Mao-cheng 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 196 KB

The purpose of this note is to give a new upper bound of the shortest string containing all r-permutations. Thus we disprove the conjecture considered in Cl]. The terminology used in this note fullows [I]. Koutas and Nu [I] proposed the foIlowing problem of constructing a shortest string of (1, 2,

Short strings containing all k-element p

Short strings containing all k-element permutations

✍ Carla Savage 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Given n and k, we consider the problem of conslructing a shortest string over the, set ~. ={1,2 ..... n} which contains every permulation of each k-element subset of ~, as a scbsequence. Let g(n, k) denote the length of a shorte,;t such string. We show by construction tic, a: g(n, k) <~ k(n -2) + 4

On strings containing all subsets as sub

On strings containing all subsets as substrings

✍ Witold Lipski Jr. 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 998 KB

Let s,, be the length of a shortest sequence cf positive integers which contains every Yc(l,..., d}-as a subsequence of IY 1 consecutive terms. We give the following asymptotic estimation\* (2/7rnY22" d S . n Q (2/7r)2". TIC. upper bound is derived constructively.