Pages that link to "Item:Q1319879"
From MaRDI portal
The following pages link to Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications (Q1319879):
Displayed 12 items.
- A review of Monte Carlo simulations of polymers with PERM (Q644917) (← links)
- A filter-and-fan approach to the 2D HP model of the protein folding problem (Q646723) (← links)
- Computational complexity of the landscape. I. (Q877685) (← links)
- An integer programming model for protein structure prediction using the 3D-HP side chain model (Q897607) (← links)
- Complexity of protein folding (Q1319880) (← links)
- A quadratic approximation for protein sequence to structure mapping. (Q1432811) (← links)
- The algorithmics of folding proteins on lattices. (Q1868718) (← links)
- Approximate protein folding in the HP side chain model on extended cubic lattices (Q1868719) (← links)
- Long proteins with unique optimal foldings in the H-P model (Q1873159) (← links)
- Memetic algorithms: The polynomial local search complexity theory perspective (Q2481603) (← links)
- Search optimization, funnel topography, and dynamical criticality on the string landscape (Q5066985) (← links)
- On the complexity of string folding (Q5961626) (← links)