{"id":"W2019165514","doi":"10.1155/2013/793130","title":"Efficient Serial and Parallel Algorithms for Selection of Unique Oligos in EST Databases","year":2013,"lang":"en","type":"article","venue":"Advances in Bioinformatics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Algorithm; Brute force; Oligonucleotide; Selection (genetic algorithm); Data mining; Database; Artificial intelligence; Gene; 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.0001743163,0.00009437081,0.0001526665,0.0001264098,0.00003728346,0.00003787372,0.000239817,0.00003310553,0.000002783393],"category_scores_gemma":[0.00004537785,0.00007803891,0.00001429397,0.000253986,0.00004057675,0.001288445,0.0001771985,0.00006532331,0.000002336817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002170215,"about_ca_system_score_gemma":0.00003098416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000898208,"about_ca_topic_score_gemma":0.00005068042,"domain_scores_codex":[0.9991885,0.00001466685,0.0003743929,0.0001244937,0.0001174887,0.000180414],"domain_scores_gemma":[0.9994552,0.0001192193,0.0001358129,0.0001990726,0.00005391139,0.00003682817],"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.00005018595,0.0003196668,0.004002777,0.0006418853,0.000008731551,0.000001917572,0.002680612,0.10767,0.0003325583,0.04623007,0.0003201897,0.8377414],"study_design_scores_gemma":[0.0005441019,0.00007962128,0.001004588,0.00007405803,0.000001002667,0.000006312866,0.0001037199,0.9948739,0.0005523118,0.001097862,0.001556886,0.0001056774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03171324,0.0002453332,0.967188,0.00003238863,0.0001825069,0.0004616829,0.00002323244,0.00002440074,0.0001291845],"genre_scores_gemma":[0.03949535,0.0003470595,0.9599969,0.00003779262,0.00002291209,0.00006475348,0.00002392039,0.000003818845,0.000007460162],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8872038,"threshold_uncertainty_score":0.3182334,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01524569386304734,"score_gpt":0.2806853424212582,"score_spread":0.2654396485582108,"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."}}