Experimental and Efficient Algorithms

DOI10.1007/B136461MaRDI QIDQ5710053zbMATH OpenOpenAlexFDO

Authors Anna Gambin, Damian Wójtowicz

Publication date 30 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136461

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Biochemistry, molecular biology (92C40)

Recommendations

• Mathematical Foundations of Computer Science 2004
• Protein folding in the HP model on grid lattices with diagonals
• Protein Folding in 2D-Triangular Lattice Revisited
• Approximate protein folding in the HP side chain model on extended cubic lattices
• scientific article; zbMATH DE number 1405793

Cited in

(6)

• Protein Folding in 2D-Triangular Lattice Revisited
• Constrained walks and self-avoiding walks: implications for protein structure determination
• scientific article; zbMATH DE number 7380538 (Why is no real title available?)
• A path planning-based study of protein folding with a case study of hairpin formation in protein G and L
• The HP model of protein folding: a challenging testing ground for Wang-Landau sampling
• Protein folding in the HP model on grid lattices with diagonals

This page was built for publication: Experimental and Efficient Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710053)