{"id":"W2073512309","doi":"10.1089/cmb.2006.13.979","title":"An <i>O</i> ( <i>n</i> log <i>n</i> )-Time Algorithm for the Restriction Scaffold Assignment Problem","year":2006,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University; McGill University","funders":"","keywords":"Computer science; Algorithm; Scaffold; Combinatorics; Mathematics; Programming language","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.001635098,0.003364617,0.002594404,0.002044278,0.002306404,0.003838554,0.006713059,0.003344555,0.02595564],"category_scores_gemma":[0.005056298,0.001383739,0.002777599,0.003906664,0.001646482,0.006613642,0.004396541,0.003627582,0.008840228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003273504,"about_ca_system_score_gemma":0.005507919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007075232,"about_ca_topic_score_gemma":0.009691231,"domain_scores_codex":[0.9982486,0.0002776884,0.0001176338,0.0006641386,0.0003409739,0.0003509591],"domain_scores_gemma":[0.9965143,0.001795575,0.0003341584,0.0007759664,0.0002797385,0.0003002533],"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.001096233,0.00110112,0.002191158,0.001473129,0.0002422546,0.0002851991,0.0005042287,0.07579736,0.01639782,0.03601163,0.09004767,0.7748522],"study_design_scores_gemma":[0.001902995,0.0008130842,0.002331018,0.0001953575,0.0003091886,0.001565301,0.0008093793,0.7617485,0.01811694,0.1618585,0.05013037,0.0002193593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02068147,0.0004539002,0.9460441,0.00170138,0.0002154278,0.001087411,0.0012933,0.01347305,0.01504999],"genre_scores_gemma":[0.04914889,0.000280042,0.9398547,0.0002268964,0.0001018107,0.0008862028,0.002781188,0.0007066618,0.006013586],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02595564,"threshold_uncertainty_score":0.08683032,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01202318925585627,"score_gpt":0.2583048064252301,"score_spread":0.2462816171693739,"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."}}