{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002009378,0.0004987271,0.000426549,0.0001237098,0.0002203068,0.0003819501,0.0009829422,0.0003503798,0.000007657674],"category_scores_gemma":[0.000002572281,0.0004652511,0.0002583214,0.00003310169,0.00001556121,0.0003275921,0.0001018347,0.0003011344,0.00004239818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002372747,"about_ca_system_score_gemma":0.0003460533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008003229,"about_ca_topic_score_gemma":0.00001502562,"domain_scores_codex":[0.9977709,0.00001664276,0.0004923812,0.0006850309,0.0005985473,0.0004364792],"domain_scores_gemma":[0.9986355,0.00005387429,0.0002628974,0.000724328,0.00008802443,0.0002354078],"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.00001107989,0.000004988251,3.539581e-8,0.00002069363,0.000009524372,0.000008389797,0.00005376647,0.0001365393,0.000002483434,0.4757577,0.001362525,0.5226323],"study_design_scores_gemma":[0.001293887,0.0004121143,0.000003551573,0.0008892527,0.00003998438,0.00002868391,0.000003517639,0.1841492,0.0001212478,0.7104459,0.1018684,0.0007441996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[6.638874e-7,0.00004601289,0.6824634,0.0001275004,0.0002395644,0.0006578992,0.0003416045,0.0002382825,0.3158851],"genre_scores_gemma":[0.0009058275,0.000004557067,0.9792326,0.001362047,0.0006000877,0.00004216397,0.0001860651,0.00005699671,0.01760963],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5218881,"threshold_uncertainty_score":0.9997799,"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."}}