{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008893378,0.0001522123,0.0002409739,0.0001672162,0.0003106405,0.0001342961,0.0009437801,0.00008482047,0.000007555665],"category_scores_gemma":[0.00001309127,0.0001047324,0.0001941149,0.0003435379,0.000125431,0.0003988985,0.00007432458,0.000174171,0.000007540254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005621268,"about_ca_system_score_gemma":0.0001677798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001714803,"about_ca_topic_score_gemma":0.000001597321,"domain_scores_codex":[0.998428,0.0001625644,0.0006200317,0.0002307913,0.0003012991,0.0002573499],"domain_scores_gemma":[0.9977674,0.0009460967,0.0005399312,0.0002092434,0.0004657944,0.000071571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005621641,0.0007510064,0.0002740232,0.00001049323,0.0001647165,0.00001600849,0.00008177553,0.1712257,0.003778322,0.3327146,0.02743792,0.4634893],"study_design_scores_gemma":[0.0007934734,0.0008803919,0.0008954228,0.00001179842,0.00002308067,0.0002215685,0.000007479951,0.4516121,0.0004337624,0.5182962,0.02667238,0.0001523697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009588827,0.0003901705,0.9945691,0.002860315,0.0006986338,0.00023198,0.00002543607,0.0000408442,0.0002246488],"genre_scores_gemma":[0.1081892,0.00003826324,0.8892823,0.001115145,0.001246332,0.00002131105,0.00004061819,0.00001297304,0.00005389285],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4633369,"threshold_uncertainty_score":0.4270863,"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."}}