{"id":"W2075485134","doi":"10.1007/s10878-010-9366-y","title":"Exact and approximation algorithms for the complementary maximal strip recovery problem","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Substring; Approximation algorithm; Combinatorics; Mathematics; Theory of computation; Algorithm; Sequence (biology); Set (abstract data type); Constant (computer programming); Running time; Discrete mathematics; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.003141514,0.001931775,0.002706698,0.001709093,0.001463483,0.003820422,0.005300638,0.003166569,0.01282826],"category_scores_gemma":[0.01290948,0.001178767,0.001716129,0.003625647,0.002232445,0.00657764,0.003791032,0.004439416,0.001626257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003113337,"about_ca_system_score_gemma":0.004551473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006814122,"about_ca_topic_score_gemma":0.009485793,"domain_scores_codex":[0.9977165,0.000691413,0.00009474464,0.0005132567,0.0005245703,0.0004594934],"domain_scores_gemma":[0.9903843,0.006982728,0.0005141954,0.00123287,0.0004995054,0.0003863002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001118643,0.0008287693,0.001280338,0.0004755973,0.0001422322,0.0001212683,0.0002900911,0.6786722,0.00241862,0.1025707,0.02500933,0.1870722],"study_design_scores_gemma":[0.0001391961,0.00005567598,0.0001912374,0.00001921184,0.00003062265,0.00004901978,0.00008869007,0.9131625,0.0005756244,0.08443495,0.001237807,0.00001556613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05289122,0.0009737351,0.9285538,0.002077093,0.0001903599,0.0002593828,0.0007693301,0.001551207,0.01273395],"genre_scores_gemma":[0.2958255,0.0006312954,0.6920316,0.0004877687,0.0002440583,0.0004624571,0.001931324,0.0005621202,0.007823842],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01282826,"threshold_uncertainty_score":0.04291481,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01119861558667182,"score_gpt":0.247467282165162,"score_spread":0.2362686665784902,"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."}}