{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001425893,0.00161698,0.002426494,0.002615399,0.001354718,0.003190273,0.004036628,0.001873448,0.01242812],"category_scores_gemma":[0.006516403,0.0009680123,0.001463957,0.003564966,0.00120752,0.005494267,0.004513793,0.00358213,0.003791139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001577561,"about_ca_system_score_gemma":0.002359794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003456377,"about_ca_topic_score_gemma":0.005003827,"domain_scores_codex":[0.9976565,0.0002938405,0.0001376709,0.0007274135,0.0009670801,0.0002174154],"domain_scores_gemma":[0.996507,0.001661749,0.0001905262,0.0007439539,0.00061763,0.0002791249],"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.0007387693,0.0003284039,0.001201158,0.0004812176,0.00016353,0.0001813708,0.0003197941,0.06341115,0.01992285,0.07332149,0.01808486,0.8218454],"study_design_scores_gemma":[0.0005084284,0.0003120217,0.000872475,0.00004819549,0.0001269378,0.0005098424,0.0002146648,0.8084107,0.01558793,0.1504939,0.02281318,0.0001017636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006274716,0.0002332008,0.9895594,0.0001963388,0.00009730457,0.0001020383,0.0002065966,0.001769889,0.001560524],"genre_scores_gemma":[0.03632014,0.00009955899,0.9594067,0.0000797276,0.0000740918,0.0001913027,0.0008399783,0.0003384846,0.002650061],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01242812,"threshold_uncertainty_score":0.04157615,"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."}}