{"id":"W2063096021","doi":"10.1007/s10878-012-9552-1","title":"An improved algorithm for tree edit distance with applications for RNA secondary structure comparison","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Edit distance; Tree (set theory); Theory of computation; Recursion (computer science); Computer science; Algorithm; Speedup; Computation; Search tree; Tree structure; K-ary tree; Interval tree; Sequence (biology); Theoretical computer science; Mathematics; Combinatorics; Binary tree; Search algorithm; Parallel computing","routes":{"ca_aff":true,"ca_fund":true,"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.001823607,0.001563716,0.002439878,0.003073752,0.001294935,0.001966548,0.003975899,0.002020526,0.009850456],"category_scores_gemma":[0.006941964,0.0007755865,0.001453681,0.003715287,0.0005970252,0.002527975,0.002576027,0.002308347,0.004067048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008859358,"about_ca_system_score_gemma":0.001678592,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003766723,"about_ca_topic_score_gemma":0.007046932,"domain_scores_codex":[0.9973115,0.0004839741,0.0002325262,0.0007539708,0.001055043,0.0001630175],"domain_scores_gemma":[0.9967056,0.001256371,0.0001405864,0.000721609,0.001030322,0.0001455238],"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.0003756823,0.0003360013,0.0009393306,0.0003152323,0.0002363803,0.0002063563,0.0001790956,0.05812596,0.02363641,0.01296296,0.01142084,0.8912657],"study_design_scores_gemma":[0.0001576129,0.0002051298,0.0007652853,0.00002150916,0.00008364972,0.0004736558,0.00006148557,0.9467978,0.01631623,0.02046342,0.01458241,0.00007180279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003158223,0.0001101336,0.9921631,0.0000319446,0.00007269418,0.00006934384,0.0001746093,0.00374909,0.0004708874],"genre_scores_gemma":[0.01798554,0.00004941265,0.9796107,0.00003455489,0.00003292038,0.0001264146,0.0005318596,0.0004830096,0.001145601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009850456,"threshold_uncertainty_score":0.03295302,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006026028654255869,"score_gpt":0.2510503325650696,"score_spread":0.2450243039108137,"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."}}