{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001006366,0.0004876886,0.001085955,0.001563632,0.0008123299,0.001300259,0.001247876,0.001051758,0.003697162],"category_scores_gemma":[0.007947642,0.0006484063,0.0005167331,0.002337487,0.001035814,0.002550038,0.002093213,0.001237468,0.001057894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006073007,"about_ca_system_score_gemma":0.001033358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001013708,"about_ca_topic_score_gemma":0.002307835,"domain_scores_codex":[0.9991708,0.0002158437,0.0000693572,0.0001284637,0.0003059498,0.000109674],"domain_scores_gemma":[0.9944217,0.00292442,0.0003345622,0.001258807,0.0006864361,0.0003740767],"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.001641329,0.0004201511,0.004568901,0.0005793812,0.00007711886,0.0008619939,0.001050176,0.2248999,0.04622748,0.210211,0.01325324,0.4962094],"study_design_scores_gemma":[0.0001081418,0.0002202658,0.0004001112,0.00006081568,0.00003370632,0.0002418694,0.0001729905,0.816148,0.01737181,0.1600275,0.005189511,0.00002527201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.155949,0.000575463,0.8361914,0.0003777567,0.000131162,0.0001928635,0.0003310356,0.001238734,0.005012544],"genre_scores_gemma":[0.4514183,0.0004463389,0.5409073,0.0001275795,0.00008369932,0.0001184619,0.0009367584,0.0004086085,0.005552977],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003697162,"threshold_uncertainty_score":0.0123682,"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."}}