{"id":"W2607298947","doi":"10.1101/127548","title":"MaxTiC: Fast ranking of a phylogenetic tree by Maximum Time Consistency with lateral gene transfers","year":2017,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche; European Commission","keywords":"Phylogenetic tree; Tree (set theory); Tree rearrangement; Ranking (information retrieval); Consistency (knowledge bases); Set (abstract data type); Phylogenetic network; False positive paradox; Computer science; Constraint (computer-aided design); Rank (graph theory); Horizontal gene transfer; Interval (graph theory); Interval tree; Biology; Statistics; Mathematics; Gene; Algorithm; Tree structure; Machine learning; Artificial intelligence; Combinatorics; Binary tree; Genetics","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.006071669,0.002588057,0.002641142,0.005352248,0.00146355,0.004789627,0.00313213,0.002856256,0.01117825],"category_scores_gemma":[0.02617573,0.001192482,0.003495351,0.003819464,0.001008955,0.003268522,0.002488567,0.002724861,0.005103836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001260036,"about_ca_system_score_gemma":0.002064124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001746614,"about_ca_topic_score_gemma":0.003662558,"domain_scores_codex":[0.9962442,0.001294071,0.0003435153,0.000912425,0.0009575985,0.0002483263],"domain_scores_gemma":[0.9899021,0.005996182,0.001031428,0.001358511,0.001200361,0.0005112691],"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.00298054,0.0005092617,0.03579284,0.004279487,0.00171879,0.0009907028,0.001139418,0.1886432,0.03908982,0.01617025,0.1018703,0.6068155],"study_design_scores_gemma":[0.000434733,0.0003862873,0.005873706,0.0002581243,0.0002238915,0.0007060506,0.0002482374,0.9224595,0.01590129,0.0343847,0.01896106,0.0001624184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06379978,0.001979655,0.8250389,0.0005622625,0.0004294248,0.0003995101,0.01260141,0.09202186,0.003167337],"genre_scores_gemma":[0.2079128,0.0003924488,0.7494204,0.0003680522,0.000293282,0.0006042664,0.03032595,0.009068751,0.00161415],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01117825,"threshold_uncertainty_score":0.037395,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008100664918299116,"score_gpt":0.1947606488180275,"score_spread":0.1866599838997284,"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."}}