{"id":"W2118651376","doi":"10.1093/bioinformatics/bth240","title":"A practical and robust sequence search strategy for structural genomics target selection","year":2004,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Medical Research Council","keywords":"Prioritization; Genome; Selection (genetic algorithm); Computer science; Sequence (biology); Structural genomics; Computational biology; Genomics; Software; Sequence alignment; Similarity (geometry); Data mining; Gene; Biology; Genetics; Artificial intelligence; Protein structure; Peptide sequence; Image (mathematics)","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.002895835,0.001224778,0.001155441,0.001435732,0.000630493,0.001051797,0.001602962,0.001179695,0.005971606],"category_scores_gemma":[0.006867078,0.0005836964,0.000879013,0.001498274,0.0006856887,0.00123186,0.001205835,0.001595392,0.004310105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005318992,"about_ca_system_score_gemma":0.0009917425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007184604,"about_ca_topic_score_gemma":0.0009895831,"domain_scores_codex":[0.9980019,0.0006024106,0.0001112101,0.00040736,0.0007774954,0.00009967661],"domain_scores_gemma":[0.9977717,0.0009365337,0.0001976008,0.0003735958,0.0006125805,0.000107989],"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.0008947078,0.0004263396,0.002104715,0.0005679196,0.0001708883,0.0005226497,0.0001997817,0.05272183,0.4517286,0.01537816,0.01051696,0.4647675],"study_design_scores_gemma":[0.0002828737,0.001131248,0.002222361,0.00005734515,0.0001348271,0.001993963,0.0001446114,0.7484335,0.198118,0.02670493,0.0206382,0.0001381693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009728422,0.0001118998,0.9850348,0.000107728,0.00002114818,0.0001785059,0.0002189529,0.003838997,0.0007594439],"genre_scores_gemma":[0.06001727,0.0001149,0.9364727,0.0001385506,0.0000208315,0.0003075681,0.001325462,0.0004738352,0.001128903],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005971606,"threshold_uncertainty_score":0.01997703,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05115024136537426,"score_gpt":0.3116933702072902,"score_spread":0.2605431288419159,"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."}}