{"id":"W1539735287","doi":"10.1007/978-3-540-73545-8_47","title":"An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Linearity; Algorithm; Computer science; Tree (set theory); Edit distance; Mathematics; Engineering; Combinatorics; Electronic engineering","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.001321091,0.0007029195,0.0006600941,0.0005476691,0.0006319496,0.00102843,0.004621618,0.0004723859,0.000006975847],"category_scores_gemma":[0.00007791687,0.0006092465,0.0001625195,0.0005355735,0.0006440979,0.001786544,0.001376693,0.0009696995,0.000005035636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003083659,"about_ca_system_score_gemma":0.0005565404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006249559,"about_ca_topic_score_gemma":0.0002523559,"domain_scores_codex":[0.9951153,0.00003118287,0.0007634415,0.002192912,0.0009936248,0.0009035604],"domain_scores_gemma":[0.9960899,0.0004762258,0.0005729044,0.002014907,0.0005033086,0.0003427686],"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.000007403603,0.00001879997,0.0000135213,0.00002255626,0.000005604767,0.00002827172,0.0001440081,0.001640222,0.0001310072,0.005117824,0.00001459499,0.9928562],"study_design_scores_gemma":[0.0003845939,0.0003441773,0.00007543499,0.0001573905,0.000006329162,0.00003360217,1.879569e-7,0.897476,0.0007494035,0.09881674,0.001252728,0.0007034274],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000192322,0.0002604435,0.9939256,0.0001203276,0.004351833,0.0007041451,0.00009102561,0.000244923,0.0002825192],"genre_scores_gemma":[0.006314123,0.00000693498,0.9903045,0.0005972174,0.002515884,0.00001437091,0.00008553621,0.0000452482,0.0001161455],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9921528,"threshold_uncertainty_score":0.9996359,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01989106057418656,"score_gpt":0.2802475830311097,"score_spread":0.2603565224569231,"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."}}