{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003043516,0.0001292317,0.0001051494,0.00004425156,0.0004907614,0.0004114627,0.0008103977,0.00003847206,0.00001532326],"category_scores_gemma":[0.00003852812,0.00007929356,0.00006324394,0.0001675946,0.00001992895,0.0004759571,0.0003237001,0.0001406445,0.00002206083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003185689,"about_ca_system_score_gemma":0.000009337082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001906561,"about_ca_topic_score_gemma":0.0000114285,"domain_scores_codex":[0.9987924,0.00001769133,0.0001996857,0.0003689261,0.0002319448,0.0003893418],"domain_scores_gemma":[0.9991497,0.0001913167,0.00009292679,0.0004663148,0.00004383576,0.00005587661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002160285,0.00006466825,0.0000311913,0.00002153844,0.00000966177,0.000003286907,0.0004828103,0.0008970713,0.0001025839,0.04032221,0.002875042,0.9551878],"study_design_scores_gemma":[0.0002591638,0.00009434242,0.000050361,0.00007502465,0.00000301151,0.000008916737,0.00008059987,0.9774402,0.00006683781,0.00217788,0.01961214,0.0001314912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000511885,0.0001088153,0.9950321,0.001940175,0.0002319224,0.0005018663,0.000001881604,0.0002523591,0.001419029],"genre_scores_gemma":[0.1722883,0.00001476204,0.82606,0.0003171763,0.0002378262,0.0001595052,0.000004687726,0.00001511059,0.0009026765],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9765432,"threshold_uncertainty_score":0.3967744,"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."}}