{"id":"W2142543306","doi":"10.1016/j.ipl.2006.05.013","title":"A polynomial time algorithm for the minimum quartet inconsistency problem with quartet errors","year":2006,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Time complexity; Polynomial; Mathematics; Algorithm; Combinatorics; Discrete mathematics; Mathematical analysis","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.0003011482,0.0001975116,0.0001562885,0.0001349141,0.0005838637,0.0008051748,0.0006839168,0.00005639223,0.000004603296],"category_scores_gemma":[0.000008362366,0.0001257744,0.00005502529,0.0003440552,0.00009462768,0.004443112,0.00008423546,0.0001290078,0.00005169647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004896619,"about_ca_system_score_gemma":0.0001499001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008595125,"about_ca_topic_score_gemma":0.000004572597,"domain_scores_codex":[0.9985953,0.00002424502,0.0004509192,0.0002095229,0.0003803373,0.0003396668],"domain_scores_gemma":[0.9989586,0.0001029046,0.0003628165,0.0003683023,0.0001568628,0.00005048884],"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.00003222336,0.00005357361,0.00003814511,0.00008720675,0.00002193061,0.000002764926,0.002325453,0.001609884,0.0005874608,0.0001836275,0.1709105,0.8241472],"study_design_scores_gemma":[0.0010446,0.0001191379,0.0003323157,0.00009260121,0.0000187914,0.0000511512,0.0001536841,0.912398,0.0003367148,0.0001277234,0.08500137,0.0003238508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001147622,0.00004998464,0.9892562,0.00811807,0.0001492218,0.0004967281,0.00002734737,0.000225058,0.0005297706],"genre_scores_gemma":[0.05282918,0.000001744523,0.9382446,0.007598593,0.0004409123,0.0003480082,0.0002668251,0.00002744231,0.0002426815],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9107882,"threshold_uncertainty_score":0.7764319,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004749491763813111,"score_gpt":0.1964781987211015,"score_spread":0.1917287069572884,"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."}}