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 and sets 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
Computational protein threading is a powerful technique for recognizing native-like folds of a prote...
In this paper, we study the protein threading problem, which was proposed for finding a folded 3D pr...
Abstract. Predicting the folding of an RNA sequence, while allow-ing general pseudoknots (PK), consi...
AbstractA fold of a finite string S over a given alphabet is an embedding of S in some fixed infinit...
A fold of a finite string S over a given alphabet is an embedding of S in some fixed infinite grid, ...
We present the first proof of NP-hardness (under random-zed polynomial time reductions) for string f...
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...
Inspired by the NP-hardness of string folding problems modeling the natural process of protein foldi...
The present paper introduces a new computing paradigm based on the idea of string folding. Compariso...
Abstract. We consider the problem of protein folding in the HP model on the 3D square lattice. This ...
It should be possible to predict the fold of a protein into its native conformation, once we are giv...
AbstractIn this paper, we study the protein threading problem, which was proposed for predicting a f...
AbstractIt should be possible to predict the fold of a protein into its native conformation, once we...
This research shows optimization approaches to protein folding. The protein folding problem is to pr...
Computational protein threading is a powerful technique for recognizing native-like folds of a prote...
In this paper, we study the protein threading problem, which was proposed for finding a folded 3D pr...
Abstract. Predicting the folding of an RNA sequence, while allow-ing general pseudoknots (PK), consi...
AbstractA fold of a finite string S over a given alphabet is an embedding of S in some fixed infinit...
A fold of a finite string S over a given alphabet is an embedding of S in some fixed infinite grid, ...
We present the first proof of NP-hardness (under random-zed polynomial time reductions) for string f...
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...
Inspired by the NP-hardness of string folding problems modeling the natural process of protein foldi...
The present paper introduces a new computing paradigm based on the idea of string folding. Compariso...
Abstract. We consider the problem of protein folding in the HP model on the 3D square lattice. This ...
It should be possible to predict the fold of a protein into its native conformation, once we are giv...
AbstractIn this paper, we study the protein threading problem, which was proposed for predicting a f...
AbstractIt should be possible to predict the fold of a protein into its native conformation, once we...
This research shows optimization approaches to protein folding. The protein folding problem is to pr...
Computational protein threading is a powerful technique for recognizing native-like folds of a prote...
In this paper, we study the protein threading problem, which was proposed for finding a folded 3D pr...
Abstract. Predicting the folding of an RNA sequence, while allow-ing general pseudoknots (PK), consi...