Add to ORKGA fold of a finite string S over a given alphabet is an embedding of S in some fixed infinite grid, such as the square or cubic mesh. The score of a fold is the number of pairs of matching string symbols which are embedded at adjacent grid vertices. Folds of strings in two- and three-dimensional meshes are considered, and the corresponding problems of optimizing the score or achieving a given target score are shown to be NP-hard
The problem of minimizing the trellis complexity of a code by coordinate permutation is studied. Thr...
We consider a problem defined on strings and inspired by the way DNA encodes amino-acids as triplets...
We show how to fold a piece of paper and punch one hole so as to produce any desired pattern of hole...
A fold of a finite string S over a given alphabet is an embedding of S in some fixed infinite grid, ...
AbstractA fold of a finite string S over a given alphabet is an embedding of S in some fixed infinit...
How do we most quickly fold a paper strip (modeled as a line) to obtain a desired mountain-valley pa...
How do we most quickly fold a paper strip (modeled as a line) to obtain a desired mountain-valley pa...
We present the first proof of NP-hardness (under random-zed polynomial time reductions) for string f...
The present paper introduces a new computing paradigm based on the idea of string folding. Compariso...
Inspired by the NP-hardness of string folding problems modeling the natural process of protein foldi...
Abstract. We consider the problem of protein folding in the HP model on the 3D square lattice. This ...
AbstractWe explore the following problem: given a collection of creases on a piece of paper, each as...
Abstract For a given mountain-valley pattern of equidistant creases on a long strip paper, there are...
Abstract. Given a string w over a finite alphabet Σ and an integer K, can w be partitioned into stri...
In this paper, we show that the rigid-foldability of a given crease pattern using all creases is wea...
The problem of minimizing the trellis complexity of a code by coordinate permutation is studied. Thr...
We consider a problem defined on strings and inspired by the way DNA encodes amino-acids as triplets...
We show how to fold a piece of paper and punch one hole so as to produce any desired pattern of hole...
A fold of a finite string S over a given alphabet is an embedding of S in some fixed infinite grid, ...
AbstractA fold of a finite string S over a given alphabet is an embedding of S in some fixed infinit...
How do we most quickly fold a paper strip (modeled as a line) to obtain a desired mountain-valley pa...
How do we most quickly fold a paper strip (modeled as a line) to obtain a desired mountain-valley pa...
We present the first proof of NP-hardness (under random-zed polynomial time reductions) for string f...
The present paper introduces a new computing paradigm based on the idea of string folding. Compariso...
Inspired by the NP-hardness of string folding problems modeling the natural process of protein foldi...
Abstract. We consider the problem of protein folding in the HP model on the 3D square lattice. This ...
AbstractWe explore the following problem: given a collection of creases on a piece of paper, each as...
Abstract For a given mountain-valley pattern of equidistant creases on a long strip paper, there are...
Abstract. Given a string w over a finite alphabet Σ and an integer K, can w be partitioned into stri...
In this paper, we show that the rigid-foldability of a given crease pattern using all creases is wea...
The problem of minimizing the trellis complexity of a code by coordinate permutation is studied. Thr...
We consider a problem defined on strings and inspired by the way DNA encodes amino-acids as triplets...
We show how to fold a piece of paper and punch one hole so as to produce any desired pattern of hole...