{"id":"W2020892353","doi":"10.1089/cmb.2009.0039","title":"On the Maximal Interval Subgraph of a Tree","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Trent University","funders":"","keywords":"Tree (set theory); Mathematics; Combinatorics; Interval (graph theory); Induced subgraph isomorphism problem; Interval tree; Subgraph isomorphism problem; Time complexity; Algorithm; Computational complexity theory; Discrete mathematics; Computer science; Tree structure; Graph; Binary tree; Line graph","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.0004205118,0.00006455505,0.0001448753,0.0001212728,0.00004793978,0.00002175193,0.0007548782,0.00004608237,0.00003827974],"category_scores_gemma":[0.000102243,0.00003516038,0.000100517,0.0001275774,0.0001007318,0.0001277571,0.0001217035,0.0002749637,0.000006452029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004884574,"about_ca_system_score_gemma":0.00007771493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003219084,"about_ca_topic_score_gemma":0.000001886076,"domain_scores_codex":[0.999255,0.00008075,0.0003191322,0.00008712219,0.000169804,0.0000881911],"domain_scores_gemma":[0.9985313,0.0006924905,0.0003492432,0.0001490387,0.0002378914,0.00003997536],"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.00007736803,0.0001617496,0.0008745386,0.000003060984,0.00005153671,0.00001143234,0.0001630503,0.001119549,0.006545823,0.9233398,0.003845819,0.0638063],"study_design_scores_gemma":[0.0008203494,0.001349156,0.04775512,0.00003758421,0.000008942099,0.0004436885,0.00001922157,0.08447762,0.001871615,0.8575782,0.005505914,0.0001326238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4542948,0.00003313889,0.5419776,0.002532083,0.0007958674,0.00003160899,0.000006035742,0.000005650776,0.0003231991],"genre_scores_gemma":[0.9434654,0.000002412467,0.05608209,0.0003272585,0.0001126095,4.86652e-7,0.000002249617,0.000002039888,0.0000055236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4891705,"threshold_uncertainty_score":0.1433799,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01387078039604984,"score_gpt":0.2674234419283235,"score_spread":0.2535526615322736,"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."}}