{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006127327,0.003000092,0.00459135,0.003503314,0.003493538,0.008299644,0.01001855,0.007656091,0.03346027],"category_scores_gemma":[0.04944874,0.001588647,0.002690582,0.005495687,0.0040731,0.01603016,0.00910792,0.01642618,0.005418567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004526721,"about_ca_system_score_gemma":0.003644879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002245845,"about_ca_topic_score_gemma":0.002952251,"domain_scores_codex":[0.9942772,0.001588616,0.000191077,0.001018167,0.001752907,0.00117206],"domain_scores_gemma":[0.9475352,0.04221101,0.001402555,0.004030255,0.002258793,0.002562182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002315406,0.001017995,0.002970777,0.001407462,0.0003554652,0.000303884,0.0007748288,0.2611414,0.006591354,0.4486678,0.08727141,0.1871823],"study_design_scores_gemma":[0.00036764,0.0002454777,0.0007565024,0.0001699619,0.0001697183,0.0002813302,0.0002028609,0.4823212,0.001668451,0.5016749,0.01208816,0.00005380942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04460663,0.006032674,0.8729165,0.01867837,0.001208073,0.0003280895,0.001858763,0.001974725,0.05239624],"genre_scores_gemma":[0.4532848,0.006171632,0.4842969,0.006249296,0.002850197,0.001605237,0.00627805,0.002971706,0.03629202],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03346027,"threshold_uncertainty_score":0.1119357,"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."}}