{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002276185,0.003318551,0.003228029,0.002003781,0.001789352,0.003794648,0.005235928,0.003511819,0.02079298],"category_scores_gemma":[0.01208887,0.001259564,0.002965629,0.004769298,0.001702855,0.005539844,0.004236463,0.005831487,0.006624612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003384221,"about_ca_system_score_gemma":0.004615501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005183301,"about_ca_topic_score_gemma":0.006225348,"domain_scores_codex":[0.9972261,0.0005615383,0.000143692,0.0008102145,0.0007480007,0.0005105049],"domain_scores_gemma":[0.9943554,0.003129258,0.0002197412,0.001373075,0.0005618415,0.0003605833],"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.001976013,0.001036403,0.000818396,0.00094383,0.000181222,0.0002025159,0.0003122408,0.2089589,0.008350752,0.1054279,0.09470629,0.5770855],"study_design_scores_gemma":[0.0004346725,0.0001189573,0.0001969456,0.00006697205,0.00007372619,0.0001518584,0.00007237491,0.8226651,0.002213585,0.1659003,0.008070026,0.00003553109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02216702,0.00145923,0.9431965,0.0023008,0.0006427208,0.0004591094,0.001360687,0.006877086,0.02153677],"genre_scores_gemma":[0.1229733,0.0005017221,0.8588216,0.000810552,0.0004638669,0.001018569,0.002590484,0.001561864,0.01125812],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02079298,"threshold_uncertainty_score":0.06955945,"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."}}