简介:Abranchandboundalgorithmisproposedforthetwo-dimensionalproteinfoldingproblemintheHPlatticemodel.Inthisalgorithm,thebenefitofeachpossiblelocationofhydrophobicmonomersisevaluatedandonlypromisingnodesarekeptforfurtherbranchingateachlevel.Theproposedalgorithmiscomparedwithotherwell-knownmethodsfor10benchmarksequenceswithlengthsrangingfrom20to100monomers.Theresultsindicatethatourmethodisaveryefficientandpromisingtoolfortheproteinfoldingproblem.