{"id":"W2771233158","doi":"10.4018/978-1-59904-845-1.ch080","title":"A New Algorithm for Subset Matching Problem Based on Set-String Transformation","year":2009,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"String searching algorithm; Pattern matching; Approximate string matching; String (physics); Matching (statistics); Algorithm; Set (abstract data type); Mathematics; Context (archaeology); Computer science; Tree (set theory); Discrete mathematics; Combinatorics; Programming language","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.0008349586,0.00137185,0.002302417,0.002515545,0.001424122,0.001827199,0.002885092,0.001807753,0.01292232],"category_scores_gemma":[0.002877692,0.0005914634,0.002003039,0.003555122,0.0007841648,0.005152149,0.003340518,0.002163919,0.003974157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009331462,"about_ca_system_score_gemma":0.001663469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001493855,"about_ca_topic_score_gemma":0.001440616,"domain_scores_codex":[0.9983255,0.0002504744,0.0001981136,0.0005557541,0.0004911306,0.0001788768],"domain_scores_gemma":[0.9991817,0.0002530924,0.00005446966,0.0002299028,0.0002272439,0.00005361618],"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.0004706586,0.0003498064,0.001099753,0.0004222083,0.000101435,0.0002082173,0.0002576808,0.03718538,0.01771012,0.07239195,0.0249074,0.8448954],"study_design_scores_gemma":[0.0003304021,0.000354297,0.0005771884,0.00005969805,0.00009876272,0.0009683331,0.0002072076,0.7665128,0.02056122,0.1622599,0.04799677,0.00007342727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005474553,0.0001882724,0.9879952,0.0002317153,0.0001238968,0.0002208931,0.0001956006,0.002566285,0.003003539],"genre_scores_gemma":[0.03276976,0.0001572042,0.9613358,0.0001931105,0.00007915646,0.0004501539,0.001139674,0.0004285083,0.003446588],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01292232,"threshold_uncertainty_score":0.04322946,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01917422701184059,"score_gpt":0.2503008154356428,"score_spread":0.2311265884238022,"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."}}