Isoperimetric theorems in the binary sequences of finite lengths
We solve the isoperimetric problem for subsets in the set X* of binary sequences of finite length for two cases: (1) the distance counting the minimal number of insertions and deletions transforming one sequence into another; (2) the distance, where in addition also exchanges of letters are allowed. In the earlier work, the range of the competing subsets was limited to the sequences X-n of length n. (C) 1998 Elsevier Science Ltd. All rights reserved.
11
5
121-126
121-126
PERGAMON-ELSEVIER SCIENCE LTD