{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001305678,0.001186803,0.001335568,0.003501011,0.0009878461,0.001288663,0.002091236,0.001602058,0.005960735],"category_scores_gemma":[0.00790771,0.0004766674,0.0009526387,0.007310127,0.001065605,0.004354695,0.001725803,0.001617082,0.001796236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001039576,"about_ca_system_score_gemma":0.001786148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00197964,"about_ca_topic_score_gemma":0.002464049,"domain_scores_codex":[0.9979807,0.0004413992,0.0001617238,0.0005806346,0.0007226325,0.00011302],"domain_scores_gemma":[0.9972478,0.001620181,0.0003123747,0.0004206912,0.0003223956,0.00007655983],"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.0002150295,0.0002414612,0.001238064,0.0006827614,0.0001632539,0.000277005,0.0004050213,0.2231489,0.006220637,0.1342045,0.008262489,0.6249409],"study_design_scores_gemma":[0.00007490524,0.0002063318,0.000424184,0.00008107502,0.00004891723,0.0005297556,0.0002571994,0.6922294,0.005527672,0.2807684,0.01980557,0.00004668093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01060143,0.001334119,0.9838536,0.0003410788,0.000085331,0.0001445579,0.0002826617,0.0005824518,0.002774824],"genre_scores_gemma":[0.08896539,0.0015523,0.9040067,0.0001582673,0.0001423951,0.0003637333,0.0009979389,0.0001982362,0.003615006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005960735,"threshold_uncertainty_score":0.01994061,"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."}}