{"id":"W1525672419","doi":"10.1007/978-3-540-87989-3_17","title":"On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Reuse; Breakpoint; Genome; Computer science; Set (abstract data type); Human genome; Computational biology; Theoretical computer science; Algorithm; Chromosomal translocation; Biology; Genetics; Programming language; Gene","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.0008750668,0.0003969537,0.0002970593,0.0002846792,0.000181694,0.00008877276,0.001492558,0.0002458507,0.0000159471],"category_scores_gemma":[0.0001315649,0.0003037368,0.000129455,0.000208642,0.0004877709,0.000005487253,0.001031169,0.0005473662,0.0000309657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001518283,"about_ca_system_score_gemma":0.000209197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003209592,"about_ca_topic_score_gemma":0.0001437917,"domain_scores_codex":[0.9975712,0.00006116918,0.0003786361,0.001022809,0.0004551281,0.0005110663],"domain_scores_gemma":[0.9982024,0.0001047864,0.0001744747,0.001345518,0.00009831364,0.00007447899],"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.0001708676,0.0002392,0.0005012972,0.0001126884,0.0001409942,0.0004420628,0.00320576,0.374919,0.03590695,0.0005210801,0.001851047,0.581989],"study_design_scores_gemma":[0.01508462,0.009828568,0.02685323,0.007330012,0.0002226452,0.001138284,0.00001619418,0.5087835,0.1152999,0.07799886,0.223847,0.0135971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1110914,0.003983811,0.8622942,0.005006817,0.003159691,0.003065645,0.00002785052,0.00009091388,0.0112797],"genre_scores_gemma":[0.9647582,0.0008814957,0.02733599,0.004414591,0.001274666,0.00001938828,0.00006482011,0.0001112965,0.001139582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8536668,"threshold_uncertainty_score":0.9999415,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01310724362208297,"score_gpt":0.2331602010583774,"score_spread":0.2200529574362945,"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."}}