{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005939782,0.001818755,0.003065259,0.002991069,0.001540723,0.003227256,0.005641181,0.003580861,0.008307002],"category_scores_gemma":[0.04130908,0.001372675,0.001774333,0.004640024,0.002420823,0.008641298,0.004179453,0.00371,0.001198629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001943901,"about_ca_system_score_gemma":0.001569338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007156958,"about_ca_topic_score_gemma":0.006187384,"domain_scores_codex":[0.9980257,0.0007966843,0.0001072992,0.000373543,0.000404146,0.0002926841],"domain_scores_gemma":[0.9631005,0.03164052,0.0008564828,0.002518388,0.001104946,0.0007792461],"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.0006556296,0.0001447755,0.00311379,0.0001380315,0.00007536874,0.0000834466,0.0001620072,0.8801674,0.001103565,0.03931117,0.003203706,0.07184112],"study_design_scores_gemma":[0.0000217678,0.00002029989,0.0002017339,0.000010347,0.00001100338,0.00002073974,0.00002207307,0.9629416,0.0002863541,0.03628029,0.0001751493,0.000008623651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2098691,0.001858505,0.7723017,0.0009906042,0.0002201123,0.0001976653,0.0006790906,0.002734343,0.01114891],"genre_scores_gemma":[0.6435611,0.001029171,0.3478055,0.0002843258,0.0002729254,0.0002951635,0.001486416,0.0008551101,0.004410399],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008307002,"threshold_uncertainty_score":0.03141296,"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."}}