{"id":"W1008706668","doi":"10.1007/978-3-642-22616-8_24","title":"Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Substring; Partition (number theory); Combinatorics; Partition problem; Time complexity; Constant (computer programming); Mathematics; String (physics); Permutation (music); Discrete mathematics; Alphabet; Exponential function; Algorithm; Computer science; Data structure; Physics","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.0003646941,0.0002474171,0.0001967002,0.00009742381,0.000179405,0.00009861961,0.0004716766,0.0002139917,0.00001521106],"category_scores_gemma":[0.0000128442,0.0001956981,0.00007491976,0.00004756837,0.0003968453,0.00000842569,0.0003933428,0.0001668981,0.000005559463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002912671,"about_ca_system_score_gemma":0.00008774471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001368821,"about_ca_topic_score_gemma":0.00003036327,"domain_scores_codex":[0.9986383,0.00001336855,0.0002209213,0.0006156586,0.0001950985,0.0003166414],"domain_scores_gemma":[0.9993088,0.0000552149,0.0001255791,0.0003796873,0.00006993035,0.00006078586],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00009505628,0.00004069111,0.00007412856,0.00006629042,0.0000847924,0.000006417962,0.0003749927,0.001313927,0.0612809,0.0001630284,0.0002592751,0.9362405],"study_design_scores_gemma":[0.008221543,0.007140534,0.001828897,0.001133909,0.0005977572,0.0003899501,0.000004971465,0.3243156,0.4050059,0.08753841,0.1576182,0.006204268],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003358784,0.001274138,0.9930879,0.0002213386,0.0005826877,0.0009261345,0.00003227795,0.00001651776,0.0005002241],"genre_scores_gemma":[0.7502201,0.0007403956,0.2375569,0.0009928037,0.006131808,0.0002044352,0.0003410977,0.000194093,0.003618336],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9300362,"threshold_uncertainty_score":0.7980337,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01860607969824837,"score_gpt":0.2369785880351467,"score_spread":0.2183725083368984,"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."}}