{"id":"W1603144785","doi":"10.1016/j.tcs.2009.09.008","title":"A new linear time algorithm to compute the genomic distance via the double cut and join distance","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"Bundesministerium für Bildung und Forschung; Alexander von Humboldt-Stiftung","keywords":"Join (topology); Algorithm; Edit distance; Simple (philosophy); Computer science; Time complexity; Genome; Tree (set theory); Mathematics; Combinatorics; Biology; Genetics","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":[],"consensus_categories":[],"category_scores_codex":[0.000655079,0.000191304,0.0001538755,0.00003008409,0.0003998814,0.000186216,0.001112358,0.000044736,0.00001815652],"category_scores_gemma":[0.00001192728,0.000113812,0.00005178953,0.0003513922,0.001079267,0.0000103661,0.0005036612,0.0001295386,0.00006555853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002399731,"about_ca_system_score_gemma":0.0000712475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000453783,"about_ca_topic_score_gemma":0.000002290844,"domain_scores_codex":[0.9984016,0.00005530371,0.0001873158,0.0005738956,0.0003219464,0.0004599246],"domain_scores_gemma":[0.9989237,0.00003062169,0.00004640972,0.0006843881,0.00007663733,0.0002382473],"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.0002489899,0.0001317006,0.00006968416,0.000009968219,0.00004932802,0.00001519539,0.001075032,0.001309629,0.1644535,0.2198555,0.003245937,0.6095356],"study_design_scores_gemma":[0.002579788,0.002530795,0.01071635,0.00006973212,0.00007100099,0.0002381806,0.0000339953,0.7986152,0.05214871,0.05356565,0.07795575,0.001474852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03669362,0.0002926909,0.9579825,0.003919294,0.0001498883,0.0003849361,0.000005057766,0.00002369781,0.0005483337],"genre_scores_gemma":[0.870883,0.00003163172,0.1256284,0.002381452,0.0007026976,0.00000723913,0.000006397434,0.00001581404,0.0003433555],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8341894,"threshold_uncertainty_score":0.4641121,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005246742315466484,"score_gpt":0.2288864844595042,"score_spread":0.2236397421440377,"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."}}