We solve the isoperimetric problem for subsets in the set X of binary
sequences of finite length for two cases: (1) the distance counting t
he minimal number of insertions and deletions transforming one sequenc
e into another; (2) the distance, where in addition also exchanges of
letters are allowed. In the earlier work, the range of the competing s
ubsets was limited to the sequences X-n of length n. (C) 1998 Elsevier
Science Ltd. All rights reserved.