{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002431748,0.0001200395,0.0001972772,0.00003587057,0.0001123985,0.00003748989,0.000161878,0.00014612,0.000007667623],"category_scores_gemma":[0.00003128972,0.0000985945,0.00007710628,0.00005478698,0.00002181795,0.00003681378,0.000008811789,0.00006820061,7.29219e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000021741,"about_ca_system_score_gemma":0.00009377145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.015775e-7,"about_ca_topic_score_gemma":6.566956e-7,"domain_scores_codex":[0.9992705,0.00003647968,0.0002954325,0.0001176263,0.0001134308,0.0001665193],"domain_scores_gemma":[0.998836,0.0000263228,0.000455791,0.0001589458,0.0004131704,0.0001098151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002753761,0.0009164768,0.0002627166,0.0001142088,0.0003534799,2.670811e-7,0.0001983212,0.01877026,0.7786109,0.005751489,0.002079207,0.1901889],"study_design_scores_gemma":[0.006621562,0.004855709,0.00006122352,0.00002916782,0.0002378964,0.00002354024,0.0001558564,0.03766512,0.8849316,0.003522084,0.06143699,0.0004592119],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002595257,0.0003322776,0.9950067,0.00004340095,0.001250949,0.0006650098,0.00007334958,0.00000488355,0.00002820445],"genre_scores_gemma":[0.4647177,0.00002005558,0.5316664,0.00003215117,0.003234657,0.00008201956,0.0001943125,0.00002958228,0.00002309689],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4633403,"threshold_uncertainty_score":0.4020567,"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."}}