{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":311,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":311,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"1d83937be232","filters":{"topic":"Genome Rearrangement Algorithms"}},"results":[{"id":"W2128591967","doi":"10.1093/bioinformatics/18.3.440","title":"PatternHunter: faster and more sensitive homology search","year":2002,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":863,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bioinformatics Solutions (Canada)","funders":"","keywords":"Computer science; Java; Homology (biology); Genomics; MIT License; Computational biology; Computation; License; Biology; Bioinformatics; Data mining; Algorithm; Genome; Genetics; Operating system; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.01569997354943418,"gpt":0.2324366666156915,"spread":0.2167366930662574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007689703,0.0001159392,0.0001004287,0.00004761077,0.00004861367,0.00002853289,0.00008244366,0.00009835843,0.00004906911],"category_scores_gemma":[0.0000105713,0.0001045519,0.00003386239,0.00004153347,0.00009690647,0.000006085493,0.0001504816,0.00006578237,0.0001170934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007576432,"about_ca_system_score_gemma":0.000005767653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004509628,"about_ca_topic_score_gemma":0.000002570175,"domain_scores_codex":[0.999371,0.00001869275,0.0001619285,0.0001206022,0.0001012539,0.0002265377],"domain_scores_gemma":[0.9996264,0.000005954258,0.00003696228,0.0002100824,0.00004951935,0.0000710594],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001718472,0.0005956846,0.06667341,0.001162692,0.001251715,0.0001643188,0.03549735,0.0002005916,0.2175867,0.0002517019,0.06521757,0.6112264],"study_design_scores_gemma":[0.01253966,0.005318941,0.1300381,0.0002089332,0.000310449,0.003072743,0.02373178,0.2770445,0.2954906,0.00008192672,0.2475483,0.004614041],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9884837,0.0002644184,0.005183738,0.0004446278,0.00009455485,0.0002110694,0.00003686682,0.00001605368,0.005265012],"genre_scores_gemma":[0.9904829,0.0003417295,0.006180048,0.0009150857,0.0001250664,0.000006978489,0.00007551162,0.00001731116,0.001855416],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6066124,"threshold_uncertainty_score":0.4263504,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2235443461","doi":"10.1186/s12864-015-2294-6","title":"Locating rearrangement events in a phylogeny based on highly fragmented assemblies","year":2016,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":553,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Breakpoint; Genome; Biology; Phylogenetics; Phylogenetic tree; Evolutionary biology; Context (archaeology); Phylogenomics; Computational biology; Gene rearrangement; Genome evolution; Inference; Genomics; Genetics; Chromosome; Computer science; Paleontology; Gene; Artificial intelligence; Clade","retraction":null,"screen_n_in":null,"score":{"opus":0.01656397032794648,"gpt":0.2413004322783578,"spread":0.2247364619504113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003140162,0.0002063747,0.0001568841,0.0001240825,0.00004756125,0.00001090228,0.0002535355,0.0001167512,0.00002885467],"category_scores_gemma":[0.00007562689,0.0001683161,0.00008360523,0.0001087781,0.0000293776,0.000003087536,0.0001053863,0.00005433966,0.00008474586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001311053,"about_ca_system_score_gemma":0.0001073324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001918754,"about_ca_topic_score_gemma":0.0001453721,"domain_scores_codex":[0.998646,0.00008678677,0.000273384,0.0004513517,0.0001801592,0.0003623804],"domain_scores_gemma":[0.9992514,0.00002610918,0.0001028113,0.0004963292,0.00004843591,0.0000748667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001233919,0.0001406491,0.03942579,0.00002590393,0.00002287732,0.000001906812,0.00002989546,0.0008806924,0.9556909,0.00001761023,0.0002194039,0.003420942],"study_design_scores_gemma":[0.009622421,0.001329928,0.1828701,0.0002057465,0.00005170664,0.00000471287,0.0002904478,0.002990528,0.7624567,0.0002682867,0.03864045,0.001268917],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9879137,0.0001516163,0.0102715,0.0002088898,0.0001633134,0.0004068662,0.00002218711,0.00001680386,0.0008451199],"genre_scores_gemma":[0.9936315,0.00005742058,0.005098847,0.0002378436,0.0001624791,0.00007905783,0.00005634345,0.00004190743,0.0006345765],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1932342,"threshold_uncertainty_score":0.6863729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125598538","doi":"10.1093/bioinformatics/17.2.149","title":"An information-based sequence distance and its application to whole mitochondrial genome phylogeny","year":2001,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":542,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; City University of Hong Kong","keywords":"Phylogenetics; Sequence (biology); Biology; Genome; Distance matrices in phylogeny; Evolutionary biology; Mitochondrial DNA; Edit distance; Computational biology; Computer science; Genetics; Algorithm; Bioinformatics; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.009646601906384321,"gpt":0.2431462677942042,"spread":0.2334996658878199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000937994,0.0001432954,0.00009994057,0.00006889979,0.0000943647,0.00007113843,0.0002186329,0.00009365513,0.000007206448],"category_scores_gemma":[0.00003224322,0.0001437709,0.00002811747,0.0001528274,0.00002798674,0.00004383499,0.00004806724,0.0000450409,0.0001401819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002567115,"about_ca_system_score_gemma":0.00005501286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004050935,"about_ca_topic_score_gemma":0.0000103562,"domain_scores_codex":[0.9991843,0.00001210944,0.0002849975,0.0001324242,0.0001635715,0.0002226687],"domain_scores_gemma":[0.9992558,0.000004370517,0.0001069515,0.0003517806,0.0001221144,0.0001589556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001317996,0.00007527239,0.001242461,0.0001426217,0.0000339808,0.00000103869,0.0008031449,0.006197969,0.9622129,0.0001931949,0.0004424838,0.02852309],"study_design_scores_gemma":[0.001802876,0.0008425246,0.006725016,0.00002142094,0.00003434105,0.00002499258,0.0004956163,0.188703,0.03610294,0.00005873707,0.7643053,0.0008832723],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4926944,0.0001439707,0.5046146,0.0002354014,0.0001295964,0.00101049,0.00021931,0.00004685433,0.0009053349],"genre_scores_gemma":[0.9703941,0.00005893382,0.02702279,0.0009484094,0.000195755,0.0001065305,0.001156506,0.00001439176,0.0001025398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.92611,"threshold_uncertainty_score":0.5862808,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1491688952","doi":"10.1007/11851561_16","title":"A Unifying View of Genome Rearrangements","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":299,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Concatenation (mathematics); Genome; Computation; Algorithm; Theoretical computer science; Variety (cybernetics); Combinatorics; Mathematics; Genetics; Artificial intelligence; Biology; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.0145501442805102,"gpt":0.2404525168478769,"spread":0.2259023725673667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003702174,0.0003000397,0.0003188846,0.0002697286,0.00006132478,0.00003990441,0.0007674781,0.0002339886,0.00003026161],"category_scores_gemma":[0.00001790325,0.0002921013,0.0001072528,0.0001612069,0.0003737868,0.000005426084,0.000497707,0.0001950931,0.00001127331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006076464,"about_ca_system_score_gemma":0.0001608276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001889799,"about_ca_topic_score_gemma":0.00003358547,"domain_scores_codex":[0.9981253,0.00001597264,0.0003520056,0.0007370019,0.0004227388,0.0003469591],"domain_scores_gemma":[0.9989007,0.00001636472,0.0002023232,0.000672971,0.000148048,0.00005957341],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004051348,0.0001240693,0.0006807428,0.0005104984,0.0001510616,0.00006546071,0.0003061162,0.04570771,0.3243908,0.0003176406,0.0001190151,0.6275864],"study_design_scores_gemma":[0.008014134,0.005770059,0.0105835,0.004357085,0.0004657147,0.0003529474,0.000003918735,0.03817474,0.2621462,0.06168123,0.5977661,0.01068438],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003495875,0.004377739,0.9801647,0.00006675951,0.000473626,0.0005065313,0.00002592597,0.0000165699,0.01087226],"genre_scores_gemma":[0.7652445,0.001360156,0.2235119,0.0009791068,0.00204115,0.00002881777,0.0004158653,0.0002024827,0.006215971],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7617487,"threshold_uncertainty_score":0.9999531,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129978006","doi":"10.1186/1471-2105-9-329","title":"Evaluation of genomic island predictors using a comparative genomics approach","year":2008,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":284,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Canadian Institutes of Health Research; Genome Canada; Michael Smith Health Research BC; Cystic Fibrosis Foundation","keywords":"Genome; Identification (biology); Comparative genomics; Genomics; Computational biology; Precision and recall; Computer science; Sequence (biology); Data mining; Biology; Genetics; Artificial intelligence; Gene; Ecology","retraction":null,"screen_n_in":null,"score":{"opus":0.1005527452698731,"gpt":0.2917008819532804,"spread":0.1911481366834074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005625109,0.0001427954,0.0001855383,0.00007335793,0.00007757403,0.000009155508,0.0001605254,0.0001060337,0.00001513211],"category_scores_gemma":[0.0000283122,0.000135919,0.00007826338,0.00008275979,0.0001139725,0.000008922517,0.00008926752,0.00005152831,0.00001042609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006866021,"about_ca_system_score_gemma":0.00036526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008225478,"about_ca_topic_score_gemma":0.00001091961,"domain_scores_codex":[0.998863,0.00006745775,0.0003827443,0.0001275595,0.0003822313,0.0001770041],"domain_scores_gemma":[0.9991419,0.00000604198,0.0002361695,0.0002935133,0.0002708802,0.00005148127],"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.0002348524,0.0006762795,0.05345631,0.0006661546,0.001289915,8.285951e-7,0.02007513,0.5134171,0.4046077,0.0000558897,0.003124772,0.002395115],"study_design_scores_gemma":[0.001260822,0.0001340355,0.00835692,0.000005453959,0.0001553176,0.00004250646,0.0008964478,0.9764179,0.01167548,0.00001630187,0.0008329764,0.0002058089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8962848,0.0004488592,0.0993044,8.383773e-7,0.00005901685,0.0004822401,0.00004688721,0.000006813159,0.003366181],"genre_scores_gemma":[0.8089316,0.00007856076,0.1904831,0.00001315728,0.0001014884,0.00001460812,0.0003049302,0.0000150333,0.00005747755],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4630008,"threshold_uncertainty_score":0.5542615,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155919888","doi":"10.1186/gb-2003-4-4-r25","title":"Genome-wide detection of segmental duplications and potential assembly errors in the human genome sequence","year":2003,"lang":"en","type":"article","venue":"Genome biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":259,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Hospital for Sick Children","funders":"Canadian Institutes of Health Research; Hospital for Sick Children; Centre de Regulació Genòmica; Genome Canada; Howard Hughes Medical Institute","keywords":"Segmental duplication; Biology; Genome; Human genome; Genetics; Sequence (biology); Whole genome sequencing; Genome evolution; Computational biology; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.01544546196981989,"gpt":0.2594264308709556,"spread":0.2439809689011357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004210719,0.0001714597,0.0001764575,0.0001125666,0.000132053,0.00001337213,0.0002670851,0.0001742253,0.00002441658],"category_scores_gemma":[0.0000344531,0.0001483587,0.0000664541,0.0001684562,0.0002048046,0.00000502973,0.00008537695,0.0001126098,0.000009193765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003634348,"about_ca_system_score_gemma":0.00003865747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003863097,"about_ca_topic_score_gemma":0.00006773294,"domain_scores_codex":[0.9986734,0.0002142143,0.0003029914,0.0004144907,0.0000786584,0.0003161877],"domain_scores_gemma":[0.9993671,0.00001300709,0.0001320675,0.000386181,0.0000509956,0.0000506737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.000007624091,0.00005014052,0.005364575,0.00001009819,0.00003621277,0.000001875216,0.0001258002,0.00004775415,0.99409,0.00009971076,0.000001041785,0.0001651907],"study_design_scores_gemma":[0.001592486,0.001259574,0.8177316,0.000004619755,0.00007905821,0.0001875425,0.001076204,0.00002047075,0.1374292,0.0009054133,0.0390689,0.0006448749],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9956759,0.001284615,0.001906782,0.0000828066,0.00008081443,0.0004209055,0.00004853629,0.000007677883,0.0004919806],"genre_scores_gemma":[0.9986272,0.0002729723,0.0004100889,0.0001107594,0.00007336276,0.00007054822,0.0003008624,0.00001706409,0.0001170696],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8566607,"threshold_uncertainty_score":0.6049893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159640103","doi":"10.1093/bioinformatics/btq216","title":"Next-generation VariationHunter: combinatorial algorithms for transposon insertion discovery","year":2010,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":221,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; Genome British Columbia; National Human Genome Research Institute; Howard Hughes Medical Institute","keywords":"Transposable element; Algorithm; Genome; Computer science; Human genome; Structural variation; Scope (computer science); Computational biology; Biology; Genetics; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.02485141532122126,"gpt":0.2506231169510057,"spread":0.2257717016297844,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000225154,0.0001485966,0.000112701,0.00005356645,0.0001223249,0.0001449385,0.0001550304,0.0001969554,0.00001004317],"category_scores_gemma":[0.00005894599,0.0001437626,0.00009757781,0.00006896388,0.00003207286,0.00005474866,0.00002692516,0.00008631478,0.0000135245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001439396,"about_ca_system_score_gemma":0.00006668355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005654709,"about_ca_topic_score_gemma":0.00002371173,"domain_scores_codex":[0.9991543,0.00001245638,0.0003188709,0.0001527876,0.0001547339,0.0002068474],"domain_scores_gemma":[0.999423,0.000009249713,0.0001196726,0.0002692263,0.0001194893,0.00005932584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005823228,0.00009757836,0.0002227848,0.00006135858,0.00005635305,1.560039e-7,0.0002542739,0.00004919974,0.9820741,0.002122373,0.001522455,0.01348109],"study_design_scores_gemma":[0.007180573,0.001607073,0.002668848,0.00002164735,0.0001683118,0.00002257148,0.0003274245,0.205182,0.5917528,0.001125607,0.1887559,0.001187266],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6862942,0.00004404923,0.3081792,0.0001984591,0.00369103,0.000875853,0.0001296174,0.00003746923,0.0005500991],"genre_scores_gemma":[0.9315189,0.00005906321,0.06319182,0.0001887669,0.001971422,0.0001180525,0.002586899,0.00003286485,0.0003322207],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3903214,"threshold_uncertainty_score":0.586247,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054547415","doi":"10.1089/106652701300099119","title":"Perfect Phylogenetic Networks with Recombination","year":2001,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":216,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Phylogenetic tree; Phylogenetic network; Recombination; Phylogenetics; Tree (set theory); Time complexity; Mathematics; Evolutionary biology; Biology; Combinatorics; Computer science; Genetics; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.007125730998609258,"gpt":0.2408557460107803,"spread":0.2337300150121711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002184243,0.00009129107,0.000130274,0.00008235119,0.0000403404,0.0000106642,0.0001237713,0.00008013881,0.00003122006],"category_scores_gemma":[0.0000235292,0.00007083594,0.00006181233,0.00009773399,0.00005600998,0.000003297789,0.000023306,0.00008441081,0.000004203561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000158552,"about_ca_system_score_gemma":0.00006741132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.503108e-7,"about_ca_topic_score_gemma":0.000002029486,"domain_scores_codex":[0.9993395,0.0000848976,0.0002294191,0.0001188608,0.00009381634,0.0001334858],"domain_scores_gemma":[0.9993204,0.00002888897,0.0002226606,0.00006948215,0.0003076611,0.00005091873],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0009656858,0.0003835708,0.1649445,0.0000135973,0.0007019946,0.00005367761,0.00006641448,0.6868437,0.07161407,0.0006916008,0.002051199,0.07167],"study_design_scores_gemma":[0.01644246,0.02896841,0.7017493,0.0001195874,0.0003440352,0.009834047,0.0002194703,0.04139257,0.008591129,0.02343426,0.167233,0.001671831],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8393068,0.0008592559,0.1589122,0.0003017659,0.0001792857,0.00006899359,0.000001357799,0.000002855345,0.0003675018],"genre_scores_gemma":[0.9909842,0.0002068789,0.008125323,0.0001553042,0.0003726073,0.000002057236,0.00006039335,0.00001042464,0.00008278765],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6454511,"threshold_uncertainty_score":0.2888606,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2625912121","doi":"10.1186/s13059-017-1241-z","title":"Lineage-specific rediploidization is a mechanism to explain time-lags between genome duplication and evolutionary diversification","year":2017,"lang":"en","type":"article","venue":"Genome biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":202,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Fisheries and Oceans Canada; Karl-Franzens-Universität Graz; University of Glasgow; Natural Environment Research Council; Sight Research UK","keywords":"Biology; Lineage (genetic); Evolutionary biology; Adaptive radiation; Phylogenomics; Adaptation (eye); Gene duplication; Genome; Most recent common ancestor; Phylogenetics; Gene; Clade; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.02147720614456652,"gpt":0.2539399552776285,"spread":0.2324627491330619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002804305,0.0001959698,0.0001940239,0.0001171499,0.0004703313,0.00005417875,0.0004361645,0.0002690677,0.00008039884],"category_scores_gemma":[0.00006252249,0.0002114285,0.00004794217,0.0000803135,0.0001122099,0.00001334625,0.0004110254,0.00007155895,0.0002982536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005435329,"about_ca_system_score_gemma":0.00003416077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001386345,"about_ca_topic_score_gemma":0.00000174195,"domain_scores_codex":[0.9986096,0.00006592285,0.000250287,0.0006808539,0.00009298873,0.0003003172],"domain_scores_gemma":[0.998651,0.00001059281,0.0002052032,0.0008151394,0.0001770955,0.0001409489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.00002987049,0.00002096832,0.002820209,0.000007476847,0.00005177976,5.128531e-7,0.0001471202,0.000005172375,0.99432,0.0002010624,0.0003784827,0.002017368],"study_design_scores_gemma":[0.001406247,0.001043318,0.4610514,0.00001090798,0.00008044766,0.00001606546,0.000120759,0.0001222586,0.08010124,0.001803606,0.4533386,0.0009051386],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9620028,0.001186675,0.03325874,0.001684293,0.0001540695,0.0008052183,0.0003396023,0.00003980858,0.0005288582],"genre_scores_gemma":[0.9890466,0.0009241779,0.005545621,0.0001923705,0.0008319491,0.00008300326,0.00220777,0.00003244684,0.001136011],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9142187,"threshold_uncertainty_score":0.8621805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060480089","doi":"10.1186/1471-2164-10-180","title":"Bos taurus genome assembly","year":2009,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":162,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Norges Forskningsråd; Commonwealth Scientific and Industrial Research Organisation; AgResearch; Genome British Columbia; Robert J. Kleberg, Jr. and Helen C. Kleberg Foundation; National Human Genome Research Institute; Agricultural Research Service; Genome Canada; U.S. Department of Agriculture; Cooperative State Research, Education, and Extension Service; National Institutes of Health; U.S. Department of Health and Human Services","keywords":"Sequence assembly; Contig; Genome; Hybrid genome assembly; Biology; Reference genome; Computational biology; Genetics; Whole genome sequencing; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.01463854184932328,"gpt":0.2395022810947722,"spread":0.2248637392454489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001551769,0.0001895911,0.000148939,0.00005047889,0.00007575698,0.00004322021,0.0003083919,0.0001437377,0.00003199952],"category_scores_gemma":[0.00002452268,0.0002024839,0.0001188817,0.00007691946,0.00002693628,0.000002909928,0.00008183186,0.00007403087,0.0001734321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004408934,"about_ca_system_score_gemma":0.0001038415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004728305,"about_ca_topic_score_gemma":0.00001807851,"domain_scores_codex":[0.9988952,0.00003134534,0.0002093931,0.0003837197,0.000117404,0.000362904],"domain_scores_gemma":[0.9992488,0.000004211023,0.00007466765,0.0005007677,0.00005342107,0.0001181188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002938261,0.00005893465,0.0004864053,0.000006550208,0.00002489032,0.000003093147,0.00004221034,0.0003003417,0.9951603,0.00007274264,0.000774567,0.003040588],"study_design_scores_gemma":[0.002108162,0.001161598,0.06111048,0.000006930412,0.00007884866,0.00006997824,0.0002103649,0.0004193697,0.3372943,0.0006580804,0.5956951,0.001186799],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9840627,0.001367563,0.00739494,0.0001335849,0.0001611601,0.0002916678,0.0000197762,0.0000312456,0.006537327],"genre_scores_gemma":[0.9790227,0.0002752006,0.01655815,0.0005837864,0.0006776619,0.00001246874,0.0001947632,0.00003662088,0.002638588],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.657866,"threshold_uncertainty_score":0.8257056,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029036185","doi":"10.1186/1471-2105-10-120","title":"Multichromosomal median and halving problems under different genomic distances","year":2009,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":160,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Genome; Breakpoint; Context (archaeology); Generalization; Time complexity; Biology; Computer science; Computational biology; Genetics; Combinatorics; Mathematics; Chromosome; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.01240274061496869,"gpt":0.2228328514029068,"spread":0.2104301107879381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008472934,0.0001750834,0.0001416279,0.00004120023,0.00008804608,0.00006540868,0.0001427667,0.00009714915,0.00001044881],"category_scores_gemma":[0.0000186652,0.0001446914,0.00004941519,0.0000430122,0.00006487191,0.000009828411,0.00007448885,0.00006269808,0.00001311753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001986063,"about_ca_system_score_gemma":0.00002825234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002126845,"about_ca_topic_score_gemma":0.00005086823,"domain_scores_codex":[0.9991596,0.00001499905,0.0002701907,0.0001534582,0.0001323037,0.0002694041],"domain_scores_gemma":[0.9995227,0.000009060999,0.00009679326,0.000234288,0.00002856883,0.0001085864],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0002318758,0.00088978,0.08284508,0.001991072,0.0005678962,0.000009393403,0.00737513,0.006666874,0.7087854,0.002413608,0.002847321,0.1853766],"study_design_scores_gemma":[0.009566296,0.00294972,0.493551,0.0003183965,0.0002888223,0.0001879558,0.005454137,0.4112294,0.04315278,0.003806083,0.02614071,0.003354642],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9266176,0.001174671,0.0699575,0.0001965251,0.0001393918,0.0004218438,0.0000213694,0.00003332389,0.00143777],"genre_scores_gemma":[0.9463533,0.0003635351,0.05253923,0.0002121186,0.0001446392,0.00001083819,0.0001244981,0.00001474779,0.0002370444],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6656325,"threshold_uncertainty_score":0.5900342,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131148812","doi":"10.1371/journal.pcbi.1000234","title":"A Methodological Framework for the Reconstruction of Contiguous Regions of Ancestral Genomes and Its Application to Mammalian Genomes","year":2008,"lang":"en","type":"article","venue":"PLoS Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Centre National de la Recherche Scientifique; Simon Fraser University; Agence Nationale de la Recherche","keywords":"Genome; Extant taxon; Biology; Evolutionary biology; Computational biology; Convergent evolution; Genomics; Comparative genomics; Genome evolution; Phylogenetics; Gene; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.1149907225639774,"gpt":0.33633754883627,"spread":0.2213468262722926,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001533559,0.00008480569,0.0001777061,0.00004531561,0.00007509357,0.000001918438,0.0001176178,0.0001137122,0.000005139131],"category_scores_gemma":[0.0001470434,0.00006575423,0.00005591362,0.00008053327,0.0001760454,0.000002179454,0.00004597745,0.00004244924,0.000001056398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006005798,"about_ca_system_score_gemma":0.0000363725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003238428,"about_ca_topic_score_gemma":0.000001811751,"domain_scores_codex":[0.9992996,0.00008116947,0.0002225744,0.0002274507,0.00005200162,0.0001171628],"domain_scores_gemma":[0.9992633,0.0002676025,0.0001441035,0.0001085741,0.0001809698,0.00003547068],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0004806634,0.0001988917,0.03497094,0.000121324,0.0005843109,6.855275e-7,0.0004723046,0.007856111,0.840632,0.058088,0.0001024393,0.05649228],"study_design_scores_gemma":[0.004083588,0.007331777,0.3460051,0.00008499058,0.0004063126,0.0006075993,0.0009278418,0.02590662,0.3442108,0.2525667,0.01647452,0.001394198],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6553483,0.001967325,0.3415329,0.0005279701,0.00004838275,0.0004880466,0.00006488851,0.000004943913,0.00001723133],"genre_scores_gemma":[0.8583366,0.0003206486,0.1409633,0.00007679615,0.00009724082,0.00009566194,0.00008748948,0.000006143877,0.00001612015],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4964213,"threshold_uncertainty_score":0.268138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157761435","doi":"10.1016/j.dam.2005.02.033","title":"Advances on sorting by reversals","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":109,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Sorting; Sequence (biology); Mathematics; Time complexity; Computational complexity theory; Genome; Combinatorics; Computational problem; Algorithm; Discrete mathematics; Theoretical computer science; Computer science; Gene; Biology; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.005108295393556165,"gpt":0.2281670594860915,"spread":0.2230587640925354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001224163,0.000167629,0.0001507616,0.00002274742,0.00006614352,0.00002573061,0.0001591807,0.00007917015,0.00002439694],"category_scores_gemma":[0.00001601172,0.000150402,0.00005840221,0.00005948999,0.00004202969,0.000002356275,0.00005851937,0.00005733739,0.00006621376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001082153,"about_ca_system_score_gemma":0.000009087755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002261447,"about_ca_topic_score_gemma":0.000002347731,"domain_scores_codex":[0.9990702,0.000006272262,0.0002410754,0.0002600194,0.0001775651,0.0002448509],"domain_scores_gemma":[0.9994756,0.00001333459,0.0001368219,0.0003166501,0.00001925207,0.0000383379],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001448134,0.0001129143,0.00004903588,0.0000954446,0.00002600648,0.000001067331,0.00004978495,0.0001296401,0.9776293,0.008649105,0.01022475,0.003018453],"study_design_scores_gemma":[0.001147148,0.0002150593,0.00006226824,0.00004890349,0.00006255473,0.000005606801,0.00062736,0.0003557606,0.8534718,0.02349756,0.1197172,0.0007887046],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4867094,0.00138855,0.07131121,0.0002444674,0.0001654511,0.001151823,0.00008842185,0.000131789,0.4388089],"genre_scores_gemma":[0.9464521,0.0001969324,0.04951641,0.0002081985,0.0003431599,0.0001074794,0.000502605,0.00008242336,0.002590677],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4597427,"threshold_uncertainty_score":0.6133216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2810570362","doi":"10.1093/bioinformatics/bty586","title":"Fast characterization of segmental duplications in genome assemblies","year":2018,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"National Institute of General Medical Sciences; National Institutes of Health","keywords":"Genome; Structural variation; Computer science; Sequence assembly; Computational biology; Segmental duplication; Gene duplication; Jaccard index; Biology; Genetics; Artificial intelligence; Pattern recognition (psychology); Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.0101539284658066,"gpt":0.2367411480797236,"spread":0.226587219613917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008201881,0.00006927014,0.00007426847,0.00007391736,0.00002672506,0.0000112649,0.0001122734,0.00005634182,0.00002449434],"category_scores_gemma":[0.00001133513,0.0000692621,0.00002480814,0.0001233106,0.00005911059,0.000008758772,0.00006690378,0.00002236286,0.00004173902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001254922,"about_ca_system_score_gemma":0.00002699686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002163538,"about_ca_topic_score_gemma":0.00000734173,"domain_scores_codex":[0.9994848,0.000007519399,0.0002431959,0.00007001346,0.00008050336,0.0001139901],"domain_scores_gemma":[0.9996065,0.00000166911,0.0001054848,0.000194578,0.00006646597,0.00002529766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000006338793,0.00003645349,0.00259049,0.00002551621,0.00001249057,5.849035e-8,0.0004334335,0.000003741038,0.9945099,0.00003889292,0.00003136827,0.002311338],"study_design_scores_gemma":[0.001103583,0.0006223602,0.2945741,0.00003141913,0.00002135582,0.00001120336,0.001081502,0.005281434,0.6738744,0.00002727487,0.02296554,0.0004058388],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9865226,0.00001710109,0.01050416,0.00003487167,0.00005716723,0.0001890217,0.00004943208,0.000006652791,0.002618957],"genre_scores_gemma":[0.9916752,0.00007475698,0.007141993,0.00006384437,0.000101604,0.00001451725,0.0006480937,0.000008765996,0.0002712565],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3206355,"threshold_uncertainty_score":0.2824427,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4221035067","doi":"10.1186/s13015-022-00210-2","title":"Fast characterization of segmental duplication structure in multiple genome assemblies","year":2022,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":87,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Michael Smith Health Research BC; Canada Foundation for Innovation","keywords":"Computer science; Gene duplication; Characterization (materials science); Genome; Segmental duplication; Computational biology; Data mining; Biology; Genetics; Gene; Materials science","retraction":null,"screen_n_in":null,"score":{"opus":0.01047950850782903,"gpt":0.2527592989903266,"spread":0.2422797904824976,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001730855,0.0001720835,0.0002103252,0.0001609866,0.00009335332,0.000007204369,0.0002746226,0.0001224689,0.00003842956],"category_scores_gemma":[0.00002867071,0.0001940239,0.0001014133,0.000202713,0.00006522267,0.00000456022,0.0002403969,0.00009400321,9.384395e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004909367,"about_ca_system_score_gemma":0.00004880096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001799145,"about_ca_topic_score_gemma":0.00001051754,"domain_scores_codex":[0.9987458,0.0001066981,0.0003147265,0.000444435,0.0001068326,0.000281538],"domain_scores_gemma":[0.9993873,0.00001005059,0.0001840228,0.0003075258,0.00007269258,0.00003839693],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006335419,0.00008536788,0.002767141,0.00001634522,0.00005803211,0.000001211942,0.0000719422,0.0003361809,0.991901,0.0001235013,0.000004889654,0.004570992],"study_design_scores_gemma":[0.002329721,0.001265251,0.01967472,0.000003422845,0.00003211703,0.0000292395,0.0002378197,0.002367385,0.9607378,0.0004592745,0.01243197,0.0004312566],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9365355,0.0002690058,0.06121333,0.00008273902,0.0001732548,0.0007546977,0.0009399884,0.00001031526,0.00002113565],"genre_scores_gemma":[0.9838135,0.00003691716,0.005752482,0.0001235659,0.00007697014,0.0003158589,0.009774067,0.0000359756,0.00007062108],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05546085,"threshold_uncertainty_score":0.7912066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1547622250","doi":"10.1007/3-540-45123-4_20","title":"Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Genome; Sorting; Heuristic; Computer science; Time complexity; Algorithm; Gene rearrangement; Gene; Computational biology; Genetics; Biology; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.008509472042093532,"gpt":0.221017514445064,"spread":0.2125080424029705,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002455346,0.0002484656,0.0002625708,0.0001897455,0.00008324164,0.0000400818,0.0003979525,0.0002022132,0.00006128867],"category_scores_gemma":[0.00001508413,0.0002483982,0.00006123223,0.00009941789,0.0004412643,0.000006815483,0.0002514194,0.0001554221,0.000007210706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004735789,"about_ca_system_score_gemma":0.00009632368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001827916,"about_ca_topic_score_gemma":0.00001868663,"domain_scores_codex":[0.9984534,0.00001825812,0.0003012299,0.0006544178,0.0003079959,0.0002646515],"domain_scores_gemma":[0.9991936,0.00001527413,0.0001355532,0.0004760781,0.00009694956,0.00008250863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004802117,0.0001090346,0.0003512382,0.0001014971,0.0001356623,0.00001378014,0.0003464279,0.002645162,0.7556716,0.00007309538,0.0002484827,0.240256],"study_design_scores_gemma":[0.009605277,0.007293486,0.01165067,0.002111816,0.0005338963,0.0003469124,0.000008449167,0.00870876,0.3503402,0.0472772,0.5542598,0.007863596],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09332209,0.01197719,0.8840691,0.0006519218,0.0006323291,0.001619404,0.0002758975,0.00003830366,0.007413767],"genre_scores_gemma":[0.8967459,0.007816749,0.08694439,0.001539632,0.0006348061,0.00004919004,0.0005893912,0.0001291042,0.005550876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8034238,"threshold_uncertainty_score":0.9999968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022846158","doi":"10.1089/10665270360688129","title":"Tests for Gene Clustering","year":2003,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"National Human Genome Research Institute","keywords":"Genome; Biology; Gene; Gene duplication; Comparative genomics; Horizontal gene transfer; Gene cluster; Genetics; Genomics; Evolutionary biology; Gene family; Computational biology; Genome evolution","retraction":null,"screen_n_in":null,"score":{"opus":0.0198886956447467,"gpt":0.2979448129065418,"spread":0.2780561172617951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000256245,0.00006663587,0.0001102026,0.00005544101,0.00003294445,0.000006967548,0.00008896737,0.00006314879,0.00001145337],"category_scores_gemma":[0.0001303417,0.00005855094,0.00008763651,0.00003485303,0.00002891638,0.00000206583,0.00001634772,0.00003931405,0.000002485147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001087766,"about_ca_system_score_gemma":0.00008585517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.280142e-7,"about_ca_topic_score_gemma":7.05149e-7,"domain_scores_codex":[0.9994662,0.00004472851,0.0002312062,0.00009018776,0.00005328492,0.00011441],"domain_scores_gemma":[0.9994487,0.00004142995,0.0001658038,0.00005233834,0.0002492057,0.00004253494],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000192085,0.0001527977,0.007137284,0.00002682711,0.0003792837,0.000005935929,0.00005063255,0.05767652,0.9196212,0.002238329,0.003101883,0.009417227],"study_design_scores_gemma":[0.01121305,0.007830634,0.02546885,0.00003916196,0.0001530552,0.002642298,0.0001406498,0.004604133,0.1902722,0.0902853,0.6663705,0.0009801615],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5062876,0.0009252855,0.4918031,0.0001820679,0.0004105582,0.0001054366,0.00001143166,0.000002180526,0.0002723591],"genre_scores_gemma":[0.8828136,0.00003101401,0.1165715,0.0001769031,0.0002818019,0.000003235677,0.00003922759,0.000008774494,0.00007388606],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.729349,"threshold_uncertainty_score":0.2387638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107320771","doi":"10.1093/bioinformatics/bts457","title":"ANGES: reconstructing ANcestral GEnomeS maps","year":2012,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":70,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Genome; Extant taxon; Python (programming language); Merge (version control); Biology; Suite; Evolutionary biology; Computer science; Computational biology; Genetics; Geography; Archaeology; Programming language; Information retrieval","retraction":null,"screen_n_in":null,"score":{"opus":0.02167448892732243,"gpt":0.246488476659066,"spread":0.2248139877317435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001921272,0.000127184,0.00009970256,0.00004247711,0.00006831459,0.00002826108,0.0001416521,0.0000927927,0.00003815902],"category_scores_gemma":[0.00003463369,0.0001188137,0.00005916398,0.00007196906,0.00005086446,0.00001725532,0.00008119176,0.00005808839,0.0001218073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001511949,"about_ca_system_score_gemma":0.00002718153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001700072,"about_ca_topic_score_gemma":0.000001316351,"domain_scores_codex":[0.9991887,0.00001233411,0.0002306211,0.00008120059,0.0001088879,0.0003782248],"domain_scores_gemma":[0.9995021,0.000006941365,0.0001047178,0.0002393739,0.00003362699,0.00011322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005293127,0.0002130096,0.5374911,0.0005297133,0.0004282774,0.000002529443,0.003917962,0.00006469828,0.06897915,0.0007369492,0.02404527,0.3635384],"study_design_scores_gemma":[0.001641635,0.0004224023,0.02549787,0.00005014456,0.00008903991,0.000279526,0.006046236,0.001107189,0.07515888,0.0001242654,0.888227,0.001355801],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9695575,0.002805979,0.002080585,0.0000518197,0.001006168,0.0002515994,0.00004939553,0.00004612693,0.02415079],"genre_scores_gemma":[0.8819759,0.0005656312,0.1148683,0.0002272753,0.001230968,0.00001972032,0.0003033488,0.00003241757,0.0007763773],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8641818,"threshold_uncertainty_score":0.4845082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142027180","doi":"10.1093/bioinformatics/bts716","title":"SCARPA: scaffolding reads with practical algorithms","year":2012,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":true},"ca_institutions":"SickKids Foundation; Hospital for Sick Children; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; University of Toronto","keywords":"Scaffold; Contig; Computer science; Algorithm; Heuristic; Process (computing); Genome; Biology; Artificial intelligence; Programming language; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.02160935312870881,"gpt":0.2760012413538531,"spread":0.2543918882251443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000312186,0.0001799331,0.0001345661,0.00005433242,0.00009014289,0.00004593466,0.0001278736,0.0001281717,0.00003230295],"category_scores_gemma":[0.00005146603,0.0001426604,0.00005346392,0.0001258676,0.00007214023,0.00003238073,0.0001172813,0.00008393248,0.0001513639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002454254,"about_ca_system_score_gemma":0.00006431904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000290782,"about_ca_topic_score_gemma":0.000001505551,"domain_scores_codex":[0.9988878,0.00002039553,0.0002386539,0.0001191619,0.0002567584,0.0004772726],"domain_scores_gemma":[0.9992409,0.00001156529,0.0001162926,0.0003617461,0.00007755056,0.0001919206],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001128023,0.003442351,0.2560846,0.001803253,0.003672527,0.00006845351,0.01105585,0.0006894957,0.2239544,0.009257323,0.1997573,0.2890865],"study_design_scores_gemma":[0.00445413,0.002163968,0.01704887,0.0001333246,0.0003904318,0.001431503,0.004736749,0.01209882,0.152272,0.00004550583,0.802722,0.00250263],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7777434,0.001385383,0.1630442,0.0006407886,0.001006252,0.001156317,0.00005233366,0.0001745184,0.05479683],"genre_scores_gemma":[0.6325412,0.0001635761,0.3649725,0.000293688,0.0008176852,0.00003424078,0.0001925581,0.00004952505,0.0009349442],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6029648,"threshold_uncertainty_score":0.5817521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109550992","doi":"10.1093/bioinformatics/bth946","title":"Into the heart of darkness: large-scale clustering of human non-coding DNA","year":2004,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Human genome; Biology; Genome; Computational biology; Conserved sequence; Cluster analysis; Genetics; Gene; Coding region; Computer science; Peptide sequence; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.009885294791323542,"gpt":0.2488597369418888,"spread":0.2389744421505653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002460653,0.00009853231,0.0001434922,0.00003985485,0.00007839649,0.00001096494,0.000214727,0.0000709485,0.000007744926],"category_scores_gemma":[0.00001548003,0.0000758222,0.00008072639,0.00008777041,0.00007506261,0.000007061411,0.0001890763,0.00004849183,0.000006538466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001309059,"about_ca_system_score_gemma":0.00003678253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001830215,"about_ca_topic_score_gemma":0.0000410174,"domain_scores_codex":[0.9992583,0.000008568634,0.0003474792,0.00007454331,0.0001443824,0.0001666739],"domain_scores_gemma":[0.9994085,0.000004318018,0.0001508689,0.0003386747,0.00006562649,0.00003203528],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001584702,0.00009260131,0.0009369761,0.0004692294,0.00007567384,3.219089e-7,0.007953673,0.0007837158,0.9880705,0.0001164336,0.0003058026,0.001179238],"study_design_scores_gemma":[0.001584209,0.0004768419,0.003288626,0.000128884,0.00004275891,0.000008969277,0.004928622,0.003826654,0.9790202,0.0001548264,0.006267874,0.0002715671],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9410316,0.0001294811,0.0550522,0.0001053655,0.0001154744,0.0002693583,0.00001378368,0.000008159042,0.003274516],"genre_scores_gemma":[0.9797614,0.00004144003,0.01993988,0.00007199179,0.00005734717,0.000006231495,0.00004243581,0.00001113345,0.00006809169],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03872978,"threshold_uncertainty_score":0.309194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106532429","doi":"10.1093/bioinformatics/btm422","title":"Multiple spaced seeds for homology search","year":2007,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homology (biology); Exponential function; Heuristic; Algorithm; Computer science; Time complexity; Mathematics; Sensitivity (control systems); Smith–Waterman algorithm; Artificial intelligence; Sequence alignment; Biology; Genetics; Amino acid; Gene; Peptide sequence","retraction":null,"screen_n_in":null,"score":{"opus":0.0187242027563381,"gpt":0.2713849504182895,"spread":0.2526607476619514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004911626,0.0001215182,0.0001120898,0.00007744926,0.00007788214,0.0000183006,0.0001724899,0.000153928,0.00001140461],"category_scores_gemma":[0.00008624225,0.0001156602,0.00008173957,0.00008424645,0.0000588107,0.000004307614,0.00009369968,0.00005556877,0.00005139106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001865609,"about_ca_system_score_gemma":0.00004593379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005311853,"about_ca_topic_score_gemma":0.00002632162,"domain_scores_codex":[0.9991077,0.000008349244,0.0002494045,0.0001179991,0.0001166705,0.0003999172],"domain_scores_gemma":[0.9994282,0.00003049018,0.00005952685,0.0002768317,0.0001104374,0.0000945111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008518297,0.0004243399,0.03317253,0.0008618591,0.0006207796,0.0000118274,0.002937008,0.0004800035,0.773797,0.001263486,0.03354603,0.1520333],"study_design_scores_gemma":[0.004769404,0.001582113,0.01148354,0.00001755886,0.00005557384,0.00007524309,0.002411069,0.01714513,0.4702755,0.0001066636,0.4912348,0.000843395],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5845574,0.0002038807,0.4085564,0.0001523223,0.0003480396,0.0008170143,0.00005544101,0.00003813135,0.005271468],"genre_scores_gemma":[0.8106944,0.00006873452,0.1852781,0.000379498,0.0004279371,0.00003055193,0.000521361,0.00003820159,0.002561254],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4576887,"threshold_uncertainty_score":0.4716487,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045385587","doi":"10.1016/s1476-9271(02)00097-x","title":"Gene teams: a new formalization of gene clusters for comparative genomics","year":2003,"lang":"en","type":"article","venue":"Computational Biology and Chemistry","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":64,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Gene; Comparative genomics; Software; Gene cluster; Computer science; Computational biology; Genetics; Biology; Order (exchange); Genomics; Genome; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01356422615412321,"gpt":0.2681595874631572,"spread":0.2545953613090339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007972494,0.0001039785,0.0001306252,0.00001431973,0.0000539213,0.000005072465,0.00006779369,0.0001258686,0.00001313891],"category_scores_gemma":[0.00002506806,0.0001073622,0.0000457561,0.00003550555,0.00009128029,0.000002474181,0.00002311808,0.00003010283,7.864539e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000120571,"about_ca_system_score_gemma":0.0001211693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000143703,"about_ca_topic_score_gemma":5.595646e-7,"domain_scores_codex":[0.9994413,0.00001741767,0.0001748187,0.0002104741,0.00003375741,0.0001222133],"domain_scores_gemma":[0.9996483,0.00002216796,0.00009798138,0.00008370487,0.00009514479,0.00005263944],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006840166,0.00003813306,0.001559889,0.00004279723,0.000121959,1.291603e-7,0.0001103745,0.004265878,0.9925271,0.0002626216,0.0005143047,0.0004884052],"study_design_scores_gemma":[0.001333488,0.0001325801,0.000461853,0.000004018055,0.00002708307,0.00002590739,0.0001312694,0.001752983,0.9839841,0.003070339,0.008902457,0.0001739924],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8070962,0.001204376,0.1908775,0.0000362187,0.0000470477,0.0001713076,0.00006690629,0.000005120375,0.0004952209],"genre_scores_gemma":[0.9560627,0.00006287763,0.04190424,0.0000848228,0.00009887707,0.00001603144,0.001486699,0.000008501188,0.0002752109],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1489733,"threshold_uncertainty_score":0.4378104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068396445","doi":"10.1089/cmb.2006.13.567","title":"On Sorting by Translocations","year":2006,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Sorting; Chromosomal translocation; Sorting algorithm; Genome; Chromosome; Computer science; Algorithm; Computational biology; Biology; Mathematics; Genetics; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.005620043957935987,"gpt":0.250474535487991,"spread":0.244854491530055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001426249,0.00006529177,0.00009150634,0.00005722681,0.00003967055,0.000007267327,0.00009574612,0.00005892758,0.00002019708],"category_scores_gemma":[0.00002663336,0.00005696198,0.00007155283,0.00004864954,0.00003914852,0.000001991367,0.000008529249,0.00006280567,0.000007396128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001038829,"about_ca_system_score_gemma":0.00005134437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002698818,"about_ca_topic_score_gemma":0.000001284104,"domain_scores_codex":[0.9994162,0.00004293184,0.0002759691,0.00008649193,0.00008115253,0.0000973027],"domain_scores_gemma":[0.9995526,0.00003598839,0.0001862053,0.00004733671,0.0001506302,0.00002720799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001459891,0.0004265773,0.004991642,0.00001027839,0.0001986626,0.000005071773,0.00002974025,0.1067526,0.8171862,0.01400387,0.04533903,0.0109103],"study_design_scores_gemma":[0.01007514,0.008499281,0.05249779,0.00007361763,0.0001750808,0.0007201644,0.0001374691,0.004551077,0.1546614,0.4955339,0.271749,0.001326001],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8617514,0.0007365888,0.1350561,0.0009111433,0.0001729231,0.00005661314,0.00001800573,0.000003459958,0.00129374],"genre_scores_gemma":[0.9941571,0.00001248719,0.005065402,0.0002021869,0.0002673261,0.000001320109,0.0001586531,0.000006696358,0.0001287628],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6625248,"threshold_uncertainty_score":0.2322842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1495473427","doi":"10.1007/978-3-540-27801-6_29","title":"Reversal Distance without Hurdles and Fortresses","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Permutation (music); Fortress (chess); Simple (philosophy); Computer science; Algorithm; Tree (set theory); Value (mathematics); Combinatorics; Mathematics; Discrete mathematics; Artificial intelligence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.008796151040115455,"gpt":0.2313689773336902,"spread":0.2225728262935747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001593447,0.0002767561,0.0002200131,0.0001162988,0.00009221324,0.00008636541,0.0004251552,0.0002022157,0.00001228133],"category_scores_gemma":[0.00002967375,0.0002538725,0.00004828545,0.00006904302,0.000603789,0.000007546402,0.0003746063,0.0001876638,0.000004124522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005362247,"about_ca_system_score_gemma":0.0001861085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001038897,"about_ca_topic_score_gemma":0.0001009869,"domain_scores_codex":[0.9984738,0.000007017994,0.0001749498,0.0007824512,0.0002687164,0.0002930173],"domain_scores_gemma":[0.9992908,0.00001644632,0.00009771233,0.0004445058,0.00007127808,0.00007926529],"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.0001281996,0.0001104085,0.008177266,0.0005591525,0.0001692162,0.0001773886,0.0008826066,0.01947988,0.07051472,0.005610181,0.0001549141,0.8940361],"study_design_scores_gemma":[0.009193013,0.005244101,0.01155491,0.005571961,0.0003553288,0.0008620215,0.000006862424,0.01777826,0.2320254,0.445572,0.2599252,0.01191094],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004308474,0.00344211,0.9894617,0.0001949312,0.0003956677,0.0002912141,0.00001676296,0.00001820086,0.001870923],"genre_scores_gemma":[0.8650429,0.0008989347,0.1313557,0.000515729,0.0007578694,0.000009263435,0.00004942534,0.00005852769,0.001311724],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8821251,"threshold_uncertainty_score":0.9999914,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165336044","doi":"10.1186/1471-2105-11-304","title":"Scaffold filling, contig fusion and comparative gene order inference","year":2010,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genome; Contig; Synteny; Biology; Computational biology; Phylogenetic tree; Comparative genomics; Hybrid genome assembly; DNA microarray; Gene; Genetics; Genomics","retraction":null,"screen_n_in":null,"score":{"opus":0.02726078651022239,"gpt":0.2693409206502985,"spread":0.2420801341400761,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001367166,0.0001482662,0.0001394332,0.00004248015,0.00008668814,0.00005310091,0.0001396681,0.0001434268,0.00004536484],"category_scores_gemma":[0.00005974543,0.0001289141,0.00003255368,0.00007905237,0.0001027387,0.000009812163,0.000152605,0.000102041,0.00004810653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003487766,"about_ca_system_score_gemma":0.0000589538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006547602,"about_ca_topic_score_gemma":0.00009390283,"domain_scores_codex":[0.9993038,0.00001232932,0.0002320326,0.0001352005,0.0001206632,0.0001959362],"domain_scores_gemma":[0.9993814,0.00001558876,0.0001062552,0.0002748448,0.0001305742,0.00009135938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001022082,0.00019717,0.04477524,0.0003001366,0.0001758575,0.000001997583,0.0028711,0.0005427844,0.9280829,0.00136289,0.006346331,0.01524132],"study_design_scores_gemma":[0.005178635,0.001094718,0.04483072,0.00006995969,0.0001275168,0.0001020405,0.002057209,0.3017126,0.3839993,0.0002887277,0.258626,0.001912611],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9388062,0.0001998026,0.05572917,0.00003260403,0.0002413266,0.0003184977,0.0000318365,0.00002257939,0.004617953],"genre_scores_gemma":[0.6563189,0.0002349981,0.3418896,0.0001834029,0.0001699875,0.00001859436,0.0002625776,0.00001336268,0.0009085601],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5440837,"threshold_uncertainty_score":0.5256964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068896404","doi":"10.1109/tcbb.2007.1011","title":"Perfect Sorting by Reversals Is Not Always Difficult","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Université du Québec à Montréal","funders":"","keywords":"Sorting; Pairwise comparison; Simple (philosophy); Computation; Class (philosophy); Time complexity; Computer science; Combinatorics; Permutation (music); Mathematics; Algorithm; Discrete mathematics; Theoretical computer science; Artificial intelligence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01292711891529862,"gpt":0.2704998828774565,"spread":0.2575727639621578,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003209673,0.0001932571,0.0001574225,0.00009594992,0.0002628846,0.00002484303,0.0001528478,0.0002261247,0.00003510289],"category_scores_gemma":[0.0000283364,0.0001735307,0.00008141452,0.0001299638,0.0001382984,0.00001139016,0.00001110421,0.0001547371,0.00003790694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001910852,"about_ca_system_score_gemma":0.00003723266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006369437,"about_ca_topic_score_gemma":0.000005730665,"domain_scores_codex":[0.9989361,0.00002794468,0.0003970185,0.0002281806,0.0001270158,0.0002837332],"domain_scores_gemma":[0.9993618,0.0001036488,0.0001277566,0.0001895638,0.0001202692,0.00009699486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009524017,0.0009939123,0.004952583,0.0003555685,0.001549302,0.000008446837,0.002914995,0.01286491,0.4591749,0.0003753095,0.01704467,0.498813],"study_design_scores_gemma":[0.009832058,0.005669083,0.01274497,0.0001517929,0.0004317039,0.0004428298,0.002834697,0.06167752,0.8020977,0.003706299,0.09695257,0.003458812],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3189594,0.0001241549,0.6793383,0.0005007189,0.0002491762,0.0002245709,0.0002295407,0.00003253334,0.0003416304],"genre_scores_gemma":[0.9555004,0.0001805643,0.04185525,0.001655579,0.00008965353,0.000009467003,0.0003942273,0.00001446926,0.0003004209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.637483,"threshold_uncertainty_score":0.7076376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108998942","doi":"10.1093/bioinformatics/btg1025","title":"Detection and validation of single gene inversions","year":2003,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Computational biology; Gene; Genetics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.01389261929232974,"gpt":0.2126551300325814,"spread":0.1987625107402517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008328168,0.0000475833,0.00004588434,0.0000324911,0.00002905694,0.000007194139,0.00002816946,0.0000499605,0.000006204891],"category_scores_gemma":[0.00004612641,0.00004652615,0.00001863956,0.00005026438,0.00002518628,0.000004546248,0.00002021916,0.00001539198,0.000004523985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005833001,"about_ca_system_score_gemma":0.00001181417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001301627,"about_ca_topic_score_gemma":0.000001195071,"domain_scores_codex":[0.9996942,0.0000110898,0.0001232828,0.00004644424,0.0000577304,0.00006729224],"domain_scores_gemma":[0.9997647,0.000002784556,0.000062308,0.0001046653,0.00003828938,0.00002727064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000003800057,0.00001914303,0.0005697735,0.00002942838,0.0000155184,5.416691e-8,0.0001043577,0.00002728838,0.9960832,0.00002605051,0.00007189199,0.003049518],"study_design_scores_gemma":[0.0002362469,0.0001334839,0.0002679209,0.000002819904,0.00001038968,0.00000706944,0.0001575978,0.0003005249,0.9916534,0.00003301568,0.00713889,0.00005861568],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9775115,0.00009614995,0.01983516,0.000007009563,0.00006511732,0.00009832517,0.000005088885,0.00000488806,0.002376794],"genre_scores_gemma":[0.9829342,0.00007328147,0.01684025,0.00002116097,0.00001388816,0.000002282609,0.00002566421,0.000004459134,0.00008481773],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007066998,"threshold_uncertainty_score":0.1897282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2003921372","doi":"10.1089/cmb.2005.12.812","title":"Chromosomal Breakpoint Reuse in Genome Sequence Rearrangement","year":2005,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Breakpoint; Genome; Biology; Computational biology; Sequence (biology); Genetics; Identification (biology); Gene; Reuse; Computer science; Chromosome","retraction":null,"screen_n_in":null,"score":{"opus":0.01606047862208839,"gpt":0.2841884439062238,"spread":0.2681279652841354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003881768,0.0001131454,0.0001828041,0.0001484906,0.00002590251,0.00001061017,0.0003190193,0.00009488298,0.00006107488],"category_scores_gemma":[0.00007371444,0.0001022578,0.00008930333,0.00009542904,0.00007024338,0.00000801391,0.0001065932,0.0001233711,0.00002262037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007023803,"about_ca_system_score_gemma":0.0001353856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000407545,"about_ca_topic_score_gemma":0.00001006682,"domain_scores_codex":[0.998946,0.00009314562,0.0004659198,0.0001662381,0.0001352311,0.000193531],"domain_scores_gemma":[0.9993089,0.00002272528,0.0002456901,0.0001563602,0.0001972484,0.00006911594],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001610849,0.0001974242,0.005282579,0.00001054766,0.0001245722,0.00002998872,0.0001456166,0.04762824,0.9365019,0.0002972392,0.0007970422,0.008823771],"study_design_scores_gemma":[0.01164157,0.006157984,0.2575446,0.0001129868,0.00009496191,0.003005149,0.0002220705,0.004573222,0.03579548,0.01986405,0.659637,0.001350906],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9930198,0.0009922354,0.003449901,0.001944291,0.0001818171,0.0001008307,0.0000181453,0.000003314719,0.0002896459],"genre_scores_gemma":[0.9742996,0.0001583763,0.02436478,0.0003665425,0.0006155935,0.000003431303,0.00009132839,0.00001077662,0.0000895772],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9007064,"threshold_uncertainty_score":0.4169953,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156841116","doi":"","title":"Quadratic Binary Programming Models in Computational Biology","year":2008,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Heuristics; Solver; Quadratic equation; Linearization; Quadratic programming; Binary number; Computer science; Mathematical optimization; Mathematics; Applied mathematics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.08857950310823591,"gpt":0.376263285187368,"spread":0.2876837820791321,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006703459,0.0001326946,0.0001403865,0.0003456532,0.0003750526,0.00003967611,0.0002768842,0.0001380344,0.0000404647],"category_scores_gemma":[0.00008187629,0.000134203,0.00004732134,0.0005427008,0.0002794078,0.00001723451,0.0001840205,0.0002634804,0.00007736741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006192633,"about_ca_system_score_gemma":0.0003784755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002532796,"about_ca_topic_score_gemma":0.0001521977,"domain_scores_codex":[0.9981796,0.0003051177,0.0002854585,0.000449388,0.0002955605,0.0004848479],"domain_scores_gemma":[0.9992237,0.00003420695,0.00001350112,0.0003030789,0.0003347333,0.00009074996],"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.00009285207,0.001579286,0.008348989,0.00006206506,0.0002142797,0.000158583,0.002370486,0.7480882,0.1872521,0.007568147,0.002349522,0.04191549],"study_design_scores_gemma":[0.002255029,0.001200208,0.005471899,0.00002836993,0.0000071336,0.0001739425,0.0007356458,0.9762401,0.003003439,0.002318706,0.007971901,0.0005936439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9556969,0.00100263,0.04063311,0.0007373152,0.00009192924,0.0009535961,0.00002269751,0.00002392393,0.0008378724],"genre_scores_gemma":[0.9465602,0.0002703623,0.05113759,0.00004082101,0.0001782599,0.0003075144,0.0005235353,0.00002556064,0.0009561751],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2281519,"threshold_uncertainty_score":0.5472641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159070430","doi":"10.1186/1471-2105-12-s9-s2","title":"Evolution of orthologous tandemly arrayed gene clusters","year":2011,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":48,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bombardier (Canada); Université de Montréal","funders":"","keywords":"DNA microarray; Genetics; Biology; Computational biology; Gene; Evolutionary biology; Gene expression","retraction":null,"screen_n_in":null,"score":{"opus":0.02189532596483341,"gpt":0.2186958185145383,"spread":0.1968004925497049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001829734,0.0001238507,0.0001320408,0.00006629164,0.00003623409,0.000005824692,0.0001835191,0.0001349361,0.00003757906],"category_scores_gemma":[0.00003696432,0.0001140105,0.00008716347,0.00009567574,0.00008742521,0.000007186913,0.00009290682,0.00004702069,0.00004887588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002117305,"about_ca_system_score_gemma":0.00007858512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001172348,"about_ca_topic_score_gemma":0.00001736308,"domain_scores_codex":[0.9991936,0.00002100035,0.0003448132,0.000108106,0.0001304542,0.0002019987],"domain_scores_gemma":[0.9993235,0.000003829415,0.0001870784,0.0003398878,0.00008731524,0.00005840598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001354129,0.001275816,0.3103547,0.002036054,0.001052042,0.00001340106,0.01106496,0.003352656,0.6294373,0.00205247,0.009634345,0.02837218],"study_design_scores_gemma":[0.008552311,0.004347986,0.2003116,0.0001151582,0.0004362098,0.0003084943,0.007542001,0.08244801,0.6733769,0.00118331,0.01892314,0.00245492],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5280354,0.0002619285,0.4604918,0.000004788099,0.0002364771,0.000339328,0.00003153991,0.00002688718,0.01057183],"genre_scores_gemma":[0.7077473,0.00007155851,0.2916323,0.00004985501,0.00006975533,0.00001155695,0.00009501062,0.000017263,0.0003054778],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1797119,"threshold_uncertainty_score":0.4649211,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997093937","doi":"10.1186/1471-2164-15-s6-s12","title":"Orthology and paralogy constraints: satisfiability and consistency","year":2014,"lang":"en","type":"article","venue":"BMC Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Consistency (knowledge bases); Tree (set theory); Biology; Set (abstract data type); Synteny; Constraint (computer-aided design); Mathematics; Combinatorics; Similarity (geometry); Satisfiability; Phylogenetic tree; Computational biology; Gene; Algorithm; Discrete mathematics; Genetics; Computer science; Artificial intelligence; Genome","retraction":null,"screen_n_in":null,"score":{"opus":0.01180959494031022,"gpt":0.2272902938370588,"spread":0.2154806988967485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002819705,0.0001245267,0.0001604871,0.00002441701,0.00006258774,0.00001663779,0.00006852557,0.0001299704,0.00001924137],"category_scores_gemma":[0.0001009702,0.0001274113,0.00002930864,0.00002096941,0.0005004454,0.000001674068,0.0001285014,0.00005298116,0.000007377711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007748209,"about_ca_system_score_gemma":0.00004857091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001126215,"about_ca_topic_score_gemma":0.0001451464,"domain_scores_codex":[0.9991358,0.00009658089,0.0001742515,0.0003566416,0.00003663985,0.0002000847],"domain_scores_gemma":[0.9995222,0.00003181673,0.00005443819,0.0002695116,0.00003530032,0.00008674734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00006404356,0.00005541683,0.6245857,0.0001096398,0.00007746469,0.000002410212,0.0002072549,0.00002294594,0.3263195,0.003330622,0.0002731199,0.04495189],"study_design_scores_gemma":[0.004433546,0.001291388,0.8747751,0.00001157551,0.0001435157,0.0005730679,0.0007045126,0.0007956512,0.01679789,0.008353179,0.09096147,0.001159162],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.991173,0.0007148877,0.006329738,0.00009267386,0.00008439476,0.0001774746,0.00001581659,0.000009175918,0.001402845],"genre_scores_gemma":[0.9866517,0.0002339994,0.01266783,0.0002115324,0.00008758279,0.00001085758,0.00003590871,0.00001365883,0.00008697502],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3095216,"threshold_uncertainty_score":0.5195682,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051551591","doi":"10.1089/cmb.2006.13.1340","title":"On the Similarity of Sets of Permutations and Its Applications to Genome Comparison","year":2006,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Genome; Chaining; Similarity (geometry); Generalization; Key (lock); Feature (linguistics); Computer science; Combinatorics; Mathematics; Computational biology; Theoretical computer science; Biology; Gene; Genetics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01775467834541102,"gpt":0.3016380343992673,"spread":0.2838833560538563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000195618,0.00006233054,0.0001466078,0.00007686241,0.00003899713,0.000003555011,0.0001211091,0.00004947882,0.00001129736],"category_scores_gemma":[0.00005114616,0.00004635369,0.00005274508,0.00008545511,0.00006087818,0.000001925239,0.00003532901,0.00005820471,0.000001736196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006233918,"about_ca_system_score_gemma":0.00005129375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002527581,"about_ca_topic_score_gemma":0.000002635558,"domain_scores_codex":[0.9993432,0.00006141484,0.0003493196,0.00008395379,0.00009241202,0.00006973503],"domain_scores_gemma":[0.9991332,0.0001298686,0.0002898675,0.00006715939,0.000350849,0.00002907273],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001614136,0.000505545,0.009614994,0.00004397031,0.0002597053,8.18556e-7,0.0001785131,0.1897452,0.7445208,0.05178453,0.001418964,0.001765483],"study_design_scores_gemma":[0.003130956,0.005330883,0.6939421,0.00005092832,0.0002163908,0.0001696528,0.0004241987,0.007104199,0.09669778,0.1525014,0.03983404,0.0005973901],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9580363,0.0005953928,0.03994491,0.0009441396,0.00002829286,0.0001674006,0.00006217216,9.897753e-7,0.0002203828],"genre_scores_gemma":[0.9966179,0.00001626547,0.003108792,0.000103531,0.00006680335,0.000005424617,0.00006263322,0.000004270581,0.0000143834],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6843271,"threshold_uncertainty_score":0.1890249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2737931494","doi":"10.1186/s12920-017-0279-9","title":"Secure approximation of edit distance on genomic data","year":2017,"lang":"en","type":"article","venue":"BMC Medical Genomics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":47,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Zayed University","keywords":"Edit distance; Plaintext; Computer science; Similarity (geometry); String (physics); Set (abstract data type); Intersection (aeronautics); Metric (unit); Sequence (biology); Algorithm; Domain (mathematical analysis); Approximation algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Encryption; Image (mathematics); Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.03924657293843731,"gpt":0.2989500247440331,"spread":0.2597034518055958,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005106101,0.0001296581,0.0001669638,0.00002168748,0.0001145689,0.00003070501,0.001447369,0.0001831537,0.00006233341],"category_scores_gemma":[0.0006042371,0.0001216013,0.00005108248,0.00001662895,0.0001768694,0.000005429528,0.0006951806,0.0001034074,0.00003393425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002184521,"about_ca_system_score_gemma":0.0003242098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009630128,"about_ca_topic_score_gemma":0.0001043164,"domain_scores_codex":[0.9988022,0.00003752267,0.0002522682,0.0004069848,0.0003024638,0.0001985382],"domain_scores_gemma":[0.9977087,0.00002101437,0.0002331065,0.001861629,0.00004066354,0.0001348941],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001335746,0.001430043,0.04564323,0.001509243,0.000758615,0.00004064493,0.0005407024,0.0006259996,0.7392786,0.00888247,0.05532511,0.1446296],"study_design_scores_gemma":[0.007870466,0.001191987,0.06766063,0.0002848575,0.0002072852,0.00004805027,0.000324067,0.04089158,0.08658893,0.002122776,0.791104,0.001705435],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9290714,0.0007371784,0.06414726,0.0004111444,0.0008358856,0.000410979,0.0002895594,0.00001329685,0.004083258],"genre_scores_gemma":[0.9812599,0.0007879956,0.01435117,0.0001680028,0.00168133,0.00001423447,0.001098184,0.00004033144,0.0005988347],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7357788,"threshold_uncertainty_score":0.4958759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000519643","doi":"10.1093/bioinformatics/btm024","title":"A simulation test bed for hypotheses of genome evolution","year":2007,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":45,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Australian Research Council; Genome Atlantic","keywords":"Computer science; Component (thermodynamics); Genetic algorithm; Genome; Software; Horizontal gene transfer; Data mining; Biology; Evolutionary biology; Gene; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.01796171863817917,"gpt":0.2607667618664911,"spread":0.2428050432283119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002720334,0.00008051265,0.00008654838,0.00006214818,0.00004133598,0.000007384665,0.00008951061,0.0000839397,0.000005402859],"category_scores_gemma":[0.0002914949,0.00007722672,0.00006106464,0.0000725975,0.00003186276,0.000005639437,0.0000313051,0.00001904061,0.000007063867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002094348,"about_ca_system_score_gemma":0.00002930252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001909467,"about_ca_topic_score_gemma":0.000004404438,"domain_scores_codex":[0.9993731,0.000003308376,0.0002907394,0.00006908108,0.00009918738,0.0001645974],"domain_scores_gemma":[0.9994465,0.00006383203,0.0001434912,0.0001728068,0.0001370288,0.00003640487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001540404,0.0002100962,0.005620487,0.0004393502,0.0001129391,3.045675e-7,0.0006303777,0.01411321,0.9642633,0.0002691463,0.0001920524,0.01399473],"study_design_scores_gemma":[0.006350389,0.004479855,0.1039544,0.00008676223,0.000238665,0.0000134021,0.002791175,0.344657,0.4198433,0.001102849,0.1149754,0.001506824],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3242886,0.0001822182,0.6736597,0.00001200419,0.00007545482,0.0005088034,0.00007373741,0.00001397925,0.001185402],"genre_scores_gemma":[0.9573331,0.00001052154,0.04220675,0.00002721766,0.0001059369,0.000006571574,0.0001382136,0.00001057039,0.0001610942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6330445,"threshold_uncertainty_score":0.3149214,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1918663757","doi":"10.1186/1471-2105-13-s19-s4","title":"A flexible ancestral genome reconstruction method based on gapped adjacencies","year":2012,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Synteny; Genome; Phylogenetic tree; Biology; Tree (set theory); Adjacency list; Extant taxon; Phylogenetics; Set (abstract data type); Phylogenetic network; Computational biology; Data mining; Evolutionary biology; Genetics; Computer science; Gene; Algorithm; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.03127776710068318,"gpt":0.2812242696022704,"spread":0.2499465025015872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004152756,0.0001786053,0.0001417485,0.00009139184,0.00008542031,0.00003347581,0.0001523712,0.0001404042,0.00006824919],"category_scores_gemma":[0.00005363462,0.0001624437,0.00009925073,0.0001330377,0.00005156755,0.00001975893,0.00004678405,0.00008473382,0.0001219304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000322141,"about_ca_system_score_gemma":0.00008144281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002752608,"about_ca_topic_score_gemma":0.000002672029,"domain_scores_codex":[0.9989549,0.00004575231,0.0002865242,0.0001279935,0.0001807609,0.0004041051],"domain_scores_gemma":[0.9993072,0.00001622556,0.0001404115,0.0003545512,0.00005246616,0.0001291689],"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.001412851,0.001706471,0.1392049,0.002972733,0.0007031027,0.00000316518,0.003903763,0.07645114,0.3708958,0.001790671,0.01054959,0.3904057],"study_design_scores_gemma":[0.005283564,0.002096249,0.05260368,0.000137344,0.0002104883,0.0002293732,0.003537259,0.4701693,0.2404488,0.0001693261,0.222696,0.002418492],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1128142,0.000438706,0.864792,0.00006826858,0.0007717769,0.0006131931,0.00006730798,0.00009362641,0.02034093],"genre_scores_gemma":[0.08897645,0.00006176248,0.9091092,0.0003458018,0.0004594454,0.00003943766,0.0002356736,0.00002783133,0.0007444305],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3937182,"threshold_uncertainty_score":0.662426,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012661148","doi":"10.1145/1798596.1798598","title":"An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Cycle basis; Combinatorics; Permutation (music); Hamiltonian path; Eulerian path; Set (abstract data type); Recursion (computer science); Discrete mathematics; Directed graph; Graph; Algorithm; Lagrangian; Computer science; Pure mathematics; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01335900375409101,"gpt":0.279052694683911,"spread":0.26569369092982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002058132,0.0001739139,0.0001307189,0.00007034304,0.0002871278,0.00003041679,0.0006298171,0.0001493688,0.00007083928],"category_scores_gemma":[0.00002098081,0.0001482335,0.0001406296,0.0001549245,0.0001156818,0.00002179917,0.000008446247,0.0001823483,0.000007347158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009039606,"about_ca_system_score_gemma":0.0000681164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007998425,"about_ca_topic_score_gemma":0.0002567083,"domain_scores_codex":[0.9989853,0.00003959058,0.0002028277,0.000359477,0.0001669577,0.0002458515],"domain_scores_gemma":[0.9984941,0.00006379013,0.00007288498,0.001103744,0.0001468905,0.000118588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001288363,0.0005728822,0.00003082782,0.00001361459,0.0001753427,0.000001282852,0.0004136819,0.00489992,0.7948488,0.0001787769,0.0001208064,0.1986152],"study_design_scores_gemma":[0.003652107,0.003179076,0.001600194,0.0000105155,0.0003421878,0.00004364421,0.003087934,0.02871901,0.901488,0.001397594,0.05569243,0.0007873089],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4239958,0.00004548696,0.5732768,0.0005453539,0.0005728403,0.0007331449,0.0006075092,0.00004626764,0.0001768485],"genre_scores_gemma":[0.9611092,0.00005953931,0.03783332,0.000189322,0.0002198012,0.0001551648,0.0001993575,0.00004592017,0.0001884226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5371134,"threshold_uncertainty_score":0.6044788,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045149392","doi":"10.1109/tcbb.2007.1075","title":"Removing Noise and Ambiguities from Comparative Maps in Rearrangement Analysis","year":2007,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Genome; Clique; Computer science; STRIPS; Computational biology; Data mining; Algorithm; Mathematics; Biology; Combinatorics; Genetics; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.02053758222045991,"gpt":0.2881267461036641,"spread":0.2675891638832041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002896602,0.0001559133,0.0002101691,0.0002339587,0.0001264012,0.00002438353,0.00009463099,0.0001362467,0.00001706836],"category_scores_gemma":[0.000009681422,0.0001466102,0.00007090541,0.0002251564,0.0001627235,0.00001187557,0.0000126637,0.0001168688,0.000005792804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002011397,"about_ca_system_score_gemma":0.00002186767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006521721,"about_ca_topic_score_gemma":0.0003148332,"domain_scores_codex":[0.9991102,0.0000429121,0.0003508985,0.0002118961,0.00009341798,0.0001907152],"domain_scores_gemma":[0.9995041,0.0001263813,0.00008758004,0.0001554826,0.00006046715,0.00006596216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.003237848,0.002025952,0.1581901,0.0004466271,0.01470926,0.00004264146,0.0244481,0.2418056,0.1008075,0.001605717,0.001117807,0.4515628],"study_design_scores_gemma":[0.01233817,0.003489386,0.7067286,0.0001959038,0.001948481,0.00008743069,0.01810527,0.1818331,0.04134618,0.01879102,0.01190783,0.003228678],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6464933,0.0002129088,0.3524838,0.000123975,0.00009071393,0.0001494396,0.0001671588,0.00001073509,0.0002678952],"genre_scores_gemma":[0.9426934,0.0001808242,0.05630517,0.0002257201,0.0000399631,0.000007962461,0.0004826238,0.000005211269,0.00005909716],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5485384,"threshold_uncertainty_score":0.597859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109028614","doi":"10.1093/bioinformatics/btp600","title":"Ancestors 1.0: a web server for ancestral sequence reconstruction","year":2009,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université du Québec à Montréal","funders":"","keywords":"Synteny; Inference; Computer science; Indel; Genome; Context (archaeology); Sequence (biology); Web server; Biology; Computational biology; Artificial intelligence; The Internet; Genetics; World Wide Web; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.0301068154565614,"gpt":0.2728592275455003,"spread":0.2427524120889389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001188278,0.0001134876,0.00009410379,0.00003583685,0.00006397141,0.00002992428,0.0001312424,0.00009428737,0.000007934121],"category_scores_gemma":[0.00002792042,0.0001083041,0.00006901017,0.0000757665,0.00003874844,0.00001682098,0.00001475778,0.00003874595,0.00001458645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002061712,"about_ca_system_score_gemma":0.0000713604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.874361e-7,"about_ca_topic_score_gemma":0.000004583802,"domain_scores_codex":[0.9993486,0.000006520721,0.00021826,0.0001172811,0.00009080331,0.0002185713],"domain_scores_gemma":[0.9995695,0.000003296788,0.0001030406,0.0002043355,0.00006210753,0.00005770229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001777417,0.0001277634,0.00535898,0.0002882262,0.00012934,0.000002131531,0.0004450738,0.0004677919,0.3055432,0.0008804376,0.01245872,0.6741206],"study_design_scores_gemma":[0.009188114,0.007247868,0.02168076,0.0002683308,0.0002158845,0.0006045551,0.001892378,0.09226634,0.3318251,0.004080085,0.5274303,0.003300289],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.989648,0.0001918158,0.006592888,0.0002001485,0.000389228,0.0004606845,0.00005422052,0.00003872082,0.002424269],"genre_scores_gemma":[0.8978003,0.0002518808,0.10037,0.000429024,0.0003571458,0.00002608671,0.0001993237,0.00001257397,0.000553605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6708204,"threshold_uncertainty_score":0.4416514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156923845","doi":"10.1093/bioinformatics/btn146","title":"Guided genome halving: hardness, heuristics and the history of the Hemiascomycetes","year":2008,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Canada Research Chairs","keywords":"Genome; Ancestor; Heuristics; Computer science; Event (particle physics); Genome evolution; Heuristic; Biology; Evolutionary biology; Computational biology; Genetics; Gene; Artificial intelligence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01873438663246386,"gpt":0.2011657683524296,"spread":0.1824313817199657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002173474,0.000121024,0.0001495068,0.00002072736,0.00009615393,0.000007450863,0.0003089509,0.0000732191,0.000009945221],"category_scores_gemma":[0.0001476332,0.00007071679,0.00008977245,0.00005213173,0.0006020422,0.000004591343,0.0002475285,0.00007143019,0.000005170099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003530145,"about_ca_system_score_gemma":0.0001360175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009417969,"about_ca_topic_score_gemma":0.000001616943,"domain_scores_codex":[0.9992376,0.00003149244,0.0003163452,0.00008591053,0.0001742629,0.0001543875],"domain_scores_gemma":[0.9991925,0.000016789,0.0001941551,0.0004739988,0.0000858456,0.00003675767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005071972,0.000456035,0.0473452,0.00217299,0.001545904,0.00001398112,0.03236815,0.0006102201,0.2297671,0.004984159,0.6721352,0.008093805],"study_design_scores_gemma":[0.004496999,0.0001608202,0.0209322,0.00004168945,0.0001525057,0.000286234,0.0006772723,0.006485169,0.01332061,0.0002273591,0.9526491,0.0005700146],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9318854,0.02120781,0.004393684,0.001109432,0.002432516,0.001576098,0.00008205777,0.00004726432,0.03726578],"genre_scores_gemma":[0.975642,0.002808633,0.009267862,0.0007933566,0.0002102185,0.00002465503,0.00005219569,0.00003136987,0.01116967],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2805139,"threshold_uncertainty_score":0.2883747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110628507","doi":"10.1093/bioinformatics/18.suppl_2.s54","title":"Common intervals and sorting by reversals: a marriage of necessity","year":2002,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Sorting; Computer science; Econometrics; Psychology; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01491994499858541,"gpt":0.2365341103447076,"spread":0.2216141653461222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001665944,0.00008850551,0.0001305053,0.00002433044,0.00003354035,0.00001625665,0.000109291,0.00007290824,0.00003816395],"category_scores_gemma":[0.00004675396,0.00008264268,0.00003787992,0.00004521081,0.00005260525,0.000007419681,0.0001263516,0.00004220989,0.000009212468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005294591,"about_ca_system_score_gemma":0.00000371246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007144971,"about_ca_topic_score_gemma":0.000003113329,"domain_scores_codex":[0.9993933,0.00001742522,0.0002931208,0.00007538983,0.00008922449,0.000131568],"domain_scores_gemma":[0.999555,0.000007813128,0.0001739124,0.0001879245,0.00002803022,0.0000473545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006026268,0.0003543959,0.046992,0.001622133,0.0004251942,0.000003981964,0.004859855,0.00002058395,0.4925123,0.00008736616,0.1479315,0.3051304],"study_design_scores_gemma":[0.006487629,0.002391803,0.007108728,0.0006436516,0.0002836751,0.0001061619,0.004832604,0.08319234,0.6569391,0.0004061601,0.2354883,0.002119816],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9898382,0.002036787,0.00232028,0.0001094991,0.00006343333,0.0001872052,0.00004932311,0.00001295789,0.005382259],"genre_scores_gemma":[0.9893255,0.0008936005,0.008958167,0.000167748,0.00003489896,0.000004157864,0.00005975058,0.00001094312,0.0005451871],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3030106,"threshold_uncertainty_score":0.337007,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030381931","doi":"10.1145/332306.332563","title":"Early eukaryote evolution based on mitochondrial gene order breakpoints","year":2000,"lang":"en","type":"article","venue":"","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Medical Research Council Canada","keywords":"Eukaryote; Breakpoint; Phylogenetic tree; Genome; Biology; Phylogenetics; Gene; Evolutionary biology; Computational biology; Genetics; Mitochondrial DNA","retraction":null,"screen_n_in":null,"score":{"opus":0.00465035779064313,"gpt":0.2059913545361761,"spread":0.201340996745533,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006252786,0.0001570071,0.00009803633,0.00004611102,0.00006305382,0.00002331069,0.0001485443,0.0001353994,0.001715026],"category_scores_gemma":[0.00001545568,0.0001454602,0.00007874469,0.0001188818,0.00003244661,0.000002792855,0.00002212657,0.00006308098,0.0006128996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002584929,"about_ca_system_score_gemma":0.00005526003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006995108,"about_ca_topic_score_gemma":0.00001144003,"domain_scores_codex":[0.9989902,0.00004483345,0.0001473868,0.0003698742,0.0001867102,0.0002609629],"domain_scores_gemma":[0.9994279,0.000004379744,0.00002684347,0.0003932173,0.0000635201,0.00008415605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00052611,0.0002565445,0.001466763,0.000006962202,0.00006832464,0.000007905666,0.00001843476,0.001916561,0.96935,0.00003759213,0.006781985,0.01956278],"study_design_scores_gemma":[0.01315365,0.004521552,0.1410255,0.00004373575,0.0001300723,0.00003775532,0.00002987327,0.01368305,0.6035271,0.0004153131,0.2213513,0.002081161],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9593735,0.00008500626,0.01078615,0.0002864773,0.0002672337,0.0003279496,0.00002026455,0.00004214856,0.0288113],"genre_scores_gemma":[0.9685116,0.00002691322,0.01120908,0.0005605261,0.0007475492,0.00003101773,0.0002046097,0.00003972307,0.01866898],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.365823,"threshold_uncertainty_score":0.9991975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1485855914","doi":"10.1007/978-3-540-74126-8_26","title":"Algorithms for the Extraction of Synteny Blocks from Comparative Maps","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Synteny; Computer science; Extraction (chemistry); Computational biology; Biology; Chemistry; Chromatography; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.04088240414809526,"gpt":0.3036998917927222,"spread":0.262817487644627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004467052,0.0002657937,0.0002832476,0.0001428085,0.0001094072,0.00004245148,0.0006892378,0.0002645009,0.00001826024],"category_scores_gemma":[0.00003495784,0.0002020261,0.0001300015,0.00009802409,0.0005145302,0.000005768325,0.0002233501,0.0002422128,0.000003269516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004736462,"about_ca_system_score_gemma":0.0001261377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003999847,"about_ca_topic_score_gemma":0.0001193122,"domain_scores_codex":[0.9984226,0.00001143541,0.0003047758,0.0006415224,0.0003398376,0.0002798313],"domain_scores_gemma":[0.9986614,0.0002604361,0.0002365193,0.0005460675,0.0002463913,0.00004918755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001669185,0.000101449,0.0001205791,0.00005580589,0.0003016983,0.00001209194,0.0008412543,0.02210491,0.1362211,0.0003037685,0.0003580251,0.8394125],"study_design_scores_gemma":[0.002393641,0.001970938,0.001294929,0.00056892,0.000275142,0.00008086111,0.00001557071,0.1970479,0.6385965,0.04084923,0.1147398,0.002166577],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007929186,0.002107656,0.9946771,0.0001040663,0.0008570084,0.0005697075,0.00008589672,0.000007853978,0.00079782],"genre_scores_gemma":[0.4536124,0.0005177149,0.5390263,0.0008041878,0.003608212,0.0000574875,0.0003968431,0.00009126791,0.001885542],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8372459,"threshold_uncertainty_score":0.8238384,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2520464109","doi":"10.1093/bioinformatics/btw597","title":"BOSS: a novel scaffolding algorithm based on an optimized scaffold graph","year":2016,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"National Outstanding Youth Science Fund Project of National Natural Science Foundation of China; National Natural Science Foundation of China","keywords":"Boss; Scaffold; Computer science; Contig; Algorithm; Graph; Theoretical computer science; Genome; Database; Engineering; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.01423703169381154,"gpt":0.2406790377023678,"spread":0.2264420060085562,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000351511,0.0002736492,0.0002026338,0.0001643793,0.0001133389,0.00006614591,0.0003552778,0.0001854533,0.00005646318],"category_scores_gemma":[0.00005531526,0.0001960415,0.0001467116,0.0001556295,0.00008493907,0.00002378164,0.00009051754,0.00004701662,0.00008506131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003617818,"about_ca_system_score_gemma":0.00008028825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003669115,"about_ca_topic_score_gemma":0.000001591967,"domain_scores_codex":[0.998565,0.0000263896,0.0003822008,0.0002704384,0.0003187491,0.0004372742],"domain_scores_gemma":[0.9988241,0.00002216652,0.0001627208,0.000689161,0.0001034214,0.0001984592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000421066,0.001115382,0.0006939019,0.00017063,0.0003438146,0.000009639845,0.0003307979,0.002520065,0.5404956,0.0003613061,0.007522448,0.4460153],"study_design_scores_gemma":[0.02493139,0.005011867,0.001724171,0.0004964143,0.0002058728,0.00006653381,0.0007416149,0.4953823,0.3728111,0.0002027493,0.09521796,0.003207958],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07581653,0.00008942605,0.9179114,0.0003307593,0.0004448229,0.0006891969,0.0002352205,0.000128685,0.004353915],"genre_scores_gemma":[0.179425,0.0001629379,0.8172947,0.001269091,0.0004806463,0.00008517815,0.0003455947,0.0000958216,0.0008409825],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4928623,"threshold_uncertainty_score":0.7994341,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2369729543","doi":"10.1089/cmb.2010.0092","title":"Yeast Ancestral Genome Reconstructions: The Possibilities of Computational Methods II","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Genome; Yeast; Biology; Computational biology; Evolutionary biology; Genetics; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.0171202863078199,"gpt":0.3258122984228377,"spread":0.3086920121150178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667657,0.0001028977,0.0001897214,0.00009531112,0.0001083276,0.00001111147,0.0002573186,0.0001031957,0.00008317684],"category_scores_gemma":[0.0001274834,0.00007420869,0.0001476469,0.00009451482,0.0004006017,0.00000811241,0.00007139796,0.0002050732,0.000002437064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009520005,"about_ca_system_score_gemma":0.0002464128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003482874,"about_ca_topic_score_gemma":0.000003123155,"domain_scores_codex":[0.9989531,0.0001607021,0.0005013099,0.0001322751,0.0001223109,0.0001303018],"domain_scores_gemma":[0.9987287,0.0001112273,0.0004602667,0.0001133717,0.0005375447,0.00004891071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001780364,0.0002006346,0.005301461,0.00002410574,0.0005609993,0.000001709815,0.00035593,0.05903865,0.897699,0.008680503,0.0004794748,0.02747952],"study_design_scores_gemma":[0.005239018,0.005342685,0.2899276,0.00004737085,0.0002290143,0.004209063,0.00148087,0.004848118,0.05094313,0.5505681,0.08618023,0.000984806],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9531656,0.0004526774,0.04483038,0.0005229912,0.0006832316,0.00008747362,0.00005838923,0.000002737759,0.0001965377],"genre_scores_gemma":[0.7790822,0.00002295665,0.220258,0.00007770301,0.0004180592,0.000002260345,0.0000725726,0.000006851925,0.00005936595],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8467559,"threshold_uncertainty_score":0.3026143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049045223","doi":"10.1016/j.jda.2005.06.005","title":"Strictly chordal graphs are leaf powers","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Interval graph; Block graph; Closeness; Tree (set theory); Graph; Adjacency list; Discrete mathematics; Computer science; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.00895923626441606,"gpt":0.2502875828235165,"spread":0.2413283465591004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003830241,0.0002403209,0.0003022703,0.0001820708,0.00008076623,0.00005647807,0.0004394797,0.0001532505,0.00008779672],"category_scores_gemma":[0.00006928981,0.0002040038,0.0003551213,0.0002019475,0.00008149978,0.00002293551,0.00009715795,0.0002582685,0.00002600105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004392808,"about_ca_system_score_gemma":0.00008769181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005355664,"about_ca_topic_score_gemma":0.00001004653,"domain_scores_codex":[0.9983104,0.00006645351,0.0005362526,0.0002520157,0.000453359,0.0003815416],"domain_scores_gemma":[0.9986573,0.00001109302,0.0005239501,0.0003136289,0.0002586175,0.0002354519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008872907,0.001176943,0.02719348,0.0001174731,0.002964722,0.0003857553,0.0008566653,0.003258029,0.6013764,0.000250811,0.1125914,0.2489411],"study_design_scores_gemma":[0.00762733,0.003749162,0.03023441,0.0001456483,0.0003920446,0.001050951,0.001844431,0.0008734778,0.1370557,0.0005699955,0.8149166,0.00154035],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9631898,0.0115444,0.01548905,0.003100295,0.001330878,0.0003897776,0.00009934067,0.00002765925,0.004828736],"genre_scores_gemma":[0.9652036,0.001850397,0.02863082,0.0005164928,0.00235103,0.000005571851,0.00004077568,0.0000684592,0.001332811],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7023251,"threshold_uncertainty_score":0.8319035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1566359724","doi":"10.1007/978-3-540-87361-7_3","title":"Decompositions of Multiple Breakpoint Graphs and Rapid Exact Solutions to the Median Problem","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":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Breakpoint; Computer science; Speedup; Combinatorics; Vertex (graph theory); Matching (statistics); Genome; Class (philosophy); Graph; Algorithm; Theoretical computer science; Mathematics; Biology; Parallel computing; Artificial intelligence; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.01295613860787456,"gpt":0.2234872268379559,"spread":0.2105310882300814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002590895,0.0002100141,0.0001888802,0.0002192289,0.0002057386,0.00003271999,0.0005111865,0.0001411504,0.000008034641],"category_scores_gemma":[0.00003017842,0.0001628291,0.00007780646,0.0001590666,0.000476694,0.000005040284,0.0004702457,0.0001754104,0.000003928166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003281332,"about_ca_system_score_gemma":0.0001366776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003362332,"about_ca_topic_score_gemma":0.0004097485,"domain_scores_codex":[0.9986855,0.00002003927,0.0002289289,0.0005304183,0.0002477887,0.0002872923],"domain_scores_gemma":[0.9991297,0.00005880063,0.00009535186,0.0004949385,0.0001217429,0.0000995047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004891939,0.0001610278,0.000619191,0.0001145049,0.0001766959,0.00002703746,0.002710402,0.03153994,0.1513265,0.0007013627,0.001261627,0.8113127],"study_design_scores_gemma":[0.008738092,0.01161919,0.02765519,0.003272162,0.0005265855,0.003268206,0.00002174385,0.1552,0.3515679,0.1971219,0.2304697,0.01053938],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005232162,0.002291705,0.9866392,0.00340471,0.000389963,0.0009640007,0.00007192211,0.00001917661,0.0009871569],"genre_scores_gemma":[0.822578,0.001044964,0.1751253,0.0006645126,0.0002755671,0.00003361435,0.00007095806,0.00003696417,0.0001701688],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8173458,"threshold_uncertainty_score":0.6639978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972818612","doi":"10.1186/1471-2105-12-s1-s4","title":"On the PATHGROUPS approach to rapid small phylogeny","year":2011,"lang":"en","type":"article","venue":"BMC Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; Université de Montréal; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Simulated annealing; Computer science; Genome; Phylogenetics; Set (abstract data type); Computational biology; Sequence (biology); Greedy algorithm; DNA microarray; Data mining; Algorithm; Biology; Theoretical computer science; Artificial intelligence; Gene; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.05217310429469563,"gpt":0.2072953049219841,"spread":0.1551222006272885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002931305,0.0001701867,0.0001061548,0.00004711814,0.00008580407,0.00002697524,0.000411978,0.0001037255,0.00004172574],"category_scores_gemma":[0.000070836,0.0001138225,0.00009120659,0.000113925,0.00004570342,0.000002714524,0.0001614899,0.00008057275,0.0002864516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001053608,"about_ca_system_score_gemma":0.00003366489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003874872,"about_ca_topic_score_gemma":0.000004017591,"domain_scores_codex":[0.9991598,0.00003228635,0.0002356159,0.0001534595,0.0001386383,0.0002801794],"domain_scores_gemma":[0.9991581,0.00001268865,0.00007821574,0.0006068096,0.00004811975,0.00009605671],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002553421,0.007282067,0.01504904,0.002817939,0.002666941,0.00001492242,0.06945101,0.004084663,0.2141533,0.1332138,0.2571622,0.2915508],"study_design_scores_gemma":[0.008661446,0.0114788,0.06887636,0.0002085275,0.0004657216,0.0002091769,0.02256178,0.1243071,0.3673806,0.005082326,0.3837307,0.007037471],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.356473,0.0002181044,0.3506904,0.00007334653,0.0003698566,0.001691819,0.00005779436,0.00006603323,0.2903596],"genre_scores_gemma":[0.4812584,0.00008238487,0.5130135,0.003384949,0.0003069548,0.0002107105,0.0001832759,0.0000652971,0.001494436],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2888652,"threshold_uncertainty_score":0.4641546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999792620","doi":"10.1016/s0022-0000(02)00003-x","title":"Reconstructing an ancestral genome using minimum segments duplications and reversals","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Gene duplication; Genome; Ancestor; Phylogenetic tree; Gene; Biology; Genome evolution; Substring; Genetics; Segmental duplication; Evolutionary biology; Gene family; Computational biology; Computer science; Data structure","retraction":null,"screen_n_in":null,"score":{"opus":0.05013380049442868,"gpt":0.2731117117269388,"spread":0.2229779112325101,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003861145,0.00006233621,0.0001136646,0.0000608789,0.0001487984,0.00009165458,0.0001208864,0.00002869197,0.000002354268],"category_scores_gemma":[0.000003162332,0.00004990711,0.0000245304,0.00006776772,0.00009887543,0.00002459119,0.0000372217,0.00003188637,3.023424e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007793144,"about_ca_system_score_gemma":0.00001627122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002289051,"about_ca_topic_score_gemma":3.98956e-7,"domain_scores_codex":[0.9993696,0.0000447551,0.0002248451,0.0001390455,0.0001131841,0.000108547],"domain_scores_gemma":[0.9995989,0.000006737144,0.0001923227,0.00006518301,0.00005891333,0.00007800615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002584718,0.0001547616,0.1850485,0.0002994221,0.000276673,0.0000389004,0.002444931,0.002874704,0.7541775,0.0002017349,0.0002961592,0.05416088],"study_design_scores_gemma":[0.00627573,0.008990629,0.120863,0.001176375,0.0003804766,0.03068231,0.015638,0.7938352,0.01335698,0.0002895449,0.006332752,0.002179089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9917207,0.00141553,0.006446409,0.00003949561,0.0001798933,0.00005197111,0.000001719963,0.00000198239,0.000142304],"genre_scores_gemma":[0.9556499,0.0001013397,0.04395919,0.00001813335,0.0002517888,3.152096e-7,3.58549e-7,0.000002599286,0.000016438],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7909604,"threshold_uncertainty_score":0.2035153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113127959","doi":"10.1093/bioinformatics/btr461","title":"Reconstructing the architecture of the ancestral amniote genome","year":2011,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Amniote; Genome; Biology; Vertebrate; Evolutionary biology; Extant taxon; Phylogenomics; Genomics; Most recent common ancestor; Ancestor; Python (programming language); Context (archaeology); Phylogenetics; Genetics; Computer science; Gene; Paleontology; Clade; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.0208824269888712,"gpt":0.2081342793576129,"spread":0.1872518523687418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001484771,0.00008972945,0.00007416779,0.0000157606,0.00008002407,0.000009351912,0.0003772861,0.0000605621,0.00002085157],"category_scores_gemma":[0.00003128756,0.0000430506,0.00008364896,0.00008316513,0.0001570535,0.000003169671,0.00013891,0.00008654865,0.000006270373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004805935,"about_ca_system_score_gemma":0.00003931464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007501683,"about_ca_topic_score_gemma":0.000006545617,"domain_scores_codex":[0.9994308,0.00002089208,0.0002224003,0.00006602241,0.0001013067,0.0001586021],"domain_scores_gemma":[0.9993692,0.000005010214,0.0001676569,0.0003975479,0.00003598907,0.00002460423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000217089,0.0002490015,0.09920374,0.0009224696,0.001175016,0.000003223771,0.03605448,0.0009622052,0.5490372,0.001668925,0.002229001,0.3082777],"study_design_scores_gemma":[0.00237431,0.0009933835,0.1679903,0.0001422802,0.0002528623,0.0004653043,0.009625424,0.003179921,0.6608431,0.002558167,0.1501662,0.001408685],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9815723,0.000196505,0.00303967,0.0001270766,0.0003107304,0.0003396696,0.00002945099,0.000009965013,0.01437464],"genre_scores_gemma":[0.9688665,0.00005990535,0.03041089,0.0001619486,0.0001329798,0.000006988416,0.00001297941,0.0000122048,0.0003355808],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.306869,"threshold_uncertainty_score":0.1755553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1844928675","doi":"10.1186/1471-2148-4-3","title":"A scale invariant clustering of genes on human chromosome 7","year":2004,"lang":"en","type":"article","venue":"BMC Evolutionary Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ottawa Regional Cancer Foundation","funders":"","keywords":"Biology; Genetics; Chromosome; Gene; Gene duplication; Evolutionary biology","retraction":null,"screen_n_in":null,"score":{"opus":0.0260886649224955,"gpt":0.2761915056756228,"spread":0.2501028407531273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001063234,0.000139089,0.0001603926,0.00007651463,0.00008163181,0.000002923889,0.0001952289,0.0001708814,0.00004316657],"category_scores_gemma":[0.00001874383,0.0001185446,0.00009014168,0.00007816192,0.0001586145,0.000002454613,0.000159586,0.00005491213,0.00003182475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004058389,"about_ca_system_score_gemma":0.00008753224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005963687,"about_ca_topic_score_gemma":0.0001021002,"domain_scores_codex":[0.9990759,0.00006050657,0.0002258278,0.0003337386,0.00006995286,0.0002340389],"domain_scores_gemma":[0.9994853,0.000007619754,0.00008772648,0.0003144703,0.00005352493,0.00005132687],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004855181,0.0001317592,0.01341009,0.00002439675,0.00003537742,0.000001387996,0.00001852549,0.001194421,0.9840379,0.0006784697,0.00008208277,0.0003370768],"study_design_scores_gemma":[0.007297286,0.00714266,0.3115505,0.0001358554,0.00008406079,0.0002484105,0.0002175607,0.0004319287,0.6337242,0.00890918,0.02892279,0.001335602],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9876474,0.001084877,0.009631612,0.0001037578,0.0001851857,0.0002255934,0.00005130382,0.00001872357,0.001051537],"genre_scores_gemma":[0.9901544,0.00007542084,0.008809315,0.00006889893,0.0002969489,0.00003042965,0.0003129679,0.00001703736,0.0002345233],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3503137,"threshold_uncertainty_score":0.483411,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}