{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002409455,0.001797794,0.001343929,0.003128727,0.001286358,0.001490883,0.002411097,0.001034695,0.003898865],"category_scores_gemma":[0.006765543,0.0007685617,0.001127586,0.004809015,0.001013444,0.002541493,0.001928591,0.001537501,0.002991168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001137891,"about_ca_system_score_gemma":0.002061943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003566199,"about_ca_topic_score_gemma":0.005678972,"domain_scores_codex":[0.9981864,0.000285243,0.0002480743,0.0003932586,0.0007176421,0.0001692918],"domain_scores_gemma":[0.9971251,0.001373013,0.0002473872,0.0005571906,0.0006199247,0.00007741112],"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.0004771997,0.000254846,0.001856004,0.0002309383,0.00007410094,0.0002033293,0.0002007807,0.0929286,0.02440762,0.0166248,0.01010685,0.8526348],"study_design_scores_gemma":[0.0002828976,0.0001584032,0.001117583,0.00003371249,0.0000711223,0.0005207661,0.0001407385,0.9032866,0.03629176,0.04615076,0.01188892,0.00005669406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01038478,0.0003205977,0.9846091,0.000110073,0.0000471864,0.0001695007,0.0001808122,0.003264992,0.0009130075],"genre_scores_gemma":[0.02730677,0.0002160192,0.9688639,0.00007819787,0.00003992068,0.0003821172,0.0007842241,0.0002067911,0.002122015],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003898865,"threshold_uncertainty_score":0.01304299,"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."}}