HP Benchmarks

William Hart, Sorin Istrail


2D HP Model

hphpphhphpphphhpphph
Min: -9
Ref: [1][3][5]

hhpphpphpphpphpphpphpphh
Min: -9
Ref: [1][3][5]

pphpphhpppphhpppphhpppphh
Min: -8
Ref: [1][3][5]

ppphhpphhppppphhhhhhhpphhpppphhpphpp
Min: -14
Ref: [1][3][5]

pphpphhpphhppppphhhhhhhhhhpppppphhpphhpphpphhhhh
Min: -22
Ref: [1][3][5]

hhphphphphhhhphppphppphpppphppphppphphhhhphphphphh
Min: -21
Ref: [1][3][5]

pphhhphhhhhhhhppphhhhhhhhhhphppphhhhhhhhhhhhpppphhhhhhphhphp
Min: -34
Ref: [1][3][5]

hhhhhhhhhhhhphphpphhpphhpphpphhpphhpphpphhpphhpphphphhhhhhhhhhhh
Min: -42
Ref: [1][3][5]

hhhpphphphpphphphpph
Min: -10
Ref: [5]
Conf: rddluluururdrdrddlu

phhhphhhppphphhphhpphphhhhphpphhhhhphphhpphhp
Ref: [5][6]

hphhhphhhpphhphphhphhhphphphhpphhhpphphpppphpphpphhpphpph
Ref: [5][6]

phhppppphhpphhphpphppppppphppphhphhpppppphpphphpphppppphhhpppphhphhppppphhpppphhhhphpppppppphhhhhpphpp
Ref: [5][7]

pphhhphpppphppppphhpppphhpphhpppphpppphpphpphhppphhphphhhpppphhhpppppphhpphpphphpphppppppphpphhhpppphppphhhhhpppphhphphphph
Ref: [5][7]

hppppphpppphphhphhpppphphhhpppphphphhhhppppppppppphpphppphphhppphhpphpphphphpppppppphppphhhhhhppphhpphhhppphhphhhhhppppppppphpppphphpppp
Ref: [5][7]

3D HP Model

hphhpphhhhphhhpphhpphphhhphphhpphhppphpppppppphh
Min: -32
Ref: [3][4]
Conf: rffrbulbuldfffrbuflbbrrfrbblddrufdfulfurddlllbb

hhhhphhphhhhhpphpphhpphpppppphpphppphpphhpphhhph
Min: -34
Ref: [3][4]
Conf: rfflbufrbrdbrffflbuulblffddruurdrubdbulbrdlluld

phphhphhhhhhpphphpphphhphphppphpphhpphhpphphpphp
Min: -34
Ref: [3][4]
Conf: rfubuffrbdfdruubbufflllddrdlbubufubrfrbddrfdblf

phphhpphphhhpphhphhppphhhhhpphphhphphpppphpphphp
Min: -33
Ref: [3][4]
Conf: rrfllufdruufrbbbdllurfdrfdfrbubdbuufffdlldluubb

pphppphphhhhpphhhhphhphhhpphphphpphpppppphhphhph
Min: -32
Ref: [3][4]
Conf: rflfubbrfffldrbruulbrddrbluullfffrrrbbbdfffldrb

hhhppphhphphhphhphhphppppppphphpphppphpphhhhhhph
Min: -32
Ref: [3][4]
Conf: rffrbuuulfdbbdluffubbrrrffldrbblddrufdfullblfdb

phpppphphhhphphhhhphhphhppphphppphhhpphhpphhppph
Min: -32
Ref: [3][4]
Conf: rrrfuldluulfurddldbubrulufrbrrddlufrulfrdldrdll

phhphhhphhhhpphhhpppppphphhpphhphppphhphphphhppp
Min: -31
Ref: [3][4]
Conf: rrrfluufdrdfullblbbuffrbddlfrrflluurrrbbdbllurr

phphpppphphphpphphhhhhhpphhhphpphphhpphphhhpppph
Min: -34
Ref: [3][4]
Conf: rrffruuldlluubrfdbrdbrdfuubufflbbdlulddrfdflbuu

