{"id":"W2615426555","doi":"10.1007/11602613_39","title":"Space Efficient Algorithms for Ordered Tree Comparison","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Tree (set theory); Algorithm; Space (punctuation); Computational complexity theory; Theoretical computer science; Time complexity; Tree structure; Mathematics; Binary tree; Combinatorics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009357461,0.0007804579,0.0008945782,0.0008363652,0.0004947048,0.0008001233,0.004799217,0.0004391881,0.0000254204],"category_scores_gemma":[0.00009521379,0.0006831879,0.0002394441,0.0006217117,0.0005384542,0.000513632,0.00214865,0.0008041356,0.00006231068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003952477,"about_ca_system_score_gemma":0.0005766033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002600891,"about_ca_topic_score_gemma":0.00007483354,"domain_scores_codex":[0.9944592,0.00003303354,0.000798811,0.002318281,0.001335013,0.00105571],"domain_scores_gemma":[0.9959919,0.0006832191,0.0004825918,0.002147457,0.0003868773,0.0003079118],"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.00001034441,0.0000804505,0.000006481781,0.00002844973,0.00001045757,0.00001785475,0.0003760174,0.09288334,0.00006860195,0.0133225,0.0002990583,0.8928964],"study_design_scores_gemma":[0.0006157208,0.0002481092,0.00004237674,0.0002934521,0.00001149812,0.00003384482,2.474444e-7,0.9461077,0.001089387,0.01936859,0.03137381,0.0008152407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001920844,0.001122732,0.9915703,0.001291389,0.002669152,0.0009158016,0.00003618875,0.0002730322,0.002102183],"genre_scores_gemma":[0.01002183,0.00003831557,0.9870504,0.000712129,0.001248597,0.00003298413,0.00003470039,0.00005887654,0.0008022029],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8920812,"threshold_uncertainty_score":0.9995619,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02560212002394364,"score_gpt":0.2801166683802985,"score_spread":0.2545145483563548,"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."}}