{"id":"W2111681107","doi":"10.1109/iscas.2006.1693520","title":"A systolic array technique for determining common approximate substrings","year":2006,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge; University of New Brunswick","funders":"","keywords":"Substring; Systolic array; Computation; Computer science; Algorithm; Edit distance; Theoretical computer science; Data structure; Very-large-scale integration","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.000197553,0.0001138573,0.0001475438,0.00007298234,0.0001485357,0.0001509617,0.0006470805,0.00005477359,0.000003174961],"category_scores_gemma":[0.000005686776,0.00009147761,0.00005047703,0.0001509981,0.00001756001,0.0004043209,0.000160684,0.00006262826,0.000006641392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002182228,"about_ca_system_score_gemma":0.00001837635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001405333,"about_ca_topic_score_gemma":0.00001072921,"domain_scores_codex":[0.9991108,0.00001516606,0.0002012165,0.0002945905,0.000124365,0.0002539239],"domain_scores_gemma":[0.9993062,0.00006633595,0.00007700557,0.0004711965,0.00003596649,0.00004329224],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002972426,0.0003986881,0.0028944,0.0003294426,0.0000229268,0.00005097557,0.0003289116,0.0002607392,0.3953827,0.4410879,0.01732923,0.1418843],"study_design_scores_gemma":[0.0008003024,0.0001749756,0.001334653,0.0001656353,0.000009395421,0.000160767,0.00002011705,0.3116389,0.6294163,0.03145232,0.0241639,0.000662775],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003033381,0.00002958715,0.9929786,0.00007946735,0.00009315802,0.0003781077,0.00000499022,0.0003086388,0.003094085],"genre_scores_gemma":[0.4289357,0.00000103543,0.5705037,0.00007712237,0.00006729,0.0001753659,0.00001133212,0.000008812326,0.000219729],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4259023,"threshold_uncertainty_score":0.3730349,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01360076919555483,"score_gpt":0.2466822254071885,"score_spread":0.2330814562116336,"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."}}