phhpppppphhppphhhphpphphhpphpphpphhpphhhhhhhpphh
Min: -33
Ref: [3][4]
Conf: rflfuuubrbldfrrbrffubblffldrdldrbrfubbdlufllbru

hpppphhhhpphphphhhphpphhpph
Ref: [2]
Conf: rfddbullfubbrrdlldffrbbbrf

hppphhhhphphhppphphhphppphp
Ref: [2]
Conf: rfdlulddbrulbldffubufurbdb

hphhpphhpphhhhppphppphhhpph
Ref: [2]
Conf: rfllfrrdruubdbullurfdflubd

hhphhphhphhhhhhpphhhhhpphhhhhhh
Ref: [2]
Conf: rfldrbdflbuburrdldllulurffdbdf

phpphpphpphpphpphpphpphpphpphpphp
Ref: [2]
Conf: rfdbdbubufurdbdfdfufuburdfdbdbubufu

010101110010100000000000110
Ref: [8][9]

011000000000011001100100101
Ref: [8][9]

111100000100000111000000001
Ref: [8][9]

111001111000101001100100011
Ref: [8][9]

111100001011000110000000000
Ref: [8][9]
 
100000010111001100010000101
Ref: [8][9]

100101100010000010110101011
Ref: [8][9]

100000000000101000000001011
Ref: [8][9]

000000011100010110001001000
Ref: [8][9]

000001101010101001101101000
Ref: [8][9]

0011111000110000011000100000010100010010010000010000110110010010
Ref: [8][9]

0010100100111011110011100001010001010001010000010100101000100100
Ref: [8][9]

1011001101000001110111100100101100010100111011010000011111111000
Ref: [8][9]

1001100100101001000010000001010111001010001010011001001001011101
Ref: [8][9]

1000110010100010001011000110101101001000100101110010010011101111
Ref: [8][9]
 
1001101111000000110010000110001001011010000110000100000100001011
Ref: [8][9]

0000100010001111011000001001011010100000100000000001111000011001
Ref: [8][9]

0001110010100100110001001001101000100000001011101111100110001001
Ref: [8][9]

1001001110000101000101101111100001010100001010001101000010011010
Ref: [8][9]

0010010011100010100100100000010011100100100101000000111000001010
Ref: [8][9]

References

[1] R. Unger and J. Moult.  Genetic algorithms for protein folding simulations.
J. Mol. Biol. (1993) V. 231. pp. 75-81.

[2] K. Yue and K. Dill.  Sequence-structure relationships in proteins and
copolymers.  Physical Review E.  V 48.  N 3. pp. 2267-2278. 1993.

[3] T. Beutler and K. Dill.  Hydophobic core biased Monte Carlo search:  A fast
search strategy for finding low energy structures of model proteins.  1996.

[4] K. Yue, K. Fiebig, P. Thomas, H.S. Chan, E. Shakhnovich and K. Dill.
A test of lattice protein folding algorithms.  Proc. Natl. Acad. Sci.
V 91.  1994.  Chemistry.

[5] L. Toma and S. Toma.  Contact interactions method:  A new algorithm for 
protein folding simulations.  Protein Science.  V 5.  pp 147-153.  1996.

[6] K. Dill, K. Fiebig and H.S. Chan.  Cooperativity in protein-folding
kinetics.  Proc Natl Acad Sci.  V 90.  pp 1942-1946.  1993.

[7] E. lattman, K. Fiebig and K. Dill.  Modeling compact denatured state4s of
proteins.  Biochemistry.  V 33 pp 6158-6166. 1994.

[8] R. Unger and J. Moult.  A genetic algorithm for 3D protein folding simulations.
Proc Intl Conf on Genetic Algorithms.  pp 581-588.  1993.

[9] A. Patton, W. Punch and E. Goodman.  A standard GA approach to native
protein conformation prediction.  Proc Incl Conf on Genetic Algorithms.  pp 574-581.
1995.

Bill's Home Page

This page maintained by wehart@cs.sandia.gov
Last modified: Who Cares