{"id":"W4360980788","doi":"10.1007/s42979-023-01690-8","title":"On the Multiple Pattern String Matching in DNA Databases","year":2023,"lang":"en","type":"article","venue":"SN Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto; University of Winnipeg","funders":"School of Natural Sciences, Mathematics, and Engineering, California State University, Bakersfield","keywords":"Substring; String searching algorithm; Pattern matching; Suffix tree; Search engine indexing; Computer science; String (physics); Character (mathematics); Transformation (genetics); Tree (set theory); Set (abstract data type); Matching (statistics); Combinatorics; Algorithm; Mathematics; Artificial intelligence; Data structure; 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.004238598,0.0007195463,0.001943327,0.004153212,0.001047505,0.002924025,0.002620831,0.002216696,0.00523337],"category_scores_gemma":[0.02112019,0.0006941781,0.001164727,0.008550298,0.002509239,0.009280956,0.002742133,0.002596871,0.002031681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001049404,"about_ca_system_score_gemma":0.001551506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002723361,"about_ca_topic_score_gemma":0.001617981,"domain_scores_codex":[0.9949446,0.001714424,0.0006112425,0.0007207646,0.001747837,0.0002610497],"domain_scores_gemma":[0.9880343,0.008547062,0.000384468,0.001725195,0.001113989,0.0001950304],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006635442,0.0002004903,0.001528691,0.000525119,0.0001296684,0.0003830332,0.0002179531,0.06807379,0.005687084,0.1506943,0.01359558,0.7583007],"study_design_scores_gemma":[0.00007307671,0.0001998607,0.0008726838,0.0001808285,0.00008558613,0.0006694187,0.0001510144,0.6283498,0.007183767,0.3436607,0.01852211,0.00005121041],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01779532,0.008348973,0.9656276,0.002321414,0.0007381834,0.0001062944,0.0002625233,0.0006157005,0.004183885],"genre_scores_gemma":[0.2619385,0.01936348,0.6971942,0.001799429,0.002551793,0.0002908011,0.00136768,0.0003994463,0.01509462],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00523337,"threshold_uncertainty_score":0.02241606,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04220773460392502,"score_gpt":0.2763246664326198,"score_spread":0.2341169318286948,"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."}}