{"id":"W2571234278","doi":"10.48550/arxiv.1701.00673","title":"Inverse Protein Folding Problem via Quadratic Programming","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Optech (Canada)","funders":"","keywords":"Quadratic programming; Protein folding; Protein structure prediction; Inverse problem; Inverse; Sequential quadratic programming; Relaxation (psychology); Minification; Energy minimization; Folding (DSP implementation); Chain (unit); Mathematical optimization; Mathematics; Quadratic equation; Protein tertiary structure; Protein structure; Computer science; Chemistry; Computational chemistry; Physics; Geometry; Mathematical analysis; Engineering; Biochemistry","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001809263,0.0008757038,0.00127807,0.0004514442,0.0004896349,0.0009645518,0.0008906314,0.001288697,0.002559541],"category_scores_gemma":[0.003523899,0.0005126025,0.0009443964,0.0005226536,0.001272824,0.001166628,0.00139988,0.002027689,0.000517787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007716663,"about_ca_system_score_gemma":0.0009995912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002066048,"about_ca_topic_score_gemma":0.0008635293,"domain_scores_codex":[0.9992158,0.0003718096,0.00002150901,0.0001559505,0.0001846125,0.00005022819],"domain_scores_gemma":[0.9987441,0.0008895953,0.00006867233,0.00008996178,0.0001596159,0.00004797284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008094819,0.00005875127,0.0002358583,0.000176975,0.00003932205,0.00008516492,0.00009471324,0.9062943,0.00217198,0.0534973,0.002430125,0.03483457],"study_design_scores_gemma":[0.00001120991,0.00002687882,0.0000466111,0.000006307555,0.000004085051,0.00002784489,0.000008308387,0.9767644,0.0004329637,0.02155673,0.001109625,0.000005025638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006727953,0.0002697052,0.9897085,0.0004257492,0.000036031,0.0000238261,0.00003650898,0.0001004279,0.002671307],"genre_scores_gemma":[0.3349863,0.0008106641,0.6504586,0.0003312406,0.0001850307,0.0003494209,0.0004370861,0.0003932702,0.0120484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002559541,"threshold_uncertainty_score":0.009568453,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03237627196701037,"score_gpt":0.1941684397047217,"score_spread":0.1617921677377114,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}