{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005674303,0.0006377298,0.0007690741,0.001288677,0.0006476019,0.0009928212,0.001462659,0.0005686111,0.00330005],"category_scores_gemma":[0.00232274,0.000303933,0.0004797043,0.002010176,0.0005508416,0.001699922,0.001017561,0.0009293748,0.001403665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003820604,"about_ca_system_score_gemma":0.001197015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000637142,"about_ca_topic_score_gemma":0.001083806,"domain_scores_codex":[0.9993523,0.00006933026,0.00006181729,0.0001235555,0.0003411993,0.00005176813],"domain_scores_gemma":[0.9990283,0.0002903969,0.00009920745,0.0002164383,0.0003185079,0.00004718922],"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.0003030769,0.0001141175,0.001131417,0.0002011588,0.00005755298,0.0002849376,0.0002951273,0.04104125,0.1033749,0.05010936,0.004734421,0.7983526],"study_design_scores_gemma":[0.0001337585,0.0009273387,0.001103122,0.00006424868,0.000121155,0.001311205,0.0002295504,0.7400314,0.1541062,0.05607864,0.04579668,0.00009676573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00657692,0.0001423879,0.9911747,0.00005406852,0.00006769493,0.00003212641,0.00004047059,0.0009189164,0.0009925439],"genre_scores_gemma":[0.08028802,0.0002629111,0.9158846,0.00007854922,0.0001035152,0.0001226477,0.0002647335,0.0001037238,0.002891293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00330005,"threshold_uncertainty_score":0.01103973,"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."}}