{"id":"W2811221372","doi":"10.1007/978-3-319-94776-1_3","title":"A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Bottleneck; Approximation algorithm; Decomposition; Combinatorics; Algorithm; Time complexity; Computer science; Randomized algorithm; Mathematics; Discrete mathematics; Biology","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006971089,0.0002973825,0.0003482787,0.00020527,0.0001606168,0.0001166979,0.0005098491,0.0001991993,0.00001404219],"category_scores_gemma":[0.00002382735,0.0002530717,0.0001150249,0.0001069909,0.0005272973,0.00001123599,0.0001731652,0.0001312212,0.000009708567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006927167,"about_ca_system_score_gemma":0.0001323683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004897471,"about_ca_topic_score_gemma":0.00001680083,"domain_scores_codex":[0.9982333,0.00002702268,0.0002995774,0.0008278581,0.0003140166,0.0002982176],"domain_scores_gemma":[0.9987964,0.00008525192,0.0002574096,0.0004939633,0.0002985308,0.00006843881],"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.0008163545,0.00005079112,0.000003119431,0.00006445909,0.00008956855,0.000001982552,0.0001291476,0.005089068,0.005048686,0.0002825239,0.00002254556,0.9884018],"study_design_scores_gemma":[0.03611468,0.0007594289,0.000004535218,0.0002421878,0.00011638,0.00008659957,7.916771e-7,0.8232389,0.03062956,0.1001251,0.007604342,0.001077474],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002033088,0.0002384194,0.9961612,0.00008271621,0.0001885077,0.002414289,0.00002590788,0.00002479315,0.0006608432],"genre_scores_gemma":[0.005666564,0.00004829609,0.991608,0.0002486255,0.001113518,0.0006376632,0.0003282718,0.00005083671,0.0002982329],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9873243,"threshold_uncertainty_score":0.9999921,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008534293592855747,"score_gpt":0.25558125869686,"score_spread":0.2470469651040043,"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."}}