{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003117749,0.003039905,0.003141575,0.00223537,0.002613554,0.007739828,0.007618567,0.004088446,0.02155541],"category_scores_gemma":[0.01681172,0.001787122,0.00368001,0.006440784,0.003251,0.01532494,0.004855589,0.008740991,0.00497341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006414658,"about_ca_system_score_gemma":0.005734288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005950036,"about_ca_topic_score_gemma":0.009248283,"domain_scores_codex":[0.9962483,0.0007673535,0.0002241058,0.001122593,0.0009899859,0.0006475872],"domain_scores_gemma":[0.9865707,0.009648491,0.0005680776,0.001973741,0.0007642407,0.0004748015],"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.00238001,0.001112098,0.001240872,0.001369486,0.0002728189,0.0001651235,0.000850567,0.1369506,0.00655313,0.3243984,0.09214701,0.4325598],"study_design_scores_gemma":[0.0007351755,0.0001119939,0.0005132934,0.00009206193,0.000155545,0.0002172952,0.0002873135,0.2881054,0.002935101,0.6953311,0.01144999,0.0000657269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05544776,0.004152322,0.8786302,0.006288551,0.0006418758,0.0005623337,0.002953848,0.005829822,0.04549332],"genre_scores_gemma":[0.1773624,0.002173557,0.7905567,0.0009805266,0.0006491246,0.0009341147,0.006289626,0.001945268,0.01910865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02155541,"threshold_uncertainty_score":0.07211006,"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."}}