A. Nayak, A. Sinclair, U. Zwick. Spatial codes and the hardness of string folding problems. J. Comput. Biol. 6(1):13--36, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Spatial Codes and the Hardness of String Folding Problems - Ashwin Nayak Alistair (1998) (1 citation) Self-citation (Nayak Sinclair Zwick) (Correct)
No context found.
A. Nayak, A. Sinclair and U. Zwick. Spatial codes and the hardness of string folding problems. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 639--648. 26
Spatial Codes and the Hardness of String Folding Problems .. - Nayak, Sinclair, Zwick (1998) (1 citation) Self-citation (Nayak Sinclair Zwick) (Correct)
....Sections 3.2 and 3.3 fill in the details required to complete the description. We conclude in Section 4 by discussing the limitations and possible extensions of our approach and some directions for future work. Owing to space limitations, most of the proof details are deferred to the full paper [13]. 2 Folding a set of strings 2.1 A simple reduction In this section we describe a very simple reduction from Max Cut to Max Fold1 . The reduction is similar to a reduction from Not all equal 3Sat to Fold1 given by Paterson and Przytycka [17] The input to the Max Cut problem is an undirected ....
....two copies of symbol e j can bond iff their strings start at lattice points of opposite parity. By associating the two sides of a cut in G with the two possible parities of the starting points of the strings in an embedding of SG (refer to Figure 2(a) the details can be found in the full paper [13]) it is easy to see that: Lemma 2.1 The graph G has a cut of size at least k iff there is an embedding of SG with a score of k. As an immediate consequence we get: Theorem 2.2 (i) Fold1 is NP hard ; ii) Max Fold1 is MAX SNP hard. 2.2 From the infinite to the finite The reduction given in ....
[Article contains additional citation context not shown here]
A. Nayak, A. Sinclair and U. Zwick. Spatial codes and the hardness of string folding problems. Full version, submitted to J. Comp. Biol., July 1997.
Spatial Codes and the Hardness of String Folding Problems - Nayak, Sinclair, Zwick (1998) (1 citation) Self-citation (Nayak Sinclair Zwick) (Correct)
....codes in which different codewords are required to have large distance from one another even when they are arbitrarily embedded in three dimensional space. A preliminary version of this paper appeared in the Proceedings of the 9th ACM SIAM Symposium on Discrete Algorithms, January 1998 [15]. y Computer Science Division, UC Berkeley. Email: ashwin cs.berkeley.edu. Supported by NSF grant CCR 9505448. z Computer Science Division, UC Berkeley. Email: sinclair cs.berkeley.edu. Supported by NSF grant CCR 9505448 and by the International Computer Science Institute. x Computer Science ....
A. Nayak, A. Sinclair and U. Zwick. Spatial codes and the hardness of string folding problems. Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 639--648.
Run-time Estimates for Protein Folding Simulation - In The Model (Correct)
No context found.
A. Nayak, A. Sinclair, U. Zwick. Spatial codes and the hardness of string folding problems. J. Comput. Biol. 6(1):13--36, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC