{"id":"W1973111150","doi":"10.1016/s1570-8667(03)00077-7","title":"A lower bound for the breakpoint phylogeny problem","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Breakpoint; Phylogenetics; Heuristics; Phylogenetic tree; Genome; Computer science; Combinatorics; Biology; Mathematics; Algorithm; Computational biology; Evolutionary biology; Gene; Mathematical optimization; Genetics; Chromosome","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.0005298686,0.0001889611,0.0002130433,0.00005479904,0.0001442673,0.0000734199,0.0004288302,0.0001028464,0.00001692289],"category_scores_gemma":[0.00005633074,0.000120158,0.000372352,0.0001016154,0.0001074715,0.00001065664,0.00008525675,0.0001529785,0.000006475509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004484107,"about_ca_system_score_gemma":0.0001776494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001383053,"about_ca_topic_score_gemma":0.00001291948,"domain_scores_codex":[0.99874,0.00002668914,0.000429743,0.0001992098,0.0002826342,0.0003216872],"domain_scores_gemma":[0.9989434,0.00002378716,0.0003312593,0.0003010726,0.0002871538,0.000113329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001087891,0.0007448168,0.0003426223,0.0001424776,0.002768636,0.0000938728,0.0007733999,0.007109355,0.8863031,0.0006795576,0.01269551,0.08725877],"study_design_scores_gemma":[0.0176164,0.01159391,0.006066201,0.0002462436,0.0009750088,0.001938666,0.001361853,0.0007605017,0.2092155,0.01867312,0.7300154,0.001537232],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.311398,0.01763571,0.6558877,0.008717527,0.002695619,0.0021664,0.0001783494,0.00002446243,0.001296182],"genre_scores_gemma":[0.8803204,0.001521096,0.1117557,0.000743028,0.004116965,0.00008081549,0.00004504334,0.0001152607,0.001301739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7173198,"threshold_uncertainty_score":0.4899902,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01073836497027397,"score_gpt":0.2569843468178186,"score_spread":0.2462459818475446,"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."}}