{"id":"W2909459383","doi":"10.1016/j.dnarep.2019.01.003","title":"An open-source algorithm for rapid unbiased determination of DNA fiber length","year":2019,"lang":"en","type":"article","venue":"DNA repair","topic":"Molecular Biology Techniques and Applications","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Hôpital Maisonneuve-Rosemont","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Algorithm; Biology; Benchmark (surveying); Computer science; DNA; Open source; Computational biology; Genetics; Software","routes":{"ca_aff":true,"ca_fund":true,"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.001391224,0.001825136,0.001290025,0.00196893,0.001065937,0.001853321,0.002873999,0.001880731,0.02092556],"category_scores_gemma":[0.006732587,0.0009079215,0.001016914,0.001544008,0.0004733029,0.001503181,0.001975294,0.001657488,0.01408718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009050334,"about_ca_system_score_gemma":0.002246833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004093014,"about_ca_topic_score_gemma":0.009364406,"domain_scores_codex":[0.9989723,0.0001314363,0.00005922451,0.0003435366,0.0004094902,0.00008401646],"domain_scores_gemma":[0.9980814,0.0009027109,0.0001370671,0.0002429795,0.0005405377,0.00009522958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005977904,0.0001581407,0.002028592,0.0004193837,0.0001973544,0.0001513675,0.0001104035,0.02973867,0.02696468,0.007600433,0.04776494,0.8842682],"study_design_scores_gemma":[0.0003056897,0.0001195141,0.001680361,0.00006273635,0.00007226283,0.0004705612,0.00005238505,0.9035811,0.03507982,0.02287495,0.03560241,0.00009835086],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001948661,0.0001995175,0.9654536,0.00007112556,0.00007242381,0.00008524037,0.0006949084,0.03060922,0.0008652816],"genre_scores_gemma":[0.01745,0.00008720339,0.9768984,0.00007892865,0.00003474625,0.0002492392,0.00150587,0.001493538,0.00220202],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02092556,"threshold_uncertainty_score":0.07000297,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01025905403430695,"score_gpt":0.2849767357266497,"score_spread":0.2747176816923428,"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."}}