{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Bin Ma","is_ca":true},{"name":"John Tromp","is_ca":false},{"name":"Ming Li","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002589194,0.001804202,0.001803046,0.002475907,0.0007260529,0.002285083,0.004231278,0.001864945,0.02422095],"category_scores_gemma":[0.008742313,0.001458435,0.001150891,0.003531544,0.0007448728,0.006533345,0.002874873,0.00252515,0.01386889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006994978,"about_ca_system_score_gemma":0.0008581387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001448689,"about_ca_topic_score_gemma":0.001239993,"domain_scores_codex":[0.9968233,0.0004431556,0.0002811415,0.001074928,0.001180503,0.0001969789],"domain_scores_gemma":[0.9952891,0.00199407,0.0004999339,0.001365484,0.0005805859,0.0002708641],"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.001902246,0.0003199568,0.003060652,0.001088748,0.0002525536,0.0007380217,0.0002898324,0.007305022,0.143637,0.01297818,0.1038861,0.7245418],"study_design_scores_gemma":[0.0010767,0.0005488943,0.004375508,0.000203727,0.0002282802,0.003768919,0.0001401783,0.3795803,0.3611255,0.04492577,0.2036527,0.0003735303],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0138689,0.0008828208,0.8430136,0.00060516,0.0002386149,0.0002750325,0.002723312,0.1346194,0.003773148],"genre_scores_gemma":[0.04977658,0.0004830402,0.92336,0.0005832842,0.0001426495,0.0004113441,0.007873977,0.01042836,0.006940819],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02422095,"threshold_uncertainty_score":0.08102715,"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","authors":[{"name":"Chunfang Zheng","is_ca":true},{"name":"David Sankoff","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001445031,0.0004063352,0.0004479235,0.001178208,0.0006008366,0.0007238374,0.00101047,0.0008764894,0.001754509],"category_scores_gemma":[0.01077556,0.0005005622,0.0006784743,0.001059598,0.000916483,0.0009907915,0.0008300146,0.0008200869,0.0003322804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009359412,"about_ca_system_score_gemma":0.0005938154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00259254,"about_ca_topic_score_gemma":0.002787238,"domain_scores_codex":[0.9993856,0.0002055842,0.00003293041,0.000153337,0.0001498864,0.00007274858],"domain_scores_gemma":[0.99411,0.004090148,0.0006104296,0.0004737452,0.0005099081,0.0002057115],"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.0003223227,0.0000610363,0.02858658,0.0001036456,0.00008428401,0.000247655,0.0004386978,0.9356567,0.02010747,0.003670966,0.00018368,0.01053681],"study_design_scores_gemma":[0.00001722674,0.0001336617,0.01057926,0.00002787786,0.00004164606,0.0001410051,0.0001226322,0.9766598,0.00676989,0.00496084,0.0005232338,0.00002295995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8197863,0.0001307083,0.1781367,0.00009230896,0.00001048778,0.00006830353,0.0003614978,0.0004319997,0.0009816409],"genre_scores_gemma":[0.8504303,0.0001016074,0.147503,0.00003750361,0.000006177215,0.00009127909,0.001269434,0.0001673486,0.0003932432],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00259254,"threshold_uncertainty_score":0.00764209,"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","authors":[{"name":"Ming Li","is_ca":true},{"name":"Jonathan H. Badger","is_ca":true},{"name":"Xin Chen","is_ca":false},{"name":"Sam Kwong","is_ca":false},{"name":"Paul Kearney","is_ca":true},{"name":"Haoyong Zhang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002348432,0.0006479538,0.00061299,0.003895644,0.0008934652,0.001860047,0.0015234,0.001212225,0.002734197],"category_scores_gemma":[0.02084346,0.0003499538,0.0007375583,0.004545152,0.00159407,0.003575162,0.002826079,0.001921539,0.0008351328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001471614,"about_ca_system_score_gemma":0.001480407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001218242,"about_ca_topic_score_gemma":0.001192133,"domain_scores_codex":[0.9985313,0.0004682345,0.0001147781,0.0003374636,0.000474567,0.00007358803],"domain_scores_gemma":[0.9892484,0.007612381,0.0009012698,0.0007398419,0.001154596,0.0003433778],"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.0002506724,0.0001213497,0.007961324,0.0006089273,0.0001217823,0.0003974965,0.000506155,0.3486495,0.009097769,0.3029218,0.005748019,0.3236152],"study_design_scores_gemma":[0.00002988538,0.000101003,0.002474571,0.00007038544,0.00002655755,0.0005368614,0.00008712811,0.6953413,0.00508429,0.2873219,0.008865397,0.00006069282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01681398,0.0005238733,0.9795128,0.0003802373,0.00004093696,0.00003729853,0.0003381378,0.0005370465,0.001815704],"genre_scores_gemma":[0.2317331,0.0007497746,0.7638285,0.0001552754,0.00016505,0.0001599009,0.001247023,0.0002835426,0.001677846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003895644,"threshold_uncertainty_score":0.01241988,"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","authors":[{"name":"Anne Bergeron","is_ca":true},{"name":"Julia Mixtacki","is_ca":false},{"name":"Jens Stoye","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008942262,0.000894101,0.001044025,0.002321258,0.001598581,0.004496584,0.00337236,0.002320558,0.01171618],"category_scores_gemma":[0.002284787,0.0006513622,0.001545923,0.003031526,0.004089199,0.01205848,0.002692571,0.003375294,0.0023378],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001052158,"about_ca_system_score_gemma":0.0006228345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001941691,"about_ca_topic_score_gemma":0.001715017,"domain_scores_codex":[0.9992834,0.0001804054,0.00004098884,0.00019727,0.0002232403,0.00007476273],"domain_scores_gemma":[0.9992102,0.000391398,0.00005156911,0.0002185054,0.00007313571,0.00005505777],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005409169,0.000002787396,0.00004820882,0.00002141527,0.00000257957,0.00002158437,0.00008617116,0.002406912,0.0002434923,0.9834208,0.001292483,0.01244819],"study_design_scores_gemma":[0.000002916962,0.00000295116,0.00003196406,0.000008244686,0.000003609656,0.0000472931,0.00002608607,0.006757229,0.0001010104,0.9828965,0.01011835,0.000003774876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006472968,0.004801626,0.9321098,0.003154769,0.0003799869,0.00003970115,0.000282178,0.0005391497,0.05221984],"genre_scores_gemma":[0.3031867,0.0152183,0.6196992,0.002506594,0.002440717,0.0004307767,0.001511079,0.0009610719,0.05404553],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01171618,"threshold_uncertainty_score":0.03919452,"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","authors":[{"name":"Morgan G. I. Langille","is_ca":true},{"name":"William Hsiao","is_ca":true},{"name":"Fiona S. L. Brinkman","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004061918,0.001647651,0.001285349,0.008217617,0.0008646502,0.001370175,0.001652753,0.00123739,0.001370705],"category_scores_gemma":[0.008389838,0.0002884758,0.001549123,0.004666429,0.0006320661,0.001141125,0.001106536,0.0009564342,0.0007149166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001499909,"about_ca_system_score_gemma":0.001364026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008481373,"about_ca_topic_score_gemma":0.008542989,"domain_scores_codex":[0.9970708,0.0006620733,0.000237309,0.001094773,0.0007389534,0.0001959789],"domain_scores_gemma":[0.9932696,0.00420435,0.0004086827,0.0004237937,0.001431328,0.0002621278],"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.003917016,0.001381098,0.2529938,0.003007123,0.002968899,0.0009948784,0.0005008436,0.2418046,0.1171924,0.00299275,0.01265522,0.3595913],"study_design_scores_gemma":[0.0001092355,0.00121841,0.06775353,0.0001037016,0.0003992261,0.0007512395,0.0004301939,0.8779494,0.04390789,0.002129226,0.00516249,0.0000853983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.8952181,0.002816512,0.07617,0.0002653895,0.00009512185,0.0003539,0.01676781,0.005530246,0.002783019],"genre_scores_gemma":[0.8021508,0.0004432451,0.1491155,0.0001333867,0.00005729689,0.0003201273,0.04691589,0.0002730598,0.0005906391],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.008481373,"threshold_uncertainty_score":0.02148175,"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","authors":[{"name":"Joseph Cheung","is_ca":true},{"name":"Xavier Estivill","is_ca":true},{"name":"Razi Khaja","is_ca":true},{"name":"Jeffrey R. MacDonald","is_ca":true},{"name":"Ken S. Lau","is_ca":true},{"name":"Lap‐Chee Tsui","is_ca":true},{"name":"Stephen W. Scherer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132317,0.0003104172,0.000466221,0.0009308986,0.0002996315,0.0005536854,0.0003516708,0.0006025284,0.0009365281],"category_scores_gemma":[0.0044022,0.0002379418,0.0003421771,0.0008890337,0.0002430004,0.0003225875,0.0004512721,0.0005140334,0.000371849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003466487,"about_ca_system_score_gemma":0.0003743918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001123311,"about_ca_topic_score_gemma":0.002416275,"domain_scores_codex":[0.999162,0.0002222211,0.00007196444,0.000264495,0.0002276179,0.00005178676],"domain_scores_gemma":[0.9985604,0.0007505332,0.0002902667,0.0001544551,0.0001911679,0.00005329068],"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.002307115,0.0003053433,0.323794,0.001378803,0.000978015,0.001398426,0.0008950107,0.0331441,0.4638338,0.002480839,0.003593165,0.1658914],"study_design_scores_gemma":[0.0001830438,0.0008530652,0.514744,0.0001192588,0.001037598,0.005142218,0.0004032413,0.1686057,0.295362,0.003664652,0.009807469,0.00007770184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9810597,0.0009713148,0.01602682,0.0001582265,0.00001370772,0.00003090505,0.0006796777,0.0004264872,0.0006331485],"genre_scores_gemma":[0.9610797,0.0004260031,0.033713,0.00007958197,0.00002265159,0.00003113667,0.004211749,0.0000559613,0.000380239],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001132317,"threshold_uncertainty_score":0.0059883,"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","authors":[{"name":"Fereydoun Hormozdiari","is_ca":true},{"name":"Iman Hajirasouliha","is_ca":true},{"name":"Phuong Dao","is_ca":true},{"name":"Faraz Hach","is_ca":true},{"name":"Deniz Yörükoğlu","is_ca":true},{"name":"Can Alkan","is_ca":true},{"name":"Evan E. Eichler","is_ca":true},{"name":"S. Cenk Şahinalp","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002240058,0.001366737,0.001155644,0.001643991,0.0007545757,0.001326283,0.002949261,0.001692116,0.007899821],"category_scores_gemma":[0.008525358,0.000602495,0.001297047,0.002222667,0.0008961478,0.001393827,0.001363453,0.0020668,0.001499459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009269212,"about_ca_system_score_gemma":0.001656858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003560397,"about_ca_topic_score_gemma":0.004431118,"domain_scores_codex":[0.9989127,0.0004318581,0.00006118237,0.000250875,0.0002594671,0.00008385703],"domain_scores_gemma":[0.9953716,0.003734129,0.0002420106,0.0002643063,0.0002734724,0.0001143895],"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.0004931901,0.0002452904,0.003360318,0.0004622463,0.0002542602,0.0002474687,0.0001170488,0.6269032,0.003015629,0.02060449,0.01525601,0.3290408],"study_design_scores_gemma":[0.00007902255,0.00003092237,0.0001418372,0.00001421243,0.00001979979,0.00005773303,0.000009832466,0.9824899,0.001066787,0.01372971,0.002348365,0.00001183969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01249596,0.0006318695,0.9779158,0.0004894799,0.0001005611,0.0001588792,0.0005444766,0.005494369,0.002168444],"genre_scores_gemma":[0.1045551,0.0002151735,0.890883,0.0003665894,0.00008799665,0.0003697463,0.001315772,0.0007758319,0.001430813],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007899821,"threshold_uncertainty_score":0.02642751,"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","authors":[{"name":"Lusheng Wang","is_ca":false},{"name":"Kaizhong Zhang","is_ca":true},{"name":"Louxin Zhang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001449899,0.0004504704,0.0008006437,0.0006994652,0.0008810641,0.001787379,0.001342942,0.00133686,0.004443177],"category_scores_gemma":[0.006290611,0.0004440577,0.0007353244,0.001492908,0.001161176,0.006117053,0.001919929,0.001313399,0.0004853471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008755982,"about_ca_system_score_gemma":0.0007657019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007886321,"about_ca_topic_score_gemma":0.0009575853,"domain_scores_codex":[0.9986696,0.0004848796,0.00006008064,0.0004529186,0.0001954494,0.0001369844],"domain_scores_gemma":[0.997012,0.001658968,0.0004840545,0.0005158909,0.0001395076,0.0001894565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002883954,0.0000715794,0.001832315,0.0003536357,0.00006574775,0.0002665974,0.0002412249,0.3879794,0.005080166,0.5067789,0.005034228,0.09200776],"study_design_scores_gemma":[0.00004123795,0.00007643755,0.0004298716,0.00002981633,0.00003308248,0.0003214819,0.00009024101,0.4741282,0.002302564,0.5106915,0.0118333,0.00002206109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06675501,0.0006502388,0.9248459,0.0008383156,0.00003917776,0.00006946025,0.0005688018,0.0003968861,0.005836207],"genre_scores_gemma":[0.6304662,0.0009481537,0.361448,0.0002227378,0.00007224498,0.0001699259,0.00167928,0.0001225095,0.004870878],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004443177,"threshold_uncertainty_score":0.01486391,"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","authors":[{"name":"Fiona Robertson","is_ca":false},{"name":"Manu Kumar Gundappa","is_ca":false},{"name":"Fabian Grammes","is_ca":false},{"name":"Torgeir R. Hvidsten","is_ca":false},{"name":"Anthony K. Redmond","is_ca":false},{"name":"Sigbjørn Lien","is_ca":false},{"name":"Samuel Martín","is_ca":false},{"name":"Peter W. H. Holland","is_ca":false},{"name":"Simen R. Sandve","is_ca":false},{"name":"Daniel J. Macqueen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006262193,0.0003555877,0.0003778257,0.0006881679,0.00049484,0.0006245223,0.0007745919,0.0009678939,0.002268404],"category_scores_gemma":[0.001223056,0.0002888944,0.0004769124,0.0006327321,0.0007204703,0.001209643,0.00100061,0.0007345501,0.0006356667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007700392,"about_ca_system_score_gemma":0.0003713125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001040925,"about_ca_topic_score_gemma":0.001161021,"domain_scores_codex":[0.9997888,0.00002217361,0.0000141096,0.0001188112,0.00002675684,0.00002938403],"domain_scores_gemma":[0.999458,0.0001317399,0.0002317349,0.00008790357,0.0000471085,0.00004360474],"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.0003651275,0.00004785257,0.177167,0.001004398,0.0003078757,0.001730943,0.001272598,0.01413815,0.7143334,0.03924714,0.001133028,0.04925248],"study_design_scores_gemma":[0.00009150666,0.0005836466,0.6722834,0.0002739316,0.0003824643,0.006175416,0.001746945,0.08901103,0.09777208,0.0751661,0.0562781,0.0002354584],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8926086,0.00772282,0.09140955,0.00098754,0.00009938488,0.0000642538,0.0008370675,0.0006014243,0.005669405],"genre_scores_gemma":[0.9879432,0.001631229,0.008240608,0.0003104566,0.00003251962,0.00003825098,0.0004820692,0.00006242179,0.001259232],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002268404,"threshold_uncertainty_score":0.007588565,"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","authors":[{"name":"Yue Liu","is_ca":false},{"name":"Xiang Qin","is_ca":false},{"name":"Xingzhi Song","is_ca":false},{"name":"Huaiyang Jiang","is_ca":false},{"name":"Yufeng Shen","is_ca":false},{"name":"K. James Durbin","is_ca":false},{"name":"Sigbjørn Lien","is_ca":false},{"name":"Matthew Kent","is_ca":false},{"name":"Marte Sodeland","is_ca":false},{"name":"Yanru Ren","is_ca":false},{"name":"Lan Zhang","is_ca":false},{"name":"Erica Sodergren","is_ca":false},{"name":"Paul Havlak","is_ca":false},{"name":"Kim C. Worley","is_ca":false},{"name":"George M. Weinstock","is_ca":false},{"name":"Richard A. Gibbs","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009617831,0.002091917,0.001014075,0.003527199,0.001752157,0.001861505,0.001219643,0.0009935962,0.02494014],"category_scores_gemma":[0.001178545,0.0005792809,0.001384846,0.002852309,0.0003269684,0.0008157954,0.0009961117,0.001388418,0.02613815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001105099,"about_ca_system_score_gemma":0.001002647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005591537,"about_ca_topic_score_gemma":0.005197325,"domain_scores_codex":[0.9992031,0.0001028746,0.00005796238,0.000369224,0.0001874172,0.0000793576],"domain_scores_gemma":[0.9994946,0.00007035944,0.00007591869,0.00009260691,0.0002154122,0.00005113952],"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.001843842,0.0001958445,0.009624265,0.00407581,0.0004275288,0.00205238,0.0007976354,0.006469546,0.4011184,0.0108021,0.1860157,0.376577],"study_design_scores_gemma":[0.0001306604,0.000412313,0.03300107,0.0005360949,0.0004906905,0.002795925,0.0001608737,0.01119291,0.09387612,0.004878673,0.852392,0.0001326593],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"dataset","genre_gemma":"empirical","genre_scores_codex":[0.1185166,0.03725231,0.3097867,0.003006283,0.004829251,0.001625054,0.3774854,0.03991334,0.1075852],"genre_scores_gemma":[0.08133484,0.006903753,0.2261626,0.0007613174,0.000792859,0.0005909873,0.6466306,0.0039091,0.0329139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02494014,"threshold_uncertainty_score":0.08343303,"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","authors":[{"name":"Éric Tannier","is_ca":false},{"name":"Chunfang Zheng","is_ca":true},{"name":"David Sankoff","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002358584,0.0008184002,0.001427647,0.0008526068,0.001287187,0.002828836,0.003111818,0.002392774,0.008719805],"category_scores_gemma":[0.01303916,0.0004257815,0.001535808,0.001829099,0.001882601,0.005657102,0.003106978,0.003643466,0.0006589693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002238308,"about_ca_system_score_gemma":0.00140976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001406962,"about_ca_topic_score_gemma":0.001601973,"domain_scores_codex":[0.9983184,0.0004805817,0.0001018868,0.0005262338,0.0003245873,0.0002483302],"domain_scores_gemma":[0.983809,0.01338858,0.00081266,0.0008629047,0.0005172783,0.0006095163],"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.0007630689,0.0003334971,0.003487989,0.001171655,0.0002030176,0.0003786075,0.0007240931,0.5284105,0.003127046,0.3427903,0.01215298,0.1064573],"study_design_scores_gemma":[0.0001432128,0.0001288822,0.00109844,0.00007152552,0.0000732117,0.0004862389,0.0003269353,0.4925035,0.003637204,0.495629,0.005857283,0.00004446218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2067832,0.002312536,0.7688207,0.004163487,0.000174777,0.0002122409,0.000889545,0.0006937685,0.01594983],"genre_scores_gemma":[0.6520101,0.001482044,0.3336347,0.0005916049,0.0003442756,0.0003813179,0.00199925,0.0003410243,0.0092157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008719805,"threshold_uncertainty_score":0.02917063,"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","authors":[{"name":"Cédric Chauve","is_ca":true},{"name":"Éric Tannier","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01185937,0.001213379,0.001315182,0.004097234,0.001519767,0.003119739,0.004361361,0.002198433,0.002064436],"category_scores_gemma":[0.03133779,0.001429108,0.003161176,0.003684629,0.004807872,0.002356176,0.004278656,0.003428605,0.0008637629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001796664,"about_ca_system_score_gemma":0.003475387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003117131,"about_ca_topic_score_gemma":0.002549738,"domain_scores_codex":[0.9938819,0.003089565,0.0005352591,0.001015299,0.001302475,0.0001754082],"domain_scores_gemma":[0.9874795,0.00861455,0.0007050392,0.001894086,0.001016575,0.0002902225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008331837,0.00008106559,0.001552208,0.0005425222,0.0002064295,0.0002938465,0.0004708249,0.3038782,0.01268518,0.5876483,0.00123389,0.09132425],"study_design_scores_gemma":[0.00007214796,0.00009983173,0.0006149373,0.0001274815,0.00005781517,0.0003441665,0.0001100704,0.6182772,0.005710801,0.3611163,0.0133915,0.0000777833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005512838,0.00005026098,0.9991894,0.00004205229,0.000005677515,0.00001267253,0.00001837907,0.00006187668,0.00006839288],"genre_scores_gemma":[0.01079982,0.0001480927,0.9884956,0.00003352817,0.00002030656,0.0001474678,0.0001411454,0.00008503357,0.0001289762],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01185937,"threshold_uncertainty_score":0.06271911,"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","authors":[{"name":"Éric Tannier","is_ca":false},{"name":"Anne Bergeron","is_ca":true},{"name":"Marie-France Sagot","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001896072,0.001246167,0.001621331,0.002494714,0.001149801,0.003138829,0.002464772,0.001586381,0.009910595],"category_scores_gemma":[0.005179696,0.0006019535,0.001196804,0.004555824,0.00319585,0.007733061,0.002694277,0.004402081,0.003542421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002082972,"about_ca_system_score_gemma":0.001898003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001253214,"about_ca_topic_score_gemma":0.001187377,"domain_scores_codex":[0.9984525,0.000404545,0.00009906917,0.0003087455,0.000565473,0.0001696183],"domain_scores_gemma":[0.997014,0.001418222,0.0001397209,0.0008886915,0.0004261582,0.0001130901],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006862268,0.00005245101,0.0001561792,0.0002162665,0.00001457715,0.00001940734,0.0000546283,0.008222477,0.001532592,0.8285976,0.008648503,0.1524168],"study_design_scores_gemma":[0.0000369527,0.00004909585,0.0001411575,0.0000729988,0.00002154063,0.0001031241,0.00004071629,0.03784698,0.003662316,0.8398595,0.1181334,0.00003220835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02883249,0.03414569,0.7996925,0.008158802,0.004213504,0.0001246728,0.0004379836,0.002333777,0.1220607],"genre_scores_gemma":[0.3919034,0.0486162,0.4649043,0.005232795,0.005828845,0.0002919561,0.001420368,0.001232629,0.08056947],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009910595,"threshold_uncertainty_score":0.03315419,"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","authors":[{"name":"Ibrahim Numanagić","is_ca":false},{"name":"Alim Şükrücan Gökkaya","is_ca":false},{"name":"Lillian Zhang","is_ca":false},{"name":"Bonnie Berger","is_ca":false},{"name":"Can Alkan","is_ca":false},{"name":"Faraz Hach","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002136112,0.001103572,0.0008439557,0.003321964,0.0006933698,0.001416053,0.001112029,0.0007670383,0.002324264],"category_scores_gemma":[0.007840788,0.0004319735,0.0008110799,0.001836728,0.0003808247,0.001581015,0.001077682,0.0008989482,0.001527762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005919633,"about_ca_system_score_gemma":0.0008254691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002793447,"about_ca_topic_score_gemma":0.003870036,"domain_scores_codex":[0.9984819,0.0002176558,0.0001109397,0.0004223459,0.0006397035,0.0001275336],"domain_scores_gemma":[0.9959656,0.001396822,0.0005739781,0.0004895352,0.001375117,0.0001989798],"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.0008850893,0.0002037961,0.05178427,0.001347256,0.0004272017,0.0007789863,0.0008766853,0.04545311,0.3084005,0.007436589,0.01644901,0.5659575],"study_design_scores_gemma":[0.00006132034,0.0003869362,0.04536889,0.0001513924,0.0001498134,0.001408822,0.000387303,0.6456215,0.2739969,0.007135583,0.02515841,0.0001731712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.225563,0.001700034,0.7333973,0.0002256436,0.0001255935,0.0002628865,0.004440501,0.03088299,0.00340197],"genre_scores_gemma":[0.3197565,0.0004361386,0.6655418,0.000101575,0.00004500455,0.0001373831,0.01081579,0.001729989,0.00143578],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003321964,"threshold_uncertainty_score":0.01129699,"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","authors":[{"name":"Hamza Išerić","is_ca":true},{"name":"Can Alkan","is_ca":false},{"name":"Faraz Hach","is_ca":true},{"name":"Ibrahim Numanagić","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002532151,0.001482392,0.001317746,0.003022879,0.0008474051,0.001610484,0.001958349,0.001127319,0.00545088],"category_scores_gemma":[0.007659573,0.001164875,0.001477607,0.002163278,0.0005716215,0.002241904,0.001852942,0.001769872,0.005188741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008964292,"about_ca_system_score_gemma":0.00122229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002107976,"about_ca_topic_score_gemma":0.003406252,"domain_scores_codex":[0.9985738,0.0001963169,0.0000922555,0.0004456552,0.0005972664,0.00009472219],"domain_scores_gemma":[0.9955669,0.001721748,0.0007087506,0.0006243394,0.001127456,0.000250774],"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.00153031,0.0002779001,0.03333368,0.003247744,0.0007437532,0.001390962,0.0009046897,0.08128259,0.3606984,0.01859942,0.04646022,0.4515303],"study_design_scores_gemma":[0.0001506038,0.0003576107,0.01796944,0.0002477287,0.0002831017,0.00122339,0.0003071492,0.631837,0.2650408,0.02381384,0.05853512,0.0002342053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0848865,0.001996086,0.8221675,0.0006283722,0.0002685724,0.0002456201,0.009524686,0.0749602,0.005322477],"genre_scores_gemma":[0.1380048,0.0006543643,0.8373684,0.0002915095,0.00007928527,0.0001861514,0.01655626,0.004581806,0.002277274],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00545088,"threshold_uncertainty_score":0.01823497,"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","authors":[{"name":"Nadia El-Mabrouk","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008161678,0.0005073848,0.000843285,0.0009514581,0.0004653058,0.001126712,0.001290666,0.0006810676,0.006026354],"category_scores_gemma":[0.002132954,0.00061419,0.001277387,0.001569625,0.001174454,0.001625464,0.0008923911,0.001075893,0.002335749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003714816,"about_ca_system_score_gemma":0.0003790905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005213942,"about_ca_topic_score_gemma":0.0009671812,"domain_scores_codex":[0.9995005,0.00009045006,0.00003419249,0.0002215119,0.000100443,0.00005284999],"domain_scores_gemma":[0.9990854,0.0004991312,0.0001217247,0.0002051832,0.0000528156,0.00003583412],"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.001008533,0.0001438689,0.005398162,0.0008911125,0.0001537261,0.0007178423,0.0004855154,0.07994037,0.1855119,0.1567527,0.00750978,0.5614865],"study_design_scores_gemma":[0.0002936253,0.0006870913,0.006369035,0.00016192,0.0003897896,0.004027639,0.0005121235,0.3912979,0.1883744,0.3397992,0.06792962,0.0001576445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1277527,0.001214153,0.8533911,0.0002790089,0.0002701724,0.0002046343,0.000613177,0.002528628,0.01374651],"genre_scores_gemma":[0.4053504,0.001658309,0.5732431,0.0001775615,0.0001119908,0.0001764302,0.002428442,0.001042598,0.01581115],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006026354,"threshold_uncertainty_score":0.0201602,"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","authors":[{"name":"Dannie Durand","is_ca":false},{"name":"David Sankoff","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03383406,0.001744465,0.002442666,0.00726632,0.003316417,0.004318326,0.005739363,0.004578411,0.007416221],"category_scores_gemma":[0.2457811,0.0006812772,0.003622768,0.007370237,0.008626021,0.004908002,0.004011575,0.004191911,0.0008197547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001693381,"about_ca_system_score_gemma":0.002301031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001240752,"about_ca_topic_score_gemma":0.0008429813,"domain_scores_codex":[0.940412,0.03446022,0.003095836,0.01094852,0.00841237,0.002671038],"domain_scores_gemma":[0.5703571,0.3910472,0.0097966,0.01788664,0.007436914,0.003475584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.008357933,0.0009364958,0.5465459,0.001546138,0.008163648,0.001477544,0.001847849,0.1534431,0.009955445,0.08027362,0.009327758,0.1781245],"study_design_scores_gemma":[0.0009061079,0.002297132,0.1505283,0.0002180458,0.001314615,0.002279366,0.00247662,0.6406392,0.01399323,0.1776644,0.007464046,0.000218955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.7126497,0.00121349,0.2680813,0.002042044,0.0003203617,0.00051832,0.003201205,0.002036274,0.009937338],"genre_scores_gemma":[0.9455726,0.0000733995,0.0500828,0.0002586567,0.0001044323,0.00032158,0.002897199,0.0002332524,0.0004560574],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.03383406,"threshold_uncertainty_score":0.1789337,"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","authors":[{"name":"Bradley R. Jones","is_ca":true},{"name":"Ashok Rajaraman","is_ca":true},{"name":"Éric Tannier","is_ca":true},{"name":"Cédric Chauve","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001334199,0.0009833064,0.0008084617,0.00318182,0.001136116,0.001968085,0.002119817,0.0007946169,0.03648748],"category_scores_gemma":[0.005272473,0.001087726,0.001959605,0.002031444,0.0006537524,0.002159716,0.002981936,0.00177943,0.009992307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000592551,"about_ca_system_score_gemma":0.001195851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003065408,"about_ca_topic_score_gemma":0.004011122,"domain_scores_codex":[0.9995209,0.00009597265,0.00002791959,0.0001404968,0.0001545869,0.00006027447],"domain_scores_gemma":[0.9990747,0.0003816172,0.00006119895,0.000227511,0.0001755125,0.00007941674],"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.001365585,0.0002202256,0.0168005,0.002429394,0.0006209743,0.001342045,0.001334748,0.09654312,0.03335625,0.09764922,0.3432136,0.4051244],"study_design_scores_gemma":[0.000418179,0.0001475607,0.008453042,0.0003628549,0.0001873739,0.001485589,0.0003904087,0.5122353,0.03738768,0.1087953,0.3299507,0.000186019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03681745,0.0004541012,0.7344237,0.000424416,0.0002606851,0.0001698244,0.05305527,0.1585333,0.0158613],"genre_scores_gemma":[0.1397088,0.0005425074,0.6990315,0.0002213048,0.00009931942,0.0003586528,0.1238966,0.02799086,0.008150478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03648748,"threshold_uncertainty_score":0.1220628,"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","authors":[{"name":"Nilgun Donmez","is_ca":true},{"name":"Michael Brudno","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003320474,0.001775038,0.001202403,0.00136983,0.001227577,0.001985764,0.003519379,0.001968425,0.02333614],"category_scores_gemma":[0.02029159,0.001374326,0.001300073,0.002440616,0.001222591,0.002621665,0.002742869,0.002869919,0.01310343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008162389,"about_ca_system_score_gemma":0.002009928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002234197,"about_ca_topic_score_gemma":0.002927397,"domain_scores_codex":[0.9977508,0.0006718731,0.0001614162,0.0006731067,0.0005985653,0.0001443134],"domain_scores_gemma":[0.9920524,0.004875791,0.0004045917,0.001602931,0.0008691957,0.0001950368],"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.001045255,0.0002101913,0.001994208,0.001719121,0.0001338651,0.000458365,0.0005362143,0.1378799,0.02474176,0.04476888,0.1028577,0.6836544],"study_design_scores_gemma":[0.0004089683,0.0002240139,0.0005398804,0.0001567544,0.000045749,0.0004929111,0.0001396941,0.8002643,0.03030698,0.09174236,0.07559622,0.00008210001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003258471,0.0002346725,0.9559729,0.0002211257,0.0000702211,0.000146789,0.001317039,0.03639914,0.002379645],"genre_scores_gemma":[0.03128113,0.0001801882,0.9575377,0.0001908541,0.00006545763,0.0004353722,0.004324458,0.003972357,0.002012387],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02333614,"threshold_uncertainty_score":0.07806718,"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","authors":[{"name":"Gill Bejerano","is_ca":false},{"name":"David Haussler","is_ca":false},{"name":"Mathieu Blanchette","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001017645,0.0003669184,0.0003785857,0.001662809,0.0007406157,0.0009195721,0.0007892904,0.0004772314,0.001488942],"category_scores_gemma":[0.005081486,0.0002186113,0.0002732179,0.001663785,0.0007844294,0.0007982517,0.0010697,0.0005954581,0.0004732619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004733347,"about_ca_system_score_gemma":0.0004099766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002181118,"about_ca_topic_score_gemma":0.00342855,"domain_scores_codex":[0.9996033,0.0001036572,0.00001505429,0.000140676,0.0001019462,0.0000352875],"domain_scores_gemma":[0.9984713,0.0008313038,0.0001660264,0.0002181046,0.0001662738,0.0001469295],"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.001426131,0.0003010341,0.09483663,0.001326978,0.0004474193,0.0008540548,0.002841427,0.1658921,0.1425827,0.07477777,0.0409715,0.4737422],"study_design_scores_gemma":[0.0001457887,0.0001637765,0.0795738,0.0001406187,0.000135552,0.0008149602,0.001326395,0.6188065,0.04175824,0.2320768,0.02495858,0.00009899122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5475115,0.002139132,0.4404818,0.002098986,0.0001346393,0.0001349339,0.001843393,0.002491508,0.003164123],"genre_scores_gemma":[0.8110135,0.0005193157,0.1793771,0.0003558407,0.00009045187,0.00007028314,0.005651359,0.0003649044,0.002557229],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002181118,"threshold_uncertainty_score":0.005381882,"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","authors":[{"name":"Lucian Ilie","is_ca":true},{"name":"Silvana Ilie","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001147116,0.0009892649,0.001075533,0.001807093,0.0008477544,0.001213626,0.001717295,0.001630225,0.01083072],"category_scores_gemma":[0.008444592,0.0006057731,0.0007721779,0.002963453,0.001479896,0.003425461,0.001893433,0.00153868,0.004336741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001052601,"about_ca_system_score_gemma":0.0008082291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006864952,"about_ca_topic_score_gemma":0.000713627,"domain_scores_codex":[0.9986547,0.0003642265,0.00008932046,0.0003223917,0.0004826169,0.0000866786],"domain_scores_gemma":[0.9963554,0.002019936,0.0002988882,0.0006935388,0.0004589257,0.0001733176],"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.0009045645,0.0002659057,0.002488259,0.000899598,0.00008267083,0.0006625926,0.0004559658,0.1633258,0.03592134,0.2315017,0.02240411,0.5410876],"study_design_scores_gemma":[0.0001551155,0.000317069,0.0004908089,0.0001019683,0.00003376809,0.0007924922,0.00008508831,0.6114537,0.02416644,0.3413709,0.02097946,0.00005311129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01844748,0.0007575124,0.972573,0.0003646232,0.0001108053,0.0001392926,0.0002223451,0.002801883,0.004582983],"genre_scores_gemma":[0.1339339,0.0003751345,0.8614751,0.0001439802,0.00009520719,0.0001705566,0.0007242115,0.0004862239,0.002595641],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01083072,"threshold_uncertainty_score":0.03623241,"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","authors":[{"name":"Nicolas Luc","is_ca":false},{"name":"Jean‐Loup Risler","is_ca":false},{"name":"Anne Bergeron","is_ca":true},{"name":"Mathieu Raffinot","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004847935,0.001497281,0.001308009,0.002614405,0.002068201,0.004499531,0.005987557,0.001665412,0.006426121],"category_scores_gemma":[0.01285481,0.001582186,0.003639319,0.003608739,0.005870225,0.008003986,0.006831039,0.005536086,0.00208266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001723979,"about_ca_system_score_gemma":0.002547228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006459048,"about_ca_topic_score_gemma":0.007639877,"domain_scores_codex":[0.9963732,0.001278194,0.0003454087,0.0008681462,0.0008709915,0.0002640386],"domain_scores_gemma":[0.994687,0.002497714,0.0003101279,0.001637872,0.0005424498,0.0003248979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001213327,0.00003615648,0.0007309228,0.0002109766,0.00006809756,0.0001270175,0.00059646,0.02118992,0.00263426,0.9277031,0.006481029,0.0401007],"study_design_scores_gemma":[0.00007408552,0.00003984786,0.0002027377,0.0001044536,0.0000827434,0.0001410626,0.0001518513,0.1082006,0.003297132,0.8429601,0.04470262,0.00004275189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001240137,0.00008018959,0.9960485,0.0001295393,0.00004107258,0.00003885734,0.0002022226,0.001292571,0.0009269125],"genre_scores_gemma":[0.04172235,0.0002397539,0.9532971,0.0002335173,0.00009213555,0.0003772861,0.001034651,0.001572704,0.001430422],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006459048,"threshold_uncertainty_score":0.02563858,"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","authors":[{"name":"Anne Bergeron","is_ca":true},{"name":"Julia Mixtacki","is_ca":false},{"name":"Jens Stoye","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002881999,0.001087807,0.001486192,0.001911395,0.002383359,0.003039651,0.002076319,0.002303632,0.01198689],"category_scores_gemma":[0.01604993,0.0006181882,0.001720735,0.00501953,0.005589408,0.01277925,0.005074668,0.003919002,0.002884117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002255094,"about_ca_system_score_gemma":0.00170433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003100907,"about_ca_topic_score_gemma":0.00233034,"domain_scores_codex":[0.9969837,0.0008428889,0.0002137017,0.0006913715,0.0008589983,0.0004092496],"domain_scores_gemma":[0.9943252,0.003892574,0.0002837018,0.0007715434,0.0005513089,0.0001756519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001970349,0.00004933649,0.0004631003,0.0002572841,0.0000205126,0.00012384,0.0003180363,0.03761264,0.003122383,0.8282742,0.007769436,0.1217921],"study_design_scores_gemma":[0.00005906422,0.0000421401,0.0001229468,0.00004771394,0.0000143181,0.0001319008,0.00007467029,0.04678765,0.002300035,0.9297373,0.02065671,0.00002556053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03402188,0.003275185,0.9318326,0.003668862,0.00068409,0.0001371637,0.0002873009,0.001449092,0.02464392],"genre_scores_gemma":[0.32214,0.00942413,0.629141,0.003230433,0.001181247,0.0003582547,0.001571633,0.0016005,0.03135286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01198689,"threshold_uncertainty_score":0.0401001,"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","authors":[{"name":"Anne Bergeron","is_ca":true},{"name":"Julia Mixtacki","is_ca":false},{"name":"Jens Stoye","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007176361,0.0005949076,0.0009829135,0.001009452,0.001563053,0.001862606,0.001427116,0.001239706,0.02401581],"category_scores_gemma":[0.007087061,0.0005842444,0.0007118634,0.001036995,0.002210749,0.004472255,0.003008741,0.003066364,0.006889328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004888664,"about_ca_system_score_gemma":0.0005335369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000332635,"about_ca_topic_score_gemma":0.0005241852,"domain_scores_codex":[0.9992207,0.0001413064,0.00004647857,0.0002417029,0.0002193526,0.0001304881],"domain_scores_gemma":[0.9978243,0.0009319625,0.0001022383,0.0007595104,0.0002413631,0.0001406438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009066753,0.00001879477,0.000198088,0.00007394163,0.000006835141,0.0001228325,0.0001080508,0.001792647,0.001589658,0.9306149,0.006228957,0.05915456],"study_design_scores_gemma":[0.00001792312,0.0000493756,0.0001588328,0.00002050147,0.00001153618,0.0003191279,0.00006203727,0.006300669,0.0023781,0.9669543,0.02370742,0.00002017325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1112043,0.002966433,0.4818644,0.002921819,0.001936508,0.0001216656,0.0005156329,0.00181232,0.3966569],"genre_scores_gemma":[0.6594433,0.001708248,0.1066555,0.001048996,0.0008255701,0.0001766563,0.0006437738,0.001394335,0.2281036],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02401581,"threshold_uncertainty_score":0.08034092,"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","authors":[{"name":"Adriana Muñoz","is_ca":true},{"name":"Chunfang Zheng","is_ca":true},{"name":"Qian Zhu","is_ca":false},{"name":"Victor A. Albert","is_ca":false},{"name":"Steve Rounsley","is_ca":false},{"name":"David Sankoff","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004778394,0.001275282,0.001156168,0.002504291,0.001192381,0.001301333,0.002747813,0.001528409,0.004280318],"category_scores_gemma":[0.01642442,0.0008854442,0.001282462,0.00316518,0.001832535,0.001969842,0.001578221,0.001399388,0.001347731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001572917,"about_ca_system_score_gemma":0.002248486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007057748,"about_ca_topic_score_gemma":0.00676712,"domain_scores_codex":[0.9978579,0.000818797,0.0000961943,0.0006552641,0.000433104,0.0001386584],"domain_scores_gemma":[0.992396,0.005556236,0.000488588,0.0009637421,0.0004430853,0.0001523684],"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.001149664,0.0002280794,0.008385431,0.0006327376,0.0002203091,0.0002785633,0.0005442636,0.494918,0.01817949,0.04320803,0.005306785,0.4269487],"study_design_scores_gemma":[0.00007666143,0.0001193798,0.001612198,0.00002919366,0.00004980554,0.0002446265,0.00005344027,0.9331757,0.01129981,0.04929386,0.004016215,0.00002910495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02227728,0.0001738729,0.972993,0.00007577213,0.00001767405,0.00004219333,0.000305366,0.003365574,0.0007493222],"genre_scores_gemma":[0.1454637,0.0001084961,0.8514787,0.00007195514,0.00002594694,0.0001215614,0.001503945,0.0003874802,0.0008381241],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007057748,"threshold_uncertainty_score":0.02527088,"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","authors":[{"name":"Sèverine Bérard","is_ca":false},{"name":"Anne Bergeron","is_ca":true},{"name":"Cédric Chauve","is_ca":true},{"name":"Christophe Paul","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001373586,0.0006322691,0.000933711,0.0007630232,0.001002959,0.00198277,0.001185921,0.001337918,0.008105384],"category_scores_gemma":[0.00547802,0.0005238585,0.0009966794,0.001252272,0.001208937,0.005689246,0.001501499,0.001532916,0.002264675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005690837,"about_ca_system_score_gemma":0.001111117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005333933,"about_ca_topic_score_gemma":0.001135146,"domain_scores_codex":[0.9988275,0.0002687534,0.0001095602,0.0003745889,0.0002533987,0.0001662577],"domain_scores_gemma":[0.9970315,0.001466855,0.0004161363,0.0007413474,0.000211259,0.0001330616],"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.0005441675,0.00023893,0.004221832,0.0004674717,0.0001402283,0.0003244774,0.00022379,0.1036833,0.03149708,0.3909828,0.01172914,0.4559468],"study_design_scores_gemma":[0.0001354172,0.0003120254,0.0008312785,0.0000453605,0.0000425396,0.0005742956,0.0002877702,0.1796962,0.01683436,0.7863017,0.01486233,0.0000766866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1301947,0.0004141186,0.8553886,0.001251789,0.0001820325,0.0001500821,0.0003197239,0.001827989,0.010271],"genre_scores_gemma":[0.503668,0.0004918116,0.4888937,0.0004686454,0.0001209218,0.0001070159,0.001127569,0.0003060054,0.004816436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008105384,"threshold_uncertainty_score":0.02711523,"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","authors":[{"name":"J Lefebvre","is_ca":true},{"name":"Nadia El-Mabrouk","is_ca":true},{"name":"Elisabeth R.M. Tillier","is_ca":false},{"name":"David Sankoff","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005511639,0.0004452929,0.0005065693,0.001739047,0.0006722292,0.0009245102,0.001329219,0.0009855194,0.002238966],"category_scores_gemma":[0.04110702,0.0002438245,0.0004646951,0.001265811,0.001416833,0.001018865,0.001073372,0.0006570957,0.0005037347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007115626,"about_ca_system_score_gemma":0.000733698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008331565,"about_ca_topic_score_gemma":0.000682536,"domain_scores_codex":[0.9958481,0.001612866,0.0002828286,0.001104174,0.0009509976,0.0002010477],"domain_scores_gemma":[0.9728473,0.01891588,0.001892428,0.003514859,0.002465413,0.0003639363],"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.002555144,0.0005262155,0.1655332,0.001206004,0.0003603313,0.0005766661,0.0006830157,0.2968343,0.1875361,0.06154696,0.001569824,0.2810723],"study_design_scores_gemma":[0.0001212462,0.0004522915,0.02124922,0.00004961256,0.00006145105,0.0007761273,0.0001922886,0.7325818,0.212708,0.02962757,0.002129685,0.00005073598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6729693,0.0003243189,0.3225387,0.0001785184,0.00003945925,0.00008693268,0.0004321046,0.001059326,0.002371297],"genre_scores_gemma":[0.8985047,0.00005105292,0.09992329,0.00004743228,0.000008775363,0.00005264635,0.001031847,0.00007560886,0.000304634],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.005511639,"threshold_uncertainty_score":0.0291487,"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","authors":[{"name":"David Sankoff","is_ca":true},{"name":"Phil Trinh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01204872,0.0003324616,0.0009575534,0.001895251,0.000664956,0.001515392,0.001406722,0.001265611,0.0009499282],"category_scores_gemma":[0.08644886,0.0005198504,0.0007985168,0.001808678,0.002364228,0.003118256,0.003026743,0.001073283,0.0002126979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00129684,"about_ca_system_score_gemma":0.001054656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001783251,"about_ca_topic_score_gemma":0.00203846,"domain_scores_codex":[0.9938155,0.003305222,0.0003505233,0.0009186983,0.001281581,0.0003283197],"domain_scores_gemma":[0.9309328,0.05494777,0.00476557,0.006950233,0.001865397,0.0005383703],"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.0009618098,0.0001198765,0.0691807,0.0002552484,0.0003098497,0.0003188395,0.001283073,0.6403276,0.01415548,0.1380577,0.0004778342,0.1345519],"study_design_scores_gemma":[0.0000681734,0.0001732384,0.006828503,0.00004468048,0.00007447339,0.00038689,0.0001240794,0.86805,0.01259139,0.1099534,0.001648785,0.00005626465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5002304,0.0006078393,0.4970161,0.0002615924,0.00001541256,0.00006720014,0.00005286721,0.0004540985,0.001294521],"genre_scores_gemma":[0.9128792,0.0002766566,0.0858002,0.00008455046,0.00001904541,0.00008932216,0.0001455901,0.0001345937,0.0005709043],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01204872,"threshold_uncertainty_score":0.06372046,"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","authors":[{"name":"Richard J. Forrester","is_ca":false},{"name":"Harvey J. Greenberg","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002886098,0.001127978,0.000965261,0.0008151461,0.0007347269,0.0023915,0.001605924,0.001624427,0.007856443],"category_scores_gemma":[0.008176479,0.0004627882,0.0008371773,0.002586575,0.002422004,0.003662304,0.001779496,0.003531653,0.001680758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002051862,"about_ca_system_score_gemma":0.001725078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005320102,"about_ca_topic_score_gemma":0.003833255,"domain_scores_codex":[0.997914,0.001205618,0.0000598788,0.0002445196,0.0004066961,0.0001692343],"domain_scores_gemma":[0.9951361,0.003889899,0.0002521523,0.0002616149,0.0003120865,0.0001480527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002806065,0.00005380957,0.000186909,0.0001636666,0.00001902102,0.00003335343,0.0001077785,0.1501979,0.0001478722,0.8223038,0.006417637,0.0203402],"study_design_scores_gemma":[0.00002217366,0.00002839924,0.00009952284,0.00003543473,0.000007410704,0.00002356083,0.00005053258,0.3698878,0.0001309376,0.6167693,0.01293211,0.00001308499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009382922,0.005055963,0.9486127,0.005282731,0.0003517453,0.0001066674,0.0003374318,0.0002327631,0.030637],"genre_scores_gemma":[0.4588852,0.01057248,0.477346,0.002227376,0.001644681,0.0008480158,0.001458268,0.0002665976,0.04675141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007856443,"threshold_uncertainty_score":0.02628237,"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","authors":[{"name":"Olivier Tremblay Savard","is_ca":true},{"name":"Denis Bertrand","is_ca":false},{"name":"Nadia El-Mabrouk","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002142094,0.0003748992,0.0004861078,0.001082394,0.00059062,0.0009125063,0.001318609,0.0009781902,0.001092358],"category_scores_gemma":[0.007499151,0.0004347944,0.0006869042,0.0009662479,0.0006536053,0.0008603111,0.0008355022,0.0007648024,0.0002619609],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001435701,"about_ca_system_score_gemma":0.0007946418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002884055,"about_ca_topic_score_gemma":0.002649344,"domain_scores_codex":[0.9991817,0.0002204076,0.0000421554,0.0003602065,0.0001341211,0.00006139187],"domain_scores_gemma":[0.9964191,0.002551107,0.0003304402,0.0002074075,0.0003653212,0.0001265861],"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.0004640039,0.0001745165,0.1147304,0.0002869173,0.0002483352,0.0003679879,0.0006378929,0.7683682,0.02774943,0.0136857,0.001010546,0.07227609],"study_design_scores_gemma":[0.00003487675,0.00007304686,0.01186807,0.00002408193,0.00004809509,0.0002849397,0.00008512665,0.969053,0.008071236,0.009296867,0.001140221,0.00002046149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8698928,0.0002859243,0.1278332,0.0001505616,0.00001424819,0.00005492652,0.0004069629,0.0004032323,0.0009581454],"genre_scores_gemma":[0.8627934,0.0001154406,0.1348597,0.00006929802,0.000009456903,0.000068401,0.001450796,0.0001180243,0.0005154244],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002884055,"threshold_uncertainty_score":0.01132858,"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","authors":[{"name":"Manuel Lafond","is_ca":true},{"name":"Nadia El-Mabrouk","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005257532,0.001252267,0.001608886,0.001731659,0.001306685,0.003250628,0.003984474,0.00300244,0.00879307],"category_scores_gemma":[0.02705029,0.001335153,0.003746098,0.003136982,0.002613803,0.007681928,0.002842447,0.004503978,0.0009807004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002051137,"about_ca_system_score_gemma":0.003223285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005447464,"about_ca_topic_score_gemma":0.005629547,"domain_scores_codex":[0.9956968,0.001119936,0.0004477185,0.001405585,0.000938751,0.0003912186],"domain_scores_gemma":[0.9658577,0.02813474,0.002168694,0.001829811,0.001574003,0.0004350504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001045308,0.0009421889,0.01671897,0.004145111,0.0007684669,0.002069417,0.00182446,0.3533271,0.01925336,0.2600504,0.02181006,0.3180451],"study_design_scores_gemma":[0.0002169992,0.00009513801,0.001590146,0.0001821473,0.0001719474,0.0008250742,0.000373596,0.4540396,0.01057872,0.5260338,0.005822779,0.00007002431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06661698,0.0008906453,0.920488,0.003188511,0.00009036107,0.0004339359,0.002633117,0.001266026,0.004392485],"genre_scores_gemma":[0.2743134,0.0006543481,0.7158452,0.0007198139,0.0001916711,0.0003486759,0.005519241,0.000455018,0.001952659],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00879307,"threshold_uncertainty_score":0.02941573,"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","authors":[{"name":"Anne Bergeron","is_ca":true},{"name":"Jens Stoye","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003152899,0.0005350556,0.001279316,0.006269249,0.001620211,0.002904947,0.001861751,0.001616184,0.003810564],"category_scores_gemma":[0.03495293,0.0004852444,0.001077591,0.009557774,0.004203988,0.00798796,0.004378229,0.002193735,0.0005436593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001244163,"about_ca_system_score_gemma":0.0006501448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001345099,"about_ca_topic_score_gemma":0.0007527321,"domain_scores_codex":[0.9956757,0.001870584,0.0003483229,0.0009259707,0.001025692,0.0001536656],"domain_scores_gemma":[0.9809017,0.01472831,0.001215195,0.001793508,0.0009824448,0.0003789449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001548637,0.00006991206,0.002922855,0.0001971792,0.00006380997,0.0001714947,0.0007156728,0.04193996,0.002862389,0.776279,0.00149049,0.1731324],"study_design_scores_gemma":[0.00001774438,0.00007028441,0.0009507164,0.00005493743,0.00002150093,0.0003289049,0.0001619641,0.09038201,0.001373487,0.9012882,0.005318718,0.00003166505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05538298,0.001660963,0.9316987,0.0007789861,0.0001079724,0.00009956848,0.0002462671,0.0003939028,0.00963071],"genre_scores_gemma":[0.4659614,0.001726692,0.528211,0.000358215,0.0003707143,0.000264888,0.0007232629,0.0002422033,0.002141637],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006269249,"threshold_uncertainty_score":0.01667428,"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","authors":[{"name":"Md Momin Al Aziz","is_ca":true},{"name":"Dima Alhadidi","is_ca":false},{"name":"Noman Mohammed","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001840458,0.0007002224,0.001435439,0.001794946,0.0006194203,0.001740308,0.002035721,0.001247535,0.001764301],"category_scores_gemma":[0.01607721,0.0003724912,0.0009117728,0.002670784,0.001020474,0.003819237,0.002375788,0.001804023,0.0005561371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001887082,"about_ca_system_score_gemma":0.001535434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00230212,"about_ca_topic_score_gemma":0.001726631,"domain_scores_codex":[0.9961183,0.000850322,0.0002981734,0.0008552712,0.001588168,0.0002898533],"domain_scores_gemma":[0.9861678,0.007643528,0.001172621,0.003685774,0.001072219,0.0002579452],"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.0007937598,0.0001866591,0.003734849,0.0002864967,0.0001240589,0.0003138875,0.0003433085,0.6691738,0.008785359,0.05686778,0.003031005,0.2563589],"study_design_scores_gemma":[0.00002719377,0.00007985911,0.000406391,0.00001346987,0.00001476801,0.0001990969,0.00004989907,0.9484981,0.004506416,0.04492217,0.001271915,0.00001074186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06860594,0.0005544132,0.9271381,0.0003820433,0.00004513617,0.00008117408,0.0005035138,0.001600557,0.001089031],"genre_scores_gemma":[0.6239795,0.0003941075,0.3716559,0.0001520239,0.00009533723,0.0001742863,0.001702671,0.0001329332,0.001713313],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00230212,"threshold_uncertainty_score":0.01369178,"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","authors":[{"name":"Robert G. Beiko","is_ca":true},{"name":"Robert L. Charlebois","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002540612,0.0008424942,0.0007980475,0.001177105,0.0009153547,0.00124476,0.001876401,0.001642175,0.009913633],"category_scores_gemma":[0.01754119,0.000384219,0.0008447539,0.0009744843,0.001072112,0.001080112,0.001235573,0.001132923,0.0006789853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0011341,"about_ca_system_score_gemma":0.00103889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00590659,"about_ca_topic_score_gemma":0.002919365,"domain_scores_codex":[0.9992248,0.0004833324,0.00003599984,0.00009953887,0.00008905664,0.00006721951],"domain_scores_gemma":[0.9795202,0.01842613,0.0003624964,0.0004822651,0.0008004806,0.0004085333],"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.0001269594,0.00009060375,0.003227936,0.0000784232,0.00003144612,0.0001362296,0.00004776791,0.9789132,0.0002638393,0.01189285,0.001386876,0.003803873],"study_design_scores_gemma":[0.0000267285,0.00001894378,0.0001434679,0.00000576001,0.000004086403,0.00001509645,0.00001328827,0.9942821,0.0001675993,0.005021126,0.0002985201,0.000003252392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6880218,0.0009235006,0.2807057,0.002671746,0.0002568177,0.0003448764,0.004169624,0.001938958,0.02096687],"genre_scores_gemma":[0.9034744,0.0003081961,0.08913213,0.0002415025,0.00007688745,0.0006288177,0.003354023,0.0002045485,0.002579476],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.009913633,"threshold_uncertainty_score":0.03316438,"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","authors":[{"name":"Yves Gagnon","is_ca":true},{"name":"Mathieu Blanchette","is_ca":true},{"name":"Nadia El-Mabrouk","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008799402,0.0008788811,0.00102777,0.002335117,0.0008916768,0.001419945,0.002223211,0.001264817,0.008806879],"category_scores_gemma":[0.002991506,0.0006604632,0.001702531,0.001748665,0.000580379,0.001305652,0.002152388,0.001937027,0.002647691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005431372,"about_ca_system_score_gemma":0.001220398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002515798,"about_ca_topic_score_gemma":0.002996206,"domain_scores_codex":[0.9994141,0.00008768855,0.00003358771,0.0002181164,0.0001888818,0.00005764373],"domain_scores_gemma":[0.9991814,0.0003191771,0.00006038038,0.0002150943,0.0001494563,0.00007444898],"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.0005630547,0.0001847892,0.005313705,0.0005546291,0.0003192195,0.00126584,0.0007775476,0.2365769,0.04144832,0.04814256,0.01305564,0.6517978],"study_design_scores_gemma":[0.00007401589,0.00007449879,0.001142793,0.00004890235,0.00007357547,0.0006368937,0.00010545,0.9513507,0.008985594,0.02578259,0.01167616,0.00004880586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01179611,0.0001596838,0.9831034,0.00008321556,0.00004614123,0.00006103889,0.0004493133,0.003115567,0.001185515],"genre_scores_gemma":[0.08453374,0.000138904,0.9096653,0.00008195895,0.00003582889,0.0001303442,0.00294942,0.0008876133,0.001576929],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008806879,"threshold_uncertainty_score":0.02946198,"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","authors":[{"name":"Frank Ruskey","is_ca":true},{"name":"Aaron Williams","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002748205,0.0003901802,0.0002952424,0.0005389104,0.0009748803,0.0006059897,0.0006879102,0.0004749994,0.006772544],"category_scores_gemma":[0.001336097,0.0002887881,0.0005059022,0.0005365299,0.001039888,0.001339872,0.001122971,0.0005736767,0.001103687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007417183,"about_ca_system_score_gemma":0.000902986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00157258,"about_ca_topic_score_gemma":0.002797771,"domain_scores_codex":[0.9997193,0.00005235943,0.00001839501,0.00007747395,0.00005867922,0.00007386082],"domain_scores_gemma":[0.9996294,0.0001121168,0.00004907186,0.00009597492,0.00007079676,0.00004267334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000935865,0.00005682347,0.001172861,0.0001800756,0.00001809025,0.0002776703,0.0006053732,0.017614,0.01700111,0.8598439,0.00295289,0.1001836],"study_design_scores_gemma":[0.00004920402,0.0001525677,0.0007212455,0.0001155105,0.00004446985,0.0006042962,0.0002420727,0.1108944,0.04436292,0.782814,0.05993075,0.00006841309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1340927,0.0002208024,0.8309003,0.000310643,0.00008015569,0.0002084723,0.0003488706,0.0008611741,0.03297698],"genre_scores_gemma":[0.5329524,0.000240145,0.4462284,0.0001803378,0.00002247088,0.0002576497,0.0005142016,0.0002787378,0.0193256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006772544,"threshold_uncertainty_score":0.02265644,"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","authors":[{"name":"Chunfang Zheng","is_ca":true},{"name":"Qian Zhu","is_ca":true},{"name":"David Sankoff","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006638255,0.0005793113,0.0006746356,0.001309281,0.0007812351,0.001208314,0.001247482,0.001032441,0.001163176],"category_scores_gemma":[0.0281942,0.0007209813,0.0006879105,0.002752357,0.00196609,0.002640394,0.00189571,0.0009741551,0.0003962476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005513547,"about_ca_system_score_gemma":0.0008317553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001534036,"about_ca_topic_score_gemma":0.002860934,"domain_scores_codex":[0.9967965,0.001826365,0.00009409869,0.0003089447,0.0008134835,0.0001605048],"domain_scores_gemma":[0.9881487,0.009725152,0.0004310739,0.001117414,0.0004588018,0.0001188393],"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.0008461655,0.0002408927,0.01478704,0.0002268296,0.0001161598,0.0005018684,0.001208824,0.6903276,0.0435507,0.08436837,0.001219607,0.162606],"study_design_scores_gemma":[0.00007786199,0.0003142705,0.003629693,0.00003366426,0.00003955823,0.0002966279,0.0002765913,0.8884084,0.02237867,0.08029108,0.004199184,0.00005436825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1360977,0.0001237435,0.8616809,0.0002888991,0.0000196161,0.00009692812,0.00003820933,0.0002310393,0.001423012],"genre_scores_gemma":[0.3174408,0.0001535245,0.6807705,0.0001216265,0.00003036315,0.0002172697,0.0001268476,0.0001742217,0.0009648818],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006638255,"threshold_uncertainty_score":0.0351069,"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","authors":[{"name":"Abdoulaye Baniré Diallo","is_ca":true},{"name":"Vladimir Makarenkov","is_ca":true},{"name":"Mathieu Blanchette","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002455977,0.001430954,0.001287242,0.003045048,0.0009034425,0.001734318,0.003478576,0.001241399,0.05739122],"category_scores_gemma":[0.007176869,0.001709342,0.001131876,0.002642569,0.0003933869,0.002017367,0.002258249,0.002459761,0.04576554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007788175,"about_ca_system_score_gemma":0.001773366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002457589,"about_ca_topic_score_gemma":0.001829832,"domain_scores_codex":[0.9991983,0.0001528924,0.0001012939,0.0001870083,0.0002543801,0.00010622],"domain_scores_gemma":[0.9982728,0.0005399542,0.0001843384,0.0003788889,0.0004080566,0.0002159761],"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.002028056,0.0002326175,0.007720284,0.001855603,0.0003441357,0.0009378513,0.0006123551,0.007507412,0.02000056,0.01635679,0.6515255,0.2908788],"study_design_scores_gemma":[0.001284985,0.0003623035,0.0104553,0.0005726129,0.0003002574,0.002963946,0.0002372015,0.1569475,0.04492963,0.07191519,0.7095296,0.0005014393],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"software","genre_gemma":"software","genre_scores_codex":[0.01057189,0.0009318163,0.3233323,0.0003756081,0.0002789209,0.0003687048,0.09398909,0.559301,0.01085063],"genre_scores_gemma":[0.07042555,0.0009594668,0.4937413,0.0003497459,0.0001974892,0.0008901766,0.3587333,0.06229067,0.01241231],"genre_candidate":"software","genre_consensus":"software","teacher_disagreement_score":0.05739122,"threshold_uncertainty_score":0.1919928,"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","authors":[{"name":"Chunfang Zheng","is_ca":true},{"name":"Qian Zhu","is_ca":true},{"name":"Zaky Adam","is_ca":true},{"name":"David Sankoff","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001409199,0.0005387099,0.0006737949,0.0008392296,0.001046429,0.00181934,0.001441444,0.00103286,0.003622536],"category_scores_gemma":[0.007530541,0.0004025119,0.0007847692,0.0009843165,0.0009515909,0.001681644,0.0009784078,0.001291331,0.0005366573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001414883,"about_ca_system_score_gemma":0.0008912312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003613782,"about_ca_topic_score_gemma":0.004994892,"domain_scores_codex":[0.9996761,0.0001134825,0.0000198769,0.00008352709,0.00006451395,0.00004251123],"domain_scores_gemma":[0.9971343,0.002070921,0.0002201614,0.0002678676,0.000186902,0.0001198796],"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.0006123274,0.0001609853,0.02109708,0.0004447242,0.00008142998,0.0003207112,0.0006071667,0.808757,0.01644,0.04187852,0.004495515,0.1051044],"study_design_scores_gemma":[0.00008026784,0.00009622087,0.005358957,0.00008604841,0.00005671236,0.0002258009,0.000365342,0.9121782,0.01496639,0.06228257,0.004260623,0.00004281584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6680759,0.001336976,0.3164803,0.001039576,0.00004951643,0.0001083872,0.001021114,0.00209208,0.009796258],"genre_scores_gemma":[0.6703309,0.0006245186,0.3231971,0.0002572694,0.00001989883,0.0001343875,0.002560941,0.0006241551,0.002250837],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.003622536,"threshold_uncertainty_score":0.01211858,"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","authors":[{"name":"Anne Bergeron","is_ca":true},{"name":"Steffen Heber","is_ca":false},{"name":"Jens Stoye","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005842087,0.0006250684,0.001486477,0.002876518,0.002378717,0.005084956,0.00228695,0.001903736,0.005988754],"category_scores_gemma":[0.03029937,0.0007765679,0.001903619,0.003491377,0.009510373,0.01921851,0.005516816,0.004436852,0.00115886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001313397,"about_ca_system_score_gemma":0.001283222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009670229,"about_ca_topic_score_gemma":0.0005683513,"domain_scores_codex":[0.9943936,0.001648456,0.0005209413,0.001385192,0.001620876,0.0004308478],"domain_scores_gemma":[0.9777113,0.0167166,0.001033631,0.002565345,0.001472387,0.000500829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004978994,0.0000118211,0.0003003992,0.00007520696,0.000008065777,0.00007109445,0.0002806266,0.001601452,0.000587423,0.9656002,0.0006979324,0.03071588],"study_design_scores_gemma":[0.00001385471,0.0000360529,0.0001816369,0.00003155199,0.00001057168,0.0001922142,0.0001128675,0.004824001,0.000691933,0.9857091,0.008169621,0.00002652003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02179958,0.001826564,0.9593397,0.001839043,0.0002695224,0.00004904118,0.00009394931,0.0003074721,0.01447509],"genre_scores_gemma":[0.4938101,0.003375008,0.4922226,0.001278417,0.001247253,0.0002573492,0.0003006982,0.0004703583,0.007038255],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005988754,"threshold_uncertainty_score":0.03089631,"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","authors":[{"name":"David Sankoff","is_ca":true},{"name":"David Bryant","is_ca":true},{"name":"Mélanie Deneault","is_ca":true},{"name":"B. Franz Lang","is_ca":true},{"name":"Gertraud Burger","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009290808,0.0002850697,0.000562157,0.0009735846,0.000629392,0.001386871,0.0006870689,0.0006971389,0.001282953],"category_scores_gemma":[0.005412018,0.000401336,0.0006569314,0.00104561,0.0009273603,0.001279671,0.0009334161,0.001022614,0.000219175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00078963,"about_ca_system_score_gemma":0.0003990672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001044509,"about_ca_topic_score_gemma":0.002031629,"domain_scores_codex":[0.9996051,0.0001235504,0.00002185703,0.0001194257,0.0000809602,0.00004915999],"domain_scores_gemma":[0.9987437,0.0007106102,0.0002443961,0.0001407372,0.00008088943,0.0000796883],"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.001085771,0.0001501137,0.06445844,0.0002810029,0.0002102087,0.0004974186,0.0008270083,0.6521976,0.1068359,0.06226547,0.0004465551,0.1107446],"study_design_scores_gemma":[0.00008325713,0.0003820649,0.05649712,0.00006999683,0.0001050701,0.0004539055,0.0005099913,0.7763277,0.03770948,0.1244845,0.003292919,0.00008403201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8243849,0.0002728976,0.1736853,0.0001079135,0.000008817503,0.00002203236,0.0001170602,0.0001668905,0.001234311],"genre_scores_gemma":[0.8808675,0.000217927,0.1179612,0.00002209748,0.000006740238,0.00002821961,0.0003415116,0.0001076012,0.0004472162],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001386871,"threshold_uncertainty_score":0.005729198,"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","authors":[{"name":"Vicky Choi","is_ca":false},{"name":"Chunfang Zheng","is_ca":true},{"name":"Qian Zhu","is_ca":true},{"name":"David Sankoff","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003249852,0.002875139,0.002454994,0.006477661,0.001760994,0.004252458,0.004919573,0.00222929,0.0156375],"category_scores_gemma":[0.01157337,0.00205243,0.002781019,0.007370342,0.001074248,0.00420128,0.003358871,0.003057553,0.01197866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001214211,"about_ca_system_score_gemma":0.002297139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00394422,"about_ca_topic_score_gemma":0.007325302,"domain_scores_codex":[0.9984756,0.0002623572,0.000207793,0.0003953952,0.0005371884,0.0001216489],"domain_scores_gemma":[0.9938945,0.003871179,0.0003427269,0.0007541169,0.000976315,0.0001611334],"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.0005375574,0.0001751204,0.001251445,0.001020235,0.0002266885,0.0002102322,0.0004534449,0.01211212,0.0227842,0.0172504,0.02767111,0.9163074],"study_design_scores_gemma":[0.0009302599,0.0004118819,0.0068721,0.0004896406,0.0006831946,0.001859051,0.0009338728,0.5730445,0.07119621,0.234878,0.1084298,0.0002714373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005724566,0.0009165837,0.9726609,0.0001596455,0.00006246478,0.0003885144,0.00207364,0.01663343,0.00138023],"genre_scores_gemma":[0.00946773,0.0003370909,0.9822516,0.0000471784,0.00002088038,0.0003894623,0.005530447,0.0007292532,0.001226275],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0156375,"threshold_uncertainty_score":0.05231273,"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","authors":[{"name":"Junwei Luo","is_ca":false},{"name":"Jianxin Wang","is_ca":false},{"name":"Zhen Zhang","is_ca":false},{"name":"Min Li","is_ca":false},{"name":"Fang‐Xiang Wu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007116429,0.001618447,0.001287147,0.002369839,0.001324356,0.001301756,0.002249875,0.001151252,0.007540658],"category_scores_gemma":[0.002526281,0.0007330595,0.001367869,0.002182507,0.0008879238,0.001882982,0.001971247,0.001094293,0.003380278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008949558,"about_ca_system_score_gemma":0.001758562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004847378,"about_ca_topic_score_gemma":0.00661785,"domain_scores_codex":[0.999404,0.00009096533,0.00003478838,0.0002170019,0.0001792148,0.00007416858],"domain_scores_gemma":[0.9987765,0.0004480672,0.0001154899,0.0002589875,0.000296112,0.0001048635],"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.0007009694,0.000231241,0.002870377,0.0006346715,0.0001297258,0.0004898558,0.0004254464,0.171876,0.05167838,0.0216092,0.03088805,0.7184662],"study_design_scores_gemma":[0.0001928531,0.0001850653,0.0006158966,0.00004491259,0.00006270081,0.0002767804,0.0001518665,0.9387695,0.01982022,0.02132356,0.01850657,0.00005014443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01208951,0.0001940418,0.9725896,0.0001203043,0.00006991603,0.0001267022,0.0005192137,0.01247579,0.001814949],"genre_scores_gemma":[0.05815796,0.0001229972,0.9344675,0.0001139819,0.00003582451,0.0001837106,0.002956092,0.001425306,0.002536724],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007540658,"threshold_uncertainty_score":0.02522594,"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","authors":[{"name":"Cédric Chauve","is_ca":true},{"name":"Haris Gavranović","is_ca":false},{"name":"Aïda Ouangraoua","is_ca":false},{"name":"Éric Tannier","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01148624,0.000880524,0.001281311,0.001985273,0.0008973462,0.002410959,0.002077675,0.001941521,0.002173722],"category_scores_gemma":[0.05730147,0.0009800727,0.001824224,0.001623441,0.002355055,0.003036284,0.002416399,0.003941342,0.0005698981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009076928,"about_ca_system_score_gemma":0.001159286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002246488,"about_ca_topic_score_gemma":0.001195613,"domain_scores_codex":[0.9957195,0.003086336,0.0001896271,0.0003211366,0.0005789489,0.0001044473],"domain_scores_gemma":[0.9714968,0.02339842,0.0005707184,0.003345628,0.0009231867,0.0002653027],"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.0004082898,0.0001170568,0.006513263,0.0005562517,0.0005968102,0.0001479839,0.0003291075,0.6072575,0.001744262,0.2644447,0.00378478,0.1140999],"study_design_scores_gemma":[0.00003174908,0.00002044429,0.0004710185,0.00007552233,0.00001767497,0.00003037914,0.00003218364,0.8346744,0.000547781,0.162057,0.002015645,0.00002614593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02687388,0.002997909,0.9632943,0.002924137,0.0002378457,0.00007089919,0.0003466731,0.00107064,0.002183759],"genre_scores_gemma":[0.3664156,0.002415841,0.6271534,0.0005890799,0.0003819492,0.0004462186,0.0008891727,0.0008481072,0.0008607053],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01148624,"threshold_uncertainty_score":0.06074572,"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","authors":[{"name":"W. Sean Kennedy","is_ca":true},{"name":"Guohui Lin","is_ca":true},{"name":"Guiying Yan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001125518,0.0005307553,0.001140584,0.001006796,0.001359839,0.003417596,0.001729916,0.00119052,0.01643393],"category_scores_gemma":[0.01390949,0.0007332052,0.0006963043,0.001437438,0.002623588,0.007154655,0.003131339,0.003218991,0.002869075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009347675,"about_ca_system_score_gemma":0.0006903944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004781576,"about_ca_topic_score_gemma":0.0009722455,"domain_scores_codex":[0.9990852,0.0002508188,0.00004463585,0.0002387173,0.0002438582,0.0001366736],"domain_scores_gemma":[0.9910597,0.006114217,0.0004185557,0.001171515,0.0005815943,0.0006543901],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002728968,0.00007292064,0.001044764,0.000158571,0.00002556011,0.0001233783,0.0005727082,0.006344839,0.002837285,0.9319465,0.007837155,0.04876337],"study_design_scores_gemma":[0.00005376244,0.00002812587,0.0001899703,0.00002111923,0.00001440783,0.0001065378,0.0001538088,0.02055756,0.001115379,0.9710245,0.006726224,0.000008564468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2094701,0.0009170347,0.6696779,0.004014631,0.0004166704,0.0002474836,0.0005945945,0.001059914,0.1136017],"genre_scores_gemma":[0.8041713,0.001236339,0.1408891,0.00124854,0.0003093452,0.00024678,0.000734738,0.0006134869,0.05055054],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01643393,"threshold_uncertainty_score":0.05497694,"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","authors":[{"name":"Andrew Wei Xu","is_ca":true},{"name":"David Sankoff","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008631048,0.001273888,0.001332375,0.001522726,0.0008491239,0.001794236,0.001976416,0.001231928,0.01484182],"category_scores_gemma":[0.007689707,0.001148219,0.001257865,0.002062638,0.0009197403,0.003304001,0.00282197,0.003036201,0.002158064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001057355,"about_ca_system_score_gemma":0.0007855424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001736806,"about_ca_topic_score_gemma":0.002651275,"domain_scores_codex":[0.9994969,0.0001246636,0.00002201654,0.0001314675,0.0001402117,0.00008466212],"domain_scores_gemma":[0.9979849,0.00123179,0.0001971189,0.0002704868,0.0001763238,0.0001394072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005143707,0.0002179882,0.0007429649,0.0004494301,0.00009326535,0.0001864468,0.0005557814,0.3100951,0.007812405,0.3711043,0.03500821,0.2732196],"study_design_scores_gemma":[0.00006770624,0.00003982257,0.000182902,0.00003937567,0.00002078556,0.0000821093,0.0001429704,0.3782583,0.001139642,0.6137272,0.006282971,0.00001626103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03764629,0.0006866903,0.9437317,0.000589783,0.0001505348,0.0001218357,0.0004602456,0.0007188389,0.01589412],"genre_scores_gemma":[0.2061884,0.001088442,0.7712781,0.0003269703,0.0001609328,0.0003770022,0.00157246,0.000833281,0.01817432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01484182,"threshold_uncertainty_score":0.04965085,"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","authors":[{"name":"Chunfang Zheng","is_ca":true},{"name":"David Sankoff","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002181928,0.0008207529,0.0008869692,0.002050245,0.001532781,0.001398795,0.002160803,0.001253318,0.008660936],"category_scores_gemma":[0.009253174,0.0006415754,0.0009617392,0.002331432,0.001714197,0.003373294,0.003641714,0.002345934,0.002362693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001130112,"about_ca_system_score_gemma":0.001440904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003313835,"about_ca_topic_score_gemma":0.005003103,"domain_scores_codex":[0.9989436,0.0004747405,0.00004147427,0.0001980766,0.0002676975,0.00007447514],"domain_scores_gemma":[0.9962866,0.002090331,0.0002218979,0.0008470333,0.0003940277,0.0001601219],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003716851,0.0001476078,0.001455861,0.0002872597,0.00007916675,0.0002304477,0.0007240737,0.2979069,0.01060801,0.3510941,0.00722886,0.3298661],"study_design_scores_gemma":[0.00006795024,0.0001436838,0.0003529819,0.00004795157,0.00002283923,0.000144014,0.00009768918,0.5934967,0.003814361,0.3785308,0.02323222,0.00004876173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006703294,0.00017492,0.9901869,0.0003157846,0.00002934217,0.00006625243,0.0001127587,0.0007078816,0.001702916],"genre_scores_gemma":[0.0596072,0.0002870419,0.936177,0.0001688197,0.00006462877,0.0002855171,0.000510204,0.0004774773,0.002422062],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008660936,"threshold_uncertainty_score":0.02897376,"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","authors":[{"name":"Nadia El-Mabrouk","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000892984,0.0004123398,0.0007244591,0.001565448,0.0006837949,0.0009965309,0.00117725,0.001029637,0.002509773],"category_scores_gemma":[0.004429015,0.0008407796,0.001133261,0.001221685,0.0006540783,0.001025621,0.0007107517,0.001264417,0.0005097885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005468318,"about_ca_system_score_gemma":0.00068052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001570665,"about_ca_topic_score_gemma":0.002228823,"domain_scores_codex":[0.999783,0.00005748178,0.00001626004,0.00007948244,0.00003691411,0.00002687391],"domain_scores_gemma":[0.9988564,0.0007053713,0.00008939969,0.000196091,0.00009734741,0.00005534757],"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.001619733,0.0001908521,0.02633925,0.0003753182,0.0002619993,0.00107062,0.0008475505,0.5318074,0.07729416,0.05196447,0.001614602,0.306614],"study_design_scores_gemma":[0.0001104917,0.0001481012,0.003143891,0.0000273812,0.0001192441,0.0004358867,0.0002283407,0.945695,0.01410341,0.03377555,0.002174866,0.00003779359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5904153,0.0002102126,0.4057472,0.0003176227,0.0000516133,0.00005944582,0.0003744669,0.001248911,0.001575266],"genre_scores_gemma":[0.7188681,0.0001953296,0.278377,0.00006291785,0.0000295665,0.00004758029,0.0008896856,0.0003098946,0.001219932],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002509773,"threshold_uncertainty_score":0.008396029,"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","authors":[{"name":"Aïda Ouangraoua","is_ca":true},{"name":"Éric Tannier","is_ca":true},{"name":"Cédric Chauve","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003484202,0.0003655123,0.0003074821,0.001815879,0.0004677198,0.0008911717,0.0005876597,0.000647059,0.001919816],"category_scores_gemma":[0.002074204,0.000453421,0.0006569865,0.00147306,0.0003355046,0.0006206805,0.0008112558,0.0006153496,0.0008852354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004428709,"about_ca_system_score_gemma":0.0007901761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005480462,"about_ca_topic_score_gemma":0.006064324,"domain_scores_codex":[0.9998652,0.00001897095,0.000007888425,0.00006302137,0.00002779646,0.00001720029],"domain_scores_gemma":[0.9996213,0.0001495479,0.00006264938,0.00005557339,0.00007140687,0.0000395206],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007367115,0.000166221,0.3263237,0.001141928,0.000489672,0.001423396,0.001954956,0.2154615,0.3125139,0.01334386,0.006664794,0.1197794],"study_design_scores_gemma":[0.0001173332,0.0002894626,0.3519313,0.0003139775,0.000522011,0.001982787,0.001275297,0.5276899,0.05349096,0.0332114,0.02904456,0.0001308636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9047986,0.0006022651,0.08029366,0.0003140727,0.00001831422,0.00003580826,0.008488609,0.002410633,0.003038044],"genre_scores_gemma":[0.8001832,0.0006248081,0.1683994,0.0001308341,0.00001963822,0.00007263425,0.02908859,0.0005996382,0.0008812845],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005480462,"threshold_uncertainty_score":0.01089716,"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","authors":[{"name":"Wayne S. Kendal","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001692293,0.0001176692,0.000175064,0.0008537515,0.000244577,0.0003307604,0.0002308943,0.000236168,0.001158929],"category_scores_gemma":[0.001212065,0.0001270767,0.0002205294,0.0005824022,0.0006126734,0.0001882117,0.0002621251,0.0002279179,0.0003138527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004356517,"about_ca_system_score_gemma":0.000258285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001179267,"about_ca_topic_score_gemma":0.001107477,"domain_scores_codex":[0.999792,0.00002721932,0.000007365857,0.00007949505,0.00006909358,0.0000247205],"domain_scores_gemma":[0.9992694,0.0002976875,0.0001786908,0.0000805176,0.0001373931,0.00003637397],"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.0006693525,0.00006749124,0.2565402,0.0003315672,0.0002330629,0.001741332,0.0007481138,0.02297499,0.6406651,0.01208664,0.001927335,0.06201477],"study_design_scores_gemma":[0.00007970302,0.0003649827,0.7736281,0.00004233532,0.0001657575,0.004208062,0.0003871605,0.08286594,0.1142049,0.01857428,0.005392564,0.00008617391],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9835389,0.0003141905,0.01417608,0.00007701132,0.000006660006,0.00001676292,0.0002436235,0.0001019491,0.001524744],"genre_scores_gemma":[0.9935638,0.00006908959,0.005621365,0.00002726176,0.000007421614,0.00001230533,0.0003694,0.00001464298,0.0003145235],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001179267,"threshold_uncertainty_score":0.003876984,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}