{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001782979,0.001994707,0.002411473,0.003656718,0.001496276,0.004519305,0.004681604,0.00178798,0.02168964],"category_scores_gemma":[0.01055396,0.001079347,0.001658823,0.009520058,0.001167301,0.009697485,0.003760505,0.003187851,0.006746334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002388827,"about_ca_system_score_gemma":0.002798215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002457147,"about_ca_topic_score_gemma":0.00461379,"domain_scores_codex":[0.9967443,0.0007063759,0.0003644534,0.0004866047,0.001330839,0.0003675147],"domain_scores_gemma":[0.9938948,0.003166785,0.0002882442,0.001616581,0.0008662555,0.0001673376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006248152,0.0003237977,0.0004013906,0.0005091599,0.00007968613,0.00007007405,0.0002501985,0.02625417,0.006028578,0.1196648,0.03355159,0.8122419],"study_design_scores_gemma":[0.0004473698,0.0003280777,0.0005224067,0.0001586798,0.0001108218,0.0004655838,0.0002793031,0.2972868,0.01290014,0.6497146,0.03769062,0.00009568517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01140642,0.00270906,0.9675217,0.0004432229,0.0003426681,0.0002899244,0.0008831738,0.005374161,0.01102966],"genre_scores_gemma":[0.06292062,0.001037457,0.9233971,0.0001973601,0.0002272836,0.0004603203,0.002302326,0.001016684,0.008440841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02168964,"threshold_uncertainty_score":0.07255912,"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."}}