{"id":"W1559767587","doi":"10.1007/978-3-642-04031-3_32","title":"Bayesian Optimization Algorithm for the Non-unique Oligonucleotide Probe Selection Problem","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Heuristics; Selection (genetic algorithm); Oligomer restriction; Algorithm; Bayesian optimization; Set (abstract data type); Bayesian probability; DNA microarray; Oligonucleotide; Data mining; Artificial intelligence; DNA; Biology","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003174712,0.0002374297,0.0001501743,0.000142395,0.0002353345,0.0001140336,0.0005014571,0.0002747817,0.00000949773],"category_scores_gemma":[0.00002038573,0.0001817942,0.00008063368,0.0001650846,0.0001610603,0.00001020673,0.00009678197,0.0002046879,0.000001137818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007155086,"about_ca_system_score_gemma":0.0003018263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004885457,"about_ca_topic_score_gemma":0.00002523505,"domain_scores_codex":[0.9985972,0.00001566413,0.0002329184,0.000688569,0.0002159728,0.0002496986],"domain_scores_gemma":[0.9991166,0.00002744315,0.0001794758,0.0003956285,0.0002252512,0.00005557716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001103352,0.00001324956,0.000003286751,0.00001171637,0.0000075689,3.874565e-7,0.00004460772,0.2239957,0.01105458,0.0001021531,0.0001886068,0.7645671],"study_design_scores_gemma":[0.0002679045,0.0003088289,0.00004081827,0.0001062318,0.00001544031,0.00001542632,3.165821e-7,0.9299474,0.04761036,0.005694143,0.01566693,0.0003261698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000003521383,0.0002091711,0.9971193,0.0005920285,0.0002968085,0.0008693508,0.000004703343,0.0000194533,0.0008856683],"genre_scores_gemma":[0.01423086,0.0002751316,0.9805654,0.001504224,0.001073483,0.0001105977,0.00008616829,0.0000465713,0.002107534],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7642409,"threshold_uncertainty_score":0.7413352,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008356079021076617,"score_gpt":0.2409992823675801,"score_spread":0.2326432033465035,"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."}}