{"id":"W2054120410","doi":"10.1109/bibe.2007.4375584","title":"Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings","year":2007,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Longest common subsequence problem; Generalization; Computer science; Longest increasing subsequence; Shortest path problem; Set (abstract data type); Algorithm; Dynamic programming; Theoretical computer science; Approximation algorithm; Combinatorics; Subsequence; Mathematics","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.0006312057,0.00007245853,0.0001275259,0.00003163113,0.00005665067,0.00002135614,0.0008878955,0.00003292038,0.000003360599],"category_scores_gemma":[0.00002047662,0.00004246798,0.00004517445,0.0001768897,0.00007782703,0.0002138472,0.0002536611,0.00005396493,5.914425e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007467488,"about_ca_system_score_gemma":0.00002537813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002437693,"about_ca_topic_score_gemma":0.0000443408,"domain_scores_codex":[0.9992536,0.00001106988,0.0002255036,0.0001703518,0.0001861845,0.0001533324],"domain_scores_gemma":[0.9988465,0.0004014437,0.0001137638,0.0005435486,0.00005883747,0.00003590329],"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.00005154646,0.0002403428,0.01597189,0.00009067987,0.00004380515,0.00000678218,0.001518474,0.0009353622,0.004011932,0.3410057,0.001688526,0.634435],"study_design_scores_gemma":[0.0006657573,0.0005198495,0.0846838,0.0001069137,0.00002573312,0.00002534852,0.0006747307,0.7972185,0.1065193,0.005746018,0.003474002,0.0003400977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04351403,0.0001519141,0.9553083,0.0001612735,0.00006297474,0.0002029369,0.00002204055,0.00002477219,0.0005517485],"genre_scores_gemma":[0.9337029,0.000009700336,0.06617644,0.00003064718,0.00002750434,0.000005468284,0.000006369824,0.000003216159,0.00003767967],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8901889,"threshold_uncertainty_score":0.1731794,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08279382444758358,"score_gpt":0.2846085910428433,"score_spread":0.2018147665952597,"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."}}