{"id":"W4234230435","doi":"10.4018/978-1-5225-7659-4.ch021","title":"A Fast and Space-Economical Algorithm for the Tree Inclusion Problem","year":2018,"lang":"en","type":"book-chapter","venue":"Advances in library and information science (ALIS) book series","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Tree (set theory); Set (abstract data type); Bounded function; Mathematics; Order (exchange); Combinatorics; Space (punctuation); Algorithm; Inclusion (mineral); Computer science; Discrete mathematics; Chemistry","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.000999455,0.00199723,0.001577752,0.001560796,0.001754439,0.002483369,0.003160617,0.00207094,0.02006988],"category_scores_gemma":[0.004118418,0.001036349,0.002755108,0.004263404,0.0009284384,0.004967791,0.00320463,0.003612877,0.007795839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001727817,"about_ca_system_score_gemma":0.003217591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003927801,"about_ca_topic_score_gemma":0.005327412,"domain_scores_codex":[0.9984189,0.0002305433,0.0001061361,0.0004619072,0.0005870501,0.0001954809],"domain_scores_gemma":[0.9984618,0.0008297514,0.00007462958,0.0002891926,0.0002830573,0.00006159374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001625142,0.0003255902,0.0003854038,0.0006416555,0.00006644865,0.0001229258,0.0002448944,0.0373072,0.005809739,0.07960866,0.08211471,0.7932102],"study_design_scores_gemma":[0.000293617,0.0002104119,0.000528675,0.0001581251,0.00008457284,0.0006818096,0.0003232485,0.6160662,0.00911914,0.2848143,0.08763918,0.00008077473],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004480197,0.0005782775,0.978184,0.0005604331,0.0001964934,0.0003931915,0.0005120671,0.003002143,0.01209314],"genre_scores_gemma":[0.01557064,0.0003524893,0.975339,0.0001660966,0.00006988283,0.0003113634,0.001297257,0.0005468296,0.006346518],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02006988,"threshold_uncertainty_score":0.0671404,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00541216385640624,"score_gpt":0.2099398408281181,"score_spread":0.2045276769717118,"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."}}