{"id":"W4242856398","doi":"10.1145/564913.564916","title":"Parallel dynamic programming for solving the string editing problem on a CGM/BSP","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Substring; Computer science; Dynamic programming; Parallel computing; String (physics); Bulk synchronous parallel; Computation; Parallel algorithm; Graph; Grid; Algorithm; Theoretical computer science; Data structure; Mathematics; 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.0008319613,0.0008646198,0.001066433,0.0008161515,0.0009343259,0.0009294864,0.001722051,0.0009559746,0.004247039],"category_scores_gemma":[0.003141762,0.0003772734,0.0006774383,0.001561119,0.001139926,0.001537111,0.001620357,0.00176922,0.001067734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001181131,"about_ca_system_score_gemma":0.001535087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006738903,"about_ca_topic_score_gemma":0.007855632,"domain_scores_codex":[0.9991108,0.0002079805,0.00003715884,0.0002222627,0.0002998657,0.0001218715],"domain_scores_gemma":[0.999146,0.000454382,0.00006450435,0.000173982,0.0001172338,0.00004391919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002054499,0.0001352888,0.0005552924,0.000162146,0.00004344016,0.000148789,0.000147112,0.6600031,0.007536464,0.08196948,0.005983057,0.2431104],"study_design_scores_gemma":[0.00003857379,0.00002510339,0.00006288863,0.000003694425,0.000006708274,0.00002617074,0.00002234254,0.9519377,0.002140971,0.04334968,0.002380197,0.000006031337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00946947,0.00006559315,0.9868803,0.0001809643,0.00002907702,0.00006657522,0.00005579713,0.0009901533,0.00226207],"genre_scores_gemma":[0.122626,0.0000989191,0.8725669,0.0001518429,0.00005065783,0.0003865526,0.0002821059,0.0002606062,0.003576466],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006738903,"threshold_uncertainty_score":0.01420778,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02497960470590364,"score_gpt":0.2521034068286063,"score_spread":0.2271238021227027,"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."}}