{"id":"W2176745125","doi":"10.1016/j.jda.2011.12.013","title":"Efficient chaining of seeds in ordered trees","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary; Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"Chaining; Extension (predicate logic); Combinatorics; Set (abstract data type); Computer science; Tree (set theory); Time complexity; Computational complexity theory; Mathematics; Forward chaining; Order (exchange); Constant (computer programming); Discrete mathematics; Theoretical computer science; Algorithm; Artificial intelligence; Expert system","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":[],"consensus_categories":[],"category_scores_codex":[0.0006944629,0.0001403515,0.0003564081,0.000341816,0.00004230511,0.00003291374,0.0009816714,0.00006165831,0.00002706053],"category_scores_gemma":[0.00005088185,0.0001024658,0.0001271706,0.0004783768,0.00005423598,0.0003378021,0.0002835479,0.0002353368,0.000003042974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000307524,"about_ca_system_score_gemma":0.00009614366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008621858,"about_ca_topic_score_gemma":0.00000631754,"domain_scores_codex":[0.9983185,0.0000803538,0.0007035941,0.0001789263,0.0004685101,0.0002501095],"domain_scores_gemma":[0.9987167,0.00006234262,0.0005751201,0.0003565838,0.0001690598,0.0001201692],"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.0004480789,0.002448642,0.01472602,0.0001401434,0.0003773402,0.001409579,0.04386279,0.01417565,0.0111592,0.02052006,0.001319631,0.8894129],"study_design_scores_gemma":[0.002811808,0.001314298,0.07083212,0.0006004871,0.00003062523,0.0002813364,0.0009958588,0.911282,0.007735305,0.002904516,0.0007605631,0.0004510902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1561304,0.0009661766,0.8400698,0.0001495434,0.0007931988,0.000108414,0.000009967664,0.00002224437,0.0017503],"genre_scores_gemma":[0.780368,0.00004551454,0.2194328,0.00002704196,0.00008989586,0.000001153853,8.195274e-7,0.000008791671,0.00002600533],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8971063,"threshold_uncertainty_score":0.4178435,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02836566294691057,"score_gpt":0.2556116409046778,"score_spread":0.2272459779577672,"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."}}