{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005491367,0.0003699534,0.000791624,0.001111597,0.0006120717,0.0009119501,0.0006446157,0.0005860401,0.003337576],"category_scores_gemma":[0.004206578,0.0003025823,0.0006275214,0.002262484,0.0008735865,0.002631997,0.001012113,0.0007195526,0.0005165223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005748125,"about_ca_system_score_gemma":0.0003626156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00149748,"about_ca_topic_score_gemma":0.001268914,"domain_scores_codex":[0.9995286,0.0001643142,0.00002066857,0.0001188614,0.0001051405,0.0000625019],"domain_scores_gemma":[0.997855,0.001584538,0.0001772591,0.0001772899,0.0001277956,0.00007816552],"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.000547746,0.0001723377,0.003189216,0.0007701963,0.0001032954,0.0007623191,0.0009455514,0.2940895,0.02326057,0.4003124,0.01609813,0.2597488],"study_design_scores_gemma":[0.00005371157,0.0000790257,0.001215451,0.00005123078,0.00003292437,0.0003922133,0.000213839,0.5099832,0.004284058,0.4779423,0.005732262,0.0000197127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2361051,0.0009037085,0.7518269,0.0009378276,0.00004112855,0.00008224758,0.000649735,0.0005057864,0.008947628],"genre_scores_gemma":[0.5592474,0.001309632,0.4303753,0.0002402574,0.0001624763,0.0001570052,0.002452277,0.0002875366,0.005768214],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003337576,"threshold_uncertainty_score":0.01116526,"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."}}