{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":49,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":49,"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":"6edd568916c6","filters":{"venue":"Algorithms for Molecular Biology"}},"results":[{"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":"W2040607633","doi":"10.1186/1748-7188-7-3","title":"MRL and SuperFine+MRL: new supertree methods","year":2012,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; John Simon Guggenheim Memorial Foundation; National Science Foundation","keywords":"Supertree; Heuristics; Matrix representation; Heuristic; Matrix (chemical analysis); Tree (set theory); Representation (politics); Set (abstract data type); Computer science; Algorithm; Range (aeronautics); Mathematical optimization; Mathematics; Combinatorics; Artificial intelligence; Biology; Phylogenetic tree; Engineering; Chemistry","authors":[{"name":"Nam Nguyen","is_ca":false},{"name":"Siavash Mirarab","is_ca":false},{"name":"Tandy Warnow","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0268640034925042,"gpt":0.3475609793836081,"spread":0.3206969758911039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006875926,0.001795895,0.001622824,0.005455595,0.001593195,0.002674665,0.004865044,0.002923847,0.009882542],"category_scores_gemma":[0.02258525,0.001330651,0.002975983,0.00437537,0.001486377,0.007684549,0.003890775,0.004573819,0.004703972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001927613,"about_ca_system_score_gemma":0.002210656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002946933,"about_ca_topic_score_gemma":0.006165359,"domain_scores_codex":[0.9951386,0.002161043,0.0002739779,0.0009006159,0.001326406,0.0001992629],"domain_scores_gemma":[0.9822801,0.01044204,0.001594199,0.002952041,0.002271346,0.0004604004],"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.0003386783,0.0002226067,0.004745099,0.001105417,0.0004460147,0.0003713994,0.0008662182,0.1868826,0.007113055,0.06251036,0.03033712,0.7050614],"study_design_scores_gemma":[0.00009543187,0.00008929882,0.0008675513,0.0001566018,0.0000827257,0.0003848869,0.0001410295,0.8601162,0.003065268,0.1082784,0.02663726,0.00008540193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004989733,0.0009843371,0.9868412,0.0005192261,0.00007604611,0.0001074465,0.00058466,0.004311346,0.00158598],"genre_scores_gemma":[0.02965098,0.0003552544,0.9651207,0.0004555629,0.0001150399,0.0002583604,0.001577412,0.001539366,0.0009273072],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009882542,"threshold_uncertainty_score":0.03636384,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163879391","doi":"10.1186/s13015-015-0033-9","title":"Algorithmic approaches to protein-protein interaction site prediction","year":2015,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":64,"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":"Computer science; Identification (biology); Field (mathematics); Data science; Machine learning; Artificial intelligence; Data mining; Biology","authors":[{"name":"Tristan Aumentado‐Armstrong","is_ca":true},{"name":"Bogdan Istrate","is_ca":true},{"name":"Robert A. Murgita","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1352234967624475,"gpt":0.3403664008324722,"spread":0.2051429040700247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004228677,0.001406038,0.001735509,0.003524324,0.0009345525,0.002716043,0.003875649,0.001887206,0.001690256],"category_scores_gemma":[0.01577086,0.0008872988,0.001230131,0.004352605,0.001283161,0.002735759,0.002409909,0.002236186,0.0008236709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001099066,"about_ca_system_score_gemma":0.002225666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002456046,"about_ca_topic_score_gemma":0.003006608,"domain_scores_codex":[0.9975277,0.001021616,0.0002408533,0.0004173277,0.0006792612,0.0001133224],"domain_scores_gemma":[0.9915706,0.006649136,0.0003682206,0.0005537312,0.0007361382,0.0001221327],"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.000066515,0.0001536054,0.002478807,0.000522938,0.0001426914,0.00006465461,0.0000801333,0.7625976,0.0007473103,0.05592884,0.003254531,0.1739624],"study_design_scores_gemma":[0.00001824156,0.00002922877,0.0002500285,0.00003224321,0.00001682269,0.00004699581,0.00002428184,0.9305039,0.0004065552,0.06684612,0.001813971,0.00001171836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005298174,0.001709748,0.9906007,0.0003277315,0.00003089038,0.00009385296,0.0002768311,0.0004126947,0.001249412],"genre_scores_gemma":[0.08918346,0.003219244,0.903441,0.0002112218,0.000186762,0.0006277949,0.00218763,0.0001203572,0.0008225946],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004228677,"threshold_uncertainty_score":0.02236366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132081807","doi":"10.1186/1748-7188-5-5","title":"Fast prediction of RNA-RNA interaction","year":2010,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":52,"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":"Mitacs; Bundesministerium für Bildung und Forschung; Deutsche Forschungsgemeinschaft; Michael Smith Health Research BC","keywords":"Computer science; RNA; Heuristic; Set (abstract data type); Computational biology; Translation (biology); Class (philosophy); Variety (cybernetics); Nucleic acid structure; Non-coding RNA; Theoretical computer science; Algorithm; Machine learning; Data mining; Artificial intelligence; Messenger RNA; Gene; Biology; Genetics","authors":[{"name":"Raheleh Salari","is_ca":true},{"name":"Rolf Backofen","is_ca":true},{"name":"S. Cenk Şahinalp","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01154169645432993,"gpt":0.2749254580283451,"spread":0.2633837615740152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008610979,0.001145111,0.001183617,0.001276335,0.0005873353,0.0007488785,0.001470311,0.001624338,0.002322556],"category_scores_gemma":[0.003635054,0.0005130982,0.0005957672,0.001110443,0.0004273769,0.0008723771,0.0005598064,0.0008876167,0.001249424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006923503,"about_ca_system_score_gemma":0.0009784801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002197823,"about_ca_topic_score_gemma":0.002575697,"domain_scores_codex":[0.9993845,0.000140129,0.00002749736,0.0001841251,0.0002098153,0.00005391624],"domain_scores_gemma":[0.9972683,0.001786226,0.0002262613,0.0002168831,0.0004099239,0.00009241096],"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.0006532312,0.0003108142,0.009575048,0.0002768969,0.0001676721,0.0002963279,0.00005883219,0.7559415,0.02493972,0.005185364,0.007162599,0.1954319],"study_design_scores_gemma":[0.0000219323,0.00002507236,0.0006894579,0.000003040386,0.000008010451,0.00006130669,0.000005767406,0.9910487,0.005338572,0.002334811,0.0004561767,0.000007160696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1468313,0.0005595079,0.8446221,0.0001564173,0.00004211633,0.0001029136,0.0007725426,0.005390802,0.001522309],"genre_scores_gemma":[0.4370999,0.0001817692,0.5579763,0.00007499187,0.00003654477,0.0001969629,0.00265202,0.0002341309,0.001547451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002322556,"threshold_uncertainty_score":0.007769704,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2339182468","doi":"10.1186/s13015-016-0067-7","title":"The link between orthology relations and gene trees: a correction perspective","year":2016,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genomics and Phylogenetic Studies","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":"Université de Montréal; Computer Research Institute of Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Tree (set theory); Converse; Set (abstract data type); Phylogenetic tree; Relation (database); Tree rearrangement; Gene; Perspective (graphical); Computer science; Similarity (geometry); Computational biology; Combinatorics; Biology; Mathematics; Genetics; Data mining; Artificial intelligence","authors":[{"name":"Manuel Lafond","is_ca":true},{"name":"Riccardo Dondi","is_ca":false},{"name":"Nadia El-Mabrouk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01188667940743771,"gpt":0.2770982739300388,"spread":0.2652115945226011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006479628,0.0008908347,0.001211008,0.001218063,0.001569665,0.00291017,0.004047457,0.00272797,0.005534007],"category_scores_gemma":[0.04270734,0.0006312245,0.001642537,0.002610408,0.004756732,0.008101103,0.003381284,0.006602511,0.0007223113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002570709,"about_ca_system_score_gemma":0.001880735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002694204,"about_ca_topic_score_gemma":0.001895993,"domain_scores_codex":[0.9922957,0.002883894,0.0004864375,0.002019854,0.001969037,0.0003451088],"domain_scores_gemma":[0.9222344,0.06010595,0.00397185,0.009903073,0.002882466,0.0009022002],"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.0005824937,0.0002591996,0.008170402,0.001268276,0.0001746543,0.001070543,0.001577815,0.1697232,0.01183102,0.5360786,0.01231299,0.2569509],"study_design_scores_gemma":[0.00006976187,0.00009629921,0.001078511,0.000116078,0.00009940915,0.001465724,0.0003014598,0.2443345,0.01159925,0.7128614,0.02791616,0.000061492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03221611,0.001311883,0.9536955,0.007075261,0.0002006261,0.0001224822,0.0003042865,0.0006979074,0.004376032],"genre_scores_gemma":[0.4207141,0.001240497,0.569259,0.001186352,0.0004802305,0.0001943606,0.0009622823,0.0006549597,0.005308137],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006479628,"threshold_uncertainty_score":0.03426802,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965359119","doi":"10.1186/1748-7188-6-23","title":"ReCoil - an algorithm for compression of extremely large datasets of dna data","year":2011,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Data compression; Redundancy (engineering); Algorithm; Encoding (memory); Compression (physics); Volume (thermodynamics); Data compression ratio; Lossless compression; Compression ratio; Sequence (biology); Data mining; Image compression; Artificial intelligence; Biology; Physics","authors":[{"name":"Vladimir Yanovsky","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1004202575440594,"gpt":0.3489168214591663,"spread":0.2484965639151069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008921148,0.001077848,0.000677414,0.001671132,0.0007472382,0.001313506,0.001433713,0.0009189962,0.003210205],"category_scores_gemma":[0.003529226,0.000371209,0.0006262138,0.002134346,0.0007154148,0.001947244,0.001478166,0.001427954,0.002221529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005089333,"about_ca_system_score_gemma":0.0007632228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008228245,"about_ca_topic_score_gemma":0.001034855,"domain_scores_codex":[0.9991944,0.00008505272,0.00009562844,0.0001401242,0.0004215297,0.00006324489],"domain_scores_gemma":[0.9987438,0.0004818324,0.0001294765,0.0002732238,0.000326083,0.00004558335],"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.0006719611,0.0001318007,0.001512824,0.0004115705,0.0001012566,0.0003824309,0.0003780956,0.02956651,0.07874899,0.02233595,0.0179166,0.8478421],"study_design_scores_gemma":[0.0002282465,0.0004014613,0.001756431,0.0001280813,0.0000649136,0.001940447,0.0002125974,0.5980841,0.3018737,0.02373678,0.07145295,0.0001202701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01121667,0.0008912312,0.9815403,0.0001986695,0.0001191556,0.0001419781,0.0003397593,0.004326735,0.001225478],"genre_scores_gemma":[0.05098758,0.0007941766,0.9413339,0.0001348529,0.00007784322,0.0003526822,0.001749144,0.0006590328,0.003910717],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003210205,"threshold_uncertainty_score":0.01073927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2965510019","doi":"10.1186/s13015-019-0152-9","title":"A multi-labeled tree dissimilarity measure for comparing “clonal trees” of tumor progression","year":2019,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Cancer Genomics and Diagnostics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":36,"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":"National Institute of General Medical Sciences; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; National Science Foundation","keywords":"clone (Java method); Tree (set theory); Measure (data warehouse); Vertex (graph theory); Mutation; Biology; Computational biology; Computer science; Granularity; Combinatorics; Mathematics; Genetics; Gene; Data mining; Graph","authors":[{"name":"Nikolai Karpov","is_ca":false},{"name":"Md. Khaledur Rahman","is_ca":false},{"name":"S. Cenk Şahinalp","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0228347557084764,"gpt":0.3166128142024556,"spread":0.2937780584939791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001547832,0.0004506954,0.0008872912,0.004801199,0.0007152645,0.001457922,0.00127951,0.001075956,0.001315561],"category_scores_gemma":[0.008541027,0.0002340559,0.0008667624,0.003394957,0.0008910613,0.002934256,0.001367133,0.001042042,0.0002839343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00125398,"about_ca_system_score_gemma":0.0006267262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001170895,"about_ca_topic_score_gemma":0.001650244,"domain_scores_codex":[0.9983605,0.0003346872,0.0001604852,0.0004006056,0.0006195863,0.0001241692],"domain_scores_gemma":[0.9953912,0.001888096,0.0009125606,0.0005918719,0.0008466393,0.0003695416],"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.0006994897,0.0004016554,0.03932396,0.0006670174,0.0004334803,0.0004698194,0.0007122126,0.2781038,0.08116603,0.1502837,0.006574357,0.4411644],"study_design_scores_gemma":[0.00003214733,0.0002931346,0.01297402,0.00004682029,0.0000600266,0.000731241,0.0001677318,0.8778915,0.01067331,0.09007011,0.00697328,0.00008658177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1051405,0.0005760584,0.8914808,0.000145817,0.00007156905,0.00008020223,0.0006231469,0.0003612749,0.00152059],"genre_scores_gemma":[0.5353949,0.000227917,0.4612284,0.0001066257,0.0001357025,0.0001619372,0.001695989,0.0001648758,0.0008836673],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004801199,"threshold_uncertainty_score":0.009098291,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117719890","doi":"10.1186/s13015-015-0054-4","title":"Inferring interaction type in gene regulatory networks using co-expression data","year":2015,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Toronto","funders":"Canadian Institutes of Health Research; National Center for Research Resources; Institute for Research in Fundamental Sciences; National Institute of General Medical Sciences; Directorate for Biological Sciences; National Institutes of Health","keywords":"Gene regulatory network; Computer science; Benchmark (surveying); Computational biology; Systems biology; In silico; Data type; Genomics; Data mining; Biological network; Gene; Genome; Biology; Gene expression; Genetics","authors":[{"name":"Pegah Khosravi","is_ca":true},{"name":"Vahid Gazestani","is_ca":true},{"name":"Leila Pirhaji","is_ca":false},{"name":"Brian K. Law","is_ca":true},{"name":"Mehdi Sadeghi","is_ca":false},{"name":"Bahram Goliaei","is_ca":false},{"name":"Gary D. Bader","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06669697343404381,"gpt":0.356877915823286,"spread":0.2901809423892422,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001653571,0.0007053327,0.000458221,0.002658172,0.0004713096,0.0008363262,0.0007512834,0.0006471968,0.0008590455],"category_scores_gemma":[0.006584062,0.0002811567,0.0007499863,0.001590921,0.0006652302,0.0009899325,0.0005583288,0.0008025763,0.0003467998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000832766,"about_ca_system_score_gemma":0.0005559529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002654001,"about_ca_topic_score_gemma":0.004365096,"domain_scores_codex":[0.9988808,0.0003917099,0.00005672852,0.0003791733,0.0002272909,0.00006435766],"domain_scores_gemma":[0.9942636,0.004393484,0.0005877105,0.000351904,0.0003091696,0.00009407197],"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.0007713122,0.0002655593,0.1597319,0.0005575622,0.0003678156,0.0003376325,0.000335328,0.5780657,0.06471255,0.01206954,0.001348231,0.1814368],"study_design_scores_gemma":[0.00001050961,0.00002977138,0.009504589,0.00001755167,0.00003911568,0.0001149185,0.00006010245,0.9596106,0.01832519,0.01128988,0.0009816698,0.0000160348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3125775,0.0006300165,0.6822113,0.0001903893,0.00001764372,0.0000826975,0.001255764,0.001160646,0.001874052],"genre_scores_gemma":[0.7679157,0.0003398814,0.2285147,0.00005370048,0.0000164004,0.00006976225,0.002483619,0.00006127631,0.0005449168],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002658172,"threshold_uncertainty_score":0.008745015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104168759","doi":"10.1186/1748-7188-7-6","title":"Computing evolutionary distinctiveness indices in large scale analysis","year":2012,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Evolution and Paleontology Studies","field":"Earth and Planetary Sciences","cited_by":28,"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":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada; Isaac Newton Institute for Mathematical Sciences","keywords":"Optimal distinctiveness theory; Phylogenetic tree; Taxon; Extinction (optical mineralogy); Endangered species; Supertree; Clade; Evolutionary biology; Sister group; Tree (set theory); Set (abstract data type); Biology; Computer science; Ecology; Combinatorics; Mathematics; Paleontology","authors":[{"name":"Iain Martyn","is_ca":true},{"name":"Arne Ø. Mooers","is_ca":true},{"name":"Vincent Moulton","is_ca":false},{"name":"Andreas Spillner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.015726275067789,"gpt":0.2905335002008223,"spread":0.2748072251330333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005226947,0.0009638453,0.001140181,0.003283217,0.0008204487,0.002045739,0.001778498,0.000904682,0.002153255],"category_scores_gemma":[0.02029792,0.0005714399,0.00104766,0.002881007,0.001512905,0.002963649,0.002760045,0.001561273,0.0005093021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001213642,"about_ca_system_score_gemma":0.001079053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001471629,"about_ca_topic_score_gemma":0.002405535,"domain_scores_codex":[0.9981948,0.0007662593,0.0001296961,0.0003456806,0.0004423845,0.0001211694],"domain_scores_gemma":[0.9850904,0.01099205,0.001184136,0.001537363,0.0007426669,0.0004533995],"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.0002829125,0.0002122046,0.02188387,0.0001986347,0.0002544014,0.0002294435,0.0003629319,0.5440601,0.006405225,0.04522309,0.003185519,0.3777018],"study_design_scores_gemma":[0.00002241094,0.00003946009,0.001308528,0.000007720794,0.00001252381,0.00003093353,0.00004616798,0.9342855,0.0007522469,0.06309184,0.0003894166,0.00001311793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06234303,0.0001841724,0.9353372,0.0001590749,0.00002229059,0.000064106,0.0001533069,0.001004102,0.0007327048],"genre_scores_gemma":[0.367281,0.000082766,0.6312091,0.00007507059,0.00004353392,0.0001845473,0.0005326098,0.000118904,0.0004725702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005226947,"threshold_uncertainty_score":0.02764302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133004689","doi":"10.1186/1748-7188-3-16","title":"HuMiTar: A sequence-based method for prediction of human microRNA targets","year":2008,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"MicroRNA in disease regulation","field":"Biochemistry, Genetics and Molecular Biology","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; National Natural Science Foundation of China","keywords":"Computational biology; False positive paradox; Untranslated region; microRNA; Biology; Computer science; Base pair; Sequence (biology); Gene; Pairing; Function (biology); Messenger RNA; Genetics; Data mining; Bioinformatics; Artificial intelligence; Physics","authors":[{"name":"Jishou Ruan","is_ca":true},{"name":"Hanzhe Chen","is_ca":false},{"name":"Lukasz Kurgan","is_ca":true},{"name":"Ke Chen","is_ca":true},{"name":"Chunsheng Kang","is_ca":false},{"name":"Peiyu Pu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03353231989561144,"gpt":0.3287654067019258,"spread":0.2952330868063144,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00165556,0.001510648,0.001026759,0.002608147,0.0005270342,0.0008564893,0.001473905,0.001271013,0.005326834],"category_scores_gemma":[0.003368692,0.0004767494,0.001268341,0.001104305,0.0004308418,0.0005885583,0.0007537672,0.0008595229,0.001744101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006236899,"about_ca_system_score_gemma":0.001049072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002451888,"about_ca_topic_score_gemma":0.003696411,"domain_scores_codex":[0.9991289,0.0003003047,0.00005567802,0.00021804,0.0002386876,0.00005851769],"domain_scores_gemma":[0.9988744,0.0007760796,0.0001108011,0.00007255822,0.0001254142,0.00004068331],"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.001326754,0.0002710645,0.009493862,0.0006417898,0.0005588623,0.0006599455,0.0001708231,0.3192081,0.02990867,0.006470635,0.02130452,0.6099851],"study_design_scores_gemma":[0.00004343333,0.00007007849,0.0008237208,0.00001811558,0.00003518848,0.0001660151,0.00001852517,0.9875993,0.005951607,0.002163883,0.003087172,0.00002298325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0369081,0.0008513545,0.9292914,0.0001973908,0.0000804724,0.0002562185,0.002009046,0.02804948,0.002356616],"genre_scores_gemma":[0.1671552,0.0002837701,0.8253583,0.0002725263,0.00004540169,0.000580008,0.003073141,0.001143531,0.002088152],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005326834,"threshold_uncertainty_score":0.01782006,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2940808208","doi":"10.1186/s13015-019-0139-6","title":"Reconciling multiple genes trees via segmental duplications and losses","year":2019,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Computer Research Institute of Montréal; Université de Montréal; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Gene duplication; Segmental duplication; Tree (set theory); Genome; Gene; Set (abstract data type); Time complexity; Computer science; Computational biology; Biology; Gene family; Algorithm; Mathematics; Genetics; Combinatorics","authors":[{"name":"Riccardo Dondi","is_ca":false},{"name":"Manuel Lafond","is_ca":true},{"name":"Céline Scornavacca","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01218585346680486,"gpt":0.2636286312657858,"spread":0.251442777798981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003101662,0.001333755,0.001766729,0.002872509,0.002102084,0.002346258,0.003126131,0.002569058,0.003466282],"category_scores_gemma":[0.01074823,0.0008115461,0.002546472,0.003498227,0.001273028,0.005292403,0.002923707,0.003240408,0.001416233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001651343,"about_ca_system_score_gemma":0.001645251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002559575,"about_ca_topic_score_gemma":0.00399346,"domain_scores_codex":[0.9979772,0.0005579354,0.0001230911,0.0008534029,0.0003142097,0.0001741876],"domain_scores_gemma":[0.9950722,0.002694464,0.0004570328,0.001223661,0.0003550139,0.0001975871],"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.00147668,0.0003830373,0.03157804,0.001254444,0.0006575361,0.002057439,0.002493491,0.3837783,0.02379269,0.07134378,0.03797301,0.4432116],"study_design_scores_gemma":[0.0001594147,0.0001158779,0.004633347,0.0001154295,0.0002368743,0.00136045,0.001145032,0.7741045,0.01270072,0.1738282,0.03152061,0.00007948671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3378595,0.004067311,0.6317744,0.0042654,0.0003856922,0.0003536999,0.006424091,0.008707343,0.006162577],"genre_scores_gemma":[0.5072854,0.0007791675,0.4689094,0.0008857854,0.0001799677,0.0002445593,0.01707913,0.001275773,0.003360916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003466282,"threshold_uncertainty_score":0.01640338,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978336838","doi":"10.1186/1748-7188-5-39","title":"Sparsification of RNA structure prediction including pseudoknots","year":2010,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":22,"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":"SFU Community Trust Endowment Fund; Natural Sciences and Engineering Research Council of Canada; Mitacs; Deutsche Forschungsgemeinschaft; Michael Smith Health Research BC","keywords":"Computer science; Computational biology; Data mining; Biology","authors":[{"name":"Mathias Möhl","is_ca":false},{"name":"Raheleh Salari","is_ca":true},{"name":"Sebastian Will","is_ca":false},{"name":"Rolf Backofen","is_ca":false},{"name":"S. Cenk Şahinalp","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.016752117223053,"gpt":0.2882554310040272,"spread":0.2715033137809743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006805852,0.0005326787,0.000623235,0.0003543487,0.0002377429,0.0004490908,0.0008039713,0.0006714423,0.001631721],"category_scores_gemma":[0.002770296,0.0002664695,0.0006371141,0.0004218336,0.0007136539,0.0009616718,0.0008497147,0.0008718004,0.0004881314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003004645,"about_ca_system_score_gemma":0.0006956304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001734378,"about_ca_topic_score_gemma":0.001759645,"domain_scores_codex":[0.9996746,0.0001050104,0.00001837241,0.00007487743,0.00009304137,0.00003415432],"domain_scores_gemma":[0.9978251,0.001422197,0.000178181,0.0003500521,0.0001607182,0.00006372634],"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.0002641487,0.00006869813,0.001674902,0.0001839176,0.00004935571,0.0001979568,0.0001610691,0.8175046,0.02152788,0.01298874,0.0009080148,0.1444708],"study_design_scores_gemma":[0.000008215125,0.00002160323,0.0001730764,0.000005894897,0.000003445567,0.00004358935,0.00001086269,0.9876792,0.005655064,0.006010697,0.0003844585,0.000004014859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0610745,0.0001299182,0.9369856,0.0001082553,0.00001449101,0.00003394239,0.00006638811,0.0006594481,0.0009274891],"genre_scores_gemma":[0.4237371,0.000225598,0.5737571,0.00006902585,0.00004436306,0.0001054922,0.0005677876,0.0001412684,0.001352342],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001734378,"threshold_uncertainty_score":0.005458593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089039157","doi":"10.1186/1748-7188-3-1","title":"Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability","year":2008,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Polynomial; Time complexity; Data science; Algorithm; Mathematics","authors":[{"name":"Gang Wu","is_ca":true},{"name":"Ming‐Yang Kao","is_ca":false},{"name":"Guohui Lin","is_ca":true},{"name":"Jia-Huai You","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01217716393102334,"gpt":0.2379344202067291,"spread":0.2257572562757058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00346537,0.000871464,0.001299593,0.0007427743,0.0009750262,0.001992068,0.002065501,0.001456861,0.003068471],"category_scores_gemma":[0.01909626,0.0005595773,0.001495298,0.001255366,0.001195792,0.003012011,0.001798682,0.002244352,0.001366705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00136438,"about_ca_system_score_gemma":0.00257575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002469405,"about_ca_topic_score_gemma":0.003238537,"domain_scores_codex":[0.9973012,0.0006044435,0.0002017795,0.000654867,0.000971937,0.0002659296],"domain_scores_gemma":[0.9717235,0.02062641,0.0017611,0.003875153,0.001411432,0.0006025101],"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.001208001,0.0003834876,0.01631897,0.0008049202,0.0002279614,0.0005295329,0.0007205277,0.7170675,0.02683672,0.02218099,0.005470005,0.2082515],"study_design_scores_gemma":[0.0000515216,0.00004674812,0.0007745782,0.00001216264,0.00002067609,0.0002237906,0.00004214417,0.9799562,0.003566512,0.01455858,0.0007333563,0.00001373079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09027831,0.0003797229,0.9044914,0.0005351148,0.00003894853,0.00007808558,0.0002666446,0.002482574,0.00144918],"genre_scores_gemma":[0.5515291,0.0003214662,0.4443842,0.0002383379,0.00008086288,0.0002207543,0.001315759,0.0004665361,0.001443011],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00346537,"threshold_uncertainty_score":0.01832682,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2592818772","doi":"10.1186/s13015-017-0096-x","title":"Approximating the correction of weighted and unweighted orthology and paralogy relations","year":2017,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":22,"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":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Maximization; Mathematics; Conjecture; Converse; Approximation algorithm; Graph; Tree (set theory); Satisfiability; Discrete mathematics; Mathematical optimization","authors":[{"name":"Riccardo Dondi","is_ca":false},{"name":"Manuel Lafond","is_ca":true},{"name":"Nadia El-Mabrouk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01396313623744828,"gpt":0.2910071363754212,"spread":0.2770440001379729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002949107,0.001095272,0.001303462,0.001145224,0.0009055858,0.001721416,0.004200686,0.002076741,0.004673067],"category_scores_gemma":[0.02222472,0.0007999833,0.001729366,0.002098175,0.001687114,0.005155816,0.002365332,0.002188852,0.0005525669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002876536,"about_ca_system_score_gemma":0.002146909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008793586,"about_ca_topic_score_gemma":0.009922403,"domain_scores_codex":[0.9971455,0.0007656392,0.000152485,0.001020566,0.0005189949,0.0003968525],"domain_scores_gemma":[0.9820294,0.0123702,0.00176008,0.002212563,0.001163592,0.0004640882],"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.0007346104,0.0002694112,0.006202093,0.0004841602,0.000127853,0.000292533,0.0005025981,0.8054592,0.007949971,0.03804979,0.005183961,0.1347438],"study_design_scores_gemma":[0.0000490366,0.00006903106,0.0006183683,0.0000195282,0.00003874449,0.0001691231,0.0001264024,0.9470967,0.003870045,0.04705356,0.0008756497,0.00001376553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2818072,0.0004978069,0.7104416,0.001583229,0.0000871162,0.0001998751,0.0006762001,0.001567945,0.003139065],"genre_scores_gemma":[0.5369205,0.0001745066,0.4570745,0.0002946078,0.00006893063,0.0001317384,0.001429718,0.0003762622,0.003529314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008793586,"threshold_uncertainty_score":0.0208708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2339509753","doi":"10.1186/s13015-016-0071-y","title":"Sparse RNA folding revisited: space-efficient minimum free energy structure prediction","year":2016,"lang":"en","type":"review","venue":"Algorithms for Molecular Biology","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Institute for Nanotechnology","funders":"German Network for Bioinformatics Infrastructure; Universität Leipzig; Bundesministerium für Bildung und Forschung; Deutsche Forschungsgemeinschaft","keywords":"Algorithm; Computer science; Energy minimization; Folding (DSP implementation); TRACE (psycholinguistics); RNA; Bounded function; Computational complexity theory; Mathematics; Theoretical computer science; Physics","authors":[{"name":"Sebastian Will","is_ca":false},{"name":"Hosna Jabbari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01856193032896756,"gpt":0.2906377888471313,"spread":0.2720758585181637,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005182321,0.0005117535,0.0007998068,0.0004972725,0.0002891132,0.0005618901,0.0008707661,0.0008884574,0.001590399],"category_scores_gemma":[0.00249612,0.0003004433,0.0004491814,0.0005444265,0.0006331315,0.000983187,0.001033406,0.0009332067,0.0006208976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003174891,"about_ca_system_score_gemma":0.0005858417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001173765,"about_ca_topic_score_gemma":0.001187292,"domain_scores_codex":[0.9997377,0.00007174024,0.00001265671,0.00005392824,0.00009205236,0.00003203808],"domain_scores_gemma":[0.9994398,0.0002739401,0.00003870338,0.0001493998,0.00006616017,0.00003198125],"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.0003398799,0.00008361261,0.001720757,0.0002310792,0.00004123109,0.0002908863,0.0001871217,0.6852705,0.03720366,0.05442453,0.00401833,0.2161884],"study_design_scores_gemma":[0.000008049459,0.00001723493,0.0000845499,0.000006088457,0.000002156956,0.00005305788,0.000009060233,0.9832799,0.003962105,0.01192774,0.0006453588,0.000004646189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.03838526,0.00046419,0.9581763,0.0003472568,0.00003384668,0.00002435468,0.00008479454,0.0009254589,0.001558646],"genre_scores_gemma":[0.4696745,0.0005266308,0.5263203,0.0002382501,0.00005160202,0.00009271822,0.0005220222,0.0002898209,0.002284175],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.001590399,"threshold_uncertainty_score":0.00532043,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165484374","doi":"10.1186/1748-7188-7-31","title":"Gene tree correction for reconciliation and species tree inference","year":2012,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"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","keywords":"Tree rearrangement; Tree (set theory); Inference; Heuristic; Vertex (graph theory); Gene duplication; Set (abstract data type); Time complexity; Phylogenetic tree; Computer science; Phylogenetic network; Combinatorics; Phylogenomics; Biology; Mathematics; Gene; Artificial intelligence; Genetics; Graph; Clade","authors":[{"name":"Krister M. Swenson","is_ca":true},{"name":"Andrea Doroftei","is_ca":true},{"name":"Nadia El-Mabrouk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02559951857724768,"gpt":0.2857459621330662,"spread":0.2601464435558185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00322323,0.001288147,0.001233204,0.00299881,0.0018527,0.001391953,0.003379213,0.001986857,0.007573627],"category_scores_gemma":[0.01851168,0.000595337,0.002251243,0.003327831,0.001319904,0.002216854,0.001860935,0.002536778,0.002717668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00155048,"about_ca_system_score_gemma":0.002649181,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003481829,"about_ca_topic_score_gemma":0.005078745,"domain_scores_codex":[0.9976997,0.0006776887,0.0001488773,0.0007987291,0.0004729365,0.0002021169],"domain_scores_gemma":[0.9889801,0.005703604,0.001192094,0.00256554,0.001327206,0.0002315717],"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.0007345652,0.0002924494,0.01485916,0.0008892327,0.000369567,0.0006751945,0.0007018608,0.2018848,0.02042382,0.0340943,0.02289506,0.70218],"study_design_scores_gemma":[0.0001354938,0.0001237567,0.004003713,0.00006857611,0.0001061741,0.00114625,0.0001769309,0.8854189,0.02190609,0.06908522,0.01777223,0.00005666788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03028535,0.000557574,0.9612643,0.0004442587,0.0001398408,0.0001806445,0.0008381516,0.005032916,0.001256944],"genre_scores_gemma":[0.102309,0.00009278747,0.8934228,0.0001159692,0.00006134334,0.0001300928,0.002321539,0.0006005086,0.0009459499],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007573627,"threshold_uncertainty_score":0.02533633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158241520","doi":"10.1186/1748-7188-6-17","title":"A new, fast algorithm for detecting protein coevolution using maximum compatible cliques","year":2011,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University Health Network; Ontario Institute for Cancer Research; University of Toronto","funders":"","keywords":"Coevolution; Computer science; Algorithm; Data mining; Biology; Evolutionary biology","authors":[{"name":"Alex Rodionov","is_ca":true},{"name":"Alexandr Bezginov","is_ca":true},{"name":"Jonathan Rose","is_ca":true},{"name":"Elisabeth R.M. Tillier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0354444934789004,"gpt":0.2909475539826082,"spread":0.2555030605037079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001740912,0.001384156,0.001368938,0.002903497,0.001445316,0.001696619,0.003260681,0.001563607,0.00929758],"category_scores_gemma":[0.006214133,0.001026968,0.001864055,0.003239869,0.000725323,0.002775142,0.002797396,0.001760413,0.002732823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001124252,"about_ca_system_score_gemma":0.002053672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004426403,"about_ca_topic_score_gemma":0.006671683,"domain_scores_codex":[0.9985942,0.0002764336,0.00007859161,0.000425564,0.0004877343,0.0001374593],"domain_scores_gemma":[0.9977958,0.0009278135,0.0001745528,0.0004358733,0.0005007478,0.0001652581],"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.0003681178,0.0003219765,0.003494367,0.0005575888,0.0003245361,0.0002746559,0.0003259723,0.1030673,0.02833918,0.03063851,0.02786909,0.8044187],"study_design_scores_gemma":[0.0001324748,0.00006939947,0.001019439,0.00003150488,0.00004609069,0.0003595873,0.00007653004,0.944829,0.006772044,0.03172712,0.01489367,0.00004301746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005750187,0.0001366612,0.9899988,0.0001368416,0.00004633945,0.0001665444,0.0002786457,0.00234866,0.001137273],"genre_scores_gemma":[0.03316185,0.00007197261,0.9637028,0.00007433775,0.00002969334,0.0002714131,0.0008770667,0.0003673304,0.001443478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00929758,"threshold_uncertainty_score":0.03110349,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110150937","doi":"10.1186/1748-7188-5-34","title":"Predicting direct protein interactions from affinity purification mass spectrometry data","year":2010,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Probabilistic logic; Set (abstract data type); Identification (biology); Data mining; Algorithm; Sensitivity (control systems); Graph; Artificial intelligence; Theoretical computer science; Biology","authors":[{"name":"Ethan DH Kim","is_ca":true},{"name":"Ashish Sabharwal","is_ca":false},{"name":"Adrian Vetta","is_ca":true},{"name":"Mathieu Blanchette","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0173378879299586,"gpt":0.2870760176882253,"spread":0.2697381297582667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001037542,0.001188607,0.0006470355,0.002131282,0.0005009715,0.0008655521,0.001133802,0.001357197,0.001221944],"category_scores_gemma":[0.004856341,0.000425995,0.0006857371,0.001230244,0.0004802304,0.0009934201,0.0006732018,0.0008899575,0.00086652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000793159,"about_ca_system_score_gemma":0.0007406111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001765802,"about_ca_topic_score_gemma":0.002463267,"domain_scores_codex":[0.9994221,0.0001384108,0.00003743356,0.0002106414,0.0001561962,0.00003534984],"domain_scores_gemma":[0.9956793,0.003047455,0.0005984282,0.0002566063,0.0002859799,0.0001322255],"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.0006514582,0.0005581711,0.08270056,0.000623273,0.0003273232,0.0006602641,0.0001196561,0.6728584,0.08422565,0.005505159,0.002760113,0.1490099],"study_design_scores_gemma":[0.00002037182,0.00005290694,0.006543221,0.00001014181,0.00003471943,0.0002565527,0.00001955766,0.9624029,0.01947793,0.0102839,0.0008831879,0.00001461329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3198604,0.0004726483,0.673646,0.0003954264,0.0000122182,0.0001703212,0.001592964,0.002514884,0.001335213],"genre_scores_gemma":[0.676733,0.0004094493,0.3171583,0.0001062897,0.00002378382,0.0001431507,0.00438681,0.0001456371,0.0008934927],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002131282,"threshold_uncertainty_score":0.005754769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2976303698","doi":"10.1186/s13015-020-00171-4","title":"Evolution through segmental duplications and losses: a Super-Reconciliation approach","year":2020,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Data science","authors":[{"name":"Mattéo Delabre","is_ca":true},{"name":"Nadia El-Mabrouk","is_ca":true},{"name":"Katharina T. Huber","is_ca":false},{"name":"Manuel Lafond","is_ca":true},{"name":"Vincent Moulton","is_ca":false},{"name":"Emmanuel Noutahi","is_ca":true},{"name":"Miguel Sautié Castellanos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02459881913070271,"gpt":0.2817939826194368,"spread":0.2571951634887341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006283337,0.001104811,0.001694666,0.003582727,0.001326063,0.001754036,0.003837814,0.001907066,0.003641169],"category_scores_gemma":[0.01474247,0.0009017662,0.002255826,0.003983375,0.001513738,0.003784932,0.002742979,0.002320068,0.0009435865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0012119,"about_ca_system_score_gemma":0.001046585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001156129,"about_ca_topic_score_gemma":0.001395209,"domain_scores_codex":[0.9966422,0.001796943,0.0001403203,0.0007376404,0.0005012681,0.000181588],"domain_scores_gemma":[0.9896633,0.006438697,0.0007417846,0.002245925,0.0006851363,0.0002250658],"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.000810136,0.0002145113,0.008355783,0.0006029219,0.000509797,0.0007006727,0.0008651807,0.677962,0.00830077,0.0824466,0.007942196,0.2112895],"study_design_scores_gemma":[0.0000682425,0.00008140496,0.001252106,0.00004108653,0.00008674021,0.0003259678,0.0001377986,0.8757792,0.003056676,0.1145537,0.004587194,0.00002991824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0776674,0.001226824,0.915062,0.001085517,0.00008579519,0.0001892982,0.0008532783,0.001684068,0.002145946],"genre_scores_gemma":[0.4222251,0.0005487571,0.5704853,0.0004215415,0.0001653684,0.0003137636,0.003598734,0.0006186973,0.001622713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006283337,"threshold_uncertainty_score":0.03322989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3192846055","doi":"10.1186/s13015-021-00198-1","title":"INGOT-DR: an interpretable classifier for predicting drug resistance in M. tuberculosis","year":2021,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Tuberculosis Research and Epidemiology","field":"Medicine","cited_by":15,"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":"European and Developing Countries Clinical Trials Partnership; Foreign, Commonwealth and Development Office; Foreign and Commonwealth Office; Medical Research Council; Genome Canada","keywords":"Interpretability; Computer science; Machine learning; Artificial intelligence; Classifier (UML); Tuberculosis; Mycobacterium tuberculosis; Test set; Data mining; Medicine","authors":[{"name":"Hooman Zabeti","is_ca":true},{"name":"Nick Dexter","is_ca":true},{"name":"Amir Safari","is_ca":true},{"name":"Nafiseh Sedaghat","is_ca":true},{"name":"Maxwell W. Libbrecht","is_ca":true},{"name":"Leonid Chindelevitch","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03067170206095806,"gpt":0.3686188964198777,"spread":0.3379471943589196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001351433,0.001078694,0.0008211992,0.0009998326,0.0003557583,0.0008811804,0.001565909,0.001757791,0.003101824],"category_scores_gemma":[0.007024313,0.0001911402,0.0005838283,0.0004672252,0.0005500021,0.00114222,0.001187771,0.001180673,0.001252581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005517332,"about_ca_system_score_gemma":0.0008260525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002431116,"about_ca_topic_score_gemma":0.002786071,"domain_scores_codex":[0.9989447,0.0002916501,0.000069833,0.0001756668,0.0004010659,0.000117182],"domain_scores_gemma":[0.9983866,0.0008483586,0.0001806977,0.0002093391,0.0002785395,0.00009653723],"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.001261727,0.000508212,0.01688255,0.0005975303,0.0001891043,0.0008796089,0.00031823,0.2236797,0.033849,0.009118402,0.03469057,0.6780253],"study_design_scores_gemma":[0.0000530182,0.000167105,0.001107842,0.00003276177,0.00002097495,0.0002034154,0.00004881979,0.9800441,0.008297563,0.007549209,0.002452044,0.00002324822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1789174,0.001555353,0.7827756,0.002011584,0.0005015779,0.0003402256,0.003496822,0.02256999,0.007831395],"genre_scores_gemma":[0.7064009,0.0003337659,0.2835299,0.001013201,0.0002261744,0.000212297,0.004919011,0.0004638481,0.00290088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003101824,"threshold_uncertainty_score":0.01037663,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2405206615","doi":"10.1186/s13015-016-0065-9","title":"Models and algorithms for genome rearrangement with positional constraints","year":2016,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Generalization; Weighting; Set (abstract data type); Computer science; Function (biology); Polynomial; Binary number; Representation (politics); Algorithm; Time complexity; Combinatorics; Simple (philosophy); Mathematics; Biology","authors":[{"name":"Krister M. Swenson","is_ca":false},{"name":"Pijus Simonaitis","is_ca":false},{"name":"Mathieu Blanchette","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.020969453984812,"gpt":0.2789786315493447,"spread":0.2580091775645327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002416601,0.001495357,0.001468016,0.001417417,0.001241605,0.002416576,0.003952754,0.003502144,0.007754796],"category_scores_gemma":[0.01007555,0.001079342,0.00219528,0.003387735,0.00158501,0.005026689,0.002470898,0.003796372,0.001440564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00338723,"about_ca_system_score_gemma":0.002127593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004393286,"about_ca_topic_score_gemma":0.005339266,"domain_scores_codex":[0.9984071,0.0006264406,0.00007915512,0.0003955884,0.0003014666,0.0001903131],"domain_scores_gemma":[0.9936666,0.004984223,0.0004080465,0.0004304706,0.0003603215,0.0001503068],"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.00005956268,0.0000850486,0.0005306013,0.0001906484,0.00005399489,0.00005163607,0.0001418671,0.7880412,0.0003881616,0.1635463,0.004311215,0.04259986],"study_design_scores_gemma":[0.00002734943,0.00001181689,0.00005769937,0.00001687659,0.00001084087,0.00002744482,0.00002273625,0.7995043,0.0001644831,0.1982223,0.001926452,0.000007729696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006915497,0.0003737413,0.98851,0.000587783,0.00003489083,0.0000776826,0.0002073758,0.0003613478,0.002931812],"genre_scores_gemma":[0.1245904,0.000783274,0.8661587,0.0002624658,0.0001508186,0.0007226091,0.001172167,0.0003394175,0.005820074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007754796,"threshold_uncertainty_score":0.02594239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158093499","doi":"10.1186/1748-7188-7-14","title":"Ubiquity of synonymity: almost all large binary trees are not uniquely identified by their spectra or their immanantal polynomials","year":2012,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Division of Mathematical Sciences; Pacific Institute for the Mathematical Sciences; National Science Foundation","keywords":"Adjacency matrix; Combinatorics; Mathematics; Eigenvalues and eigenvectors; Laplacian matrix; Adjacency list; Binary tree; Binary number; Characteristic polynomial; Weight-balanced tree; Invariant (physics); Tree (set theory); Spectrum (functional analysis); Discrete mathematics; Polynomial; Binary search tree; Graph; Arithmetic","authors":[{"name":"F. A. Matsen","is_ca":false},{"name":"Steven N. Evans","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06327891369287991,"gpt":0.3557059889395285,"spread":0.2924270752466486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003741746,0.0003410794,0.001478297,0.002886085,0.002641998,0.003489768,0.001306125,0.001784655,0.005251603],"category_scores_gemma":[0.0509974,0.0005373827,0.0006710469,0.003471162,0.003990442,0.01021817,0.003395602,0.001811873,0.0009235246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008742698,"about_ca_system_score_gemma":0.0006819769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004867256,"about_ca_topic_score_gemma":0.0004423757,"domain_scores_codex":[0.9962389,0.0008604466,0.0002861624,0.001490611,0.0007641178,0.0003596022],"domain_scores_gemma":[0.9552104,0.02648826,0.006439702,0.008371538,0.00210386,0.001386249],"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.0009913462,0.0001952778,0.09165532,0.0009905295,0.0002644544,0.001491295,0.00500681,0.01293032,0.02102794,0.7026323,0.009894415,0.1529201],"study_design_scores_gemma":[0.00004738683,0.00008336341,0.01566347,0.0001368319,0.00008960834,0.004138531,0.001652062,0.06150084,0.006261487,0.9004328,0.009904448,0.0000890873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7884545,0.001013264,0.1975854,0.001878809,0.0001337785,0.0000504631,0.0006537318,0.0004813903,0.009748627],"genre_scores_gemma":[0.979425,0.0001940952,0.01877108,0.0001938002,0.00007425165,0.0000387951,0.0004139614,0.00009537011,0.0007936735],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005251603,"threshold_uncertainty_score":0.01978844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098784730","doi":"10.1186/1748-7188-6-16","title":"Efficient unfolding pattern recognition in single molecule force spectroscopy data","year":2011,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Force Microscopy Techniques and Applications","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Bundesministerium für Bildung und Forschung","keywords":"Bacteriorhodopsin; Pairwise comparison; Algorithm; Force spectroscopy; Molecule; Computer science; Sequence (biology); Biological system; Chemistry; Physics; Crystallography; Membrane; Artificial intelligence; Biology","authors":[{"name":"Bill Andreopoulos","is_ca":false},{"name":"Dirk Labudde","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05206492058926655,"gpt":0.3226739734357409,"spread":0.2706090528464744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001460998,0.001315429,0.001223685,0.002964691,0.0006485231,0.001438419,0.001872131,0.001697499,0.001954255],"category_scores_gemma":[0.006164027,0.0004379178,0.001181868,0.002140022,0.0005277985,0.001254707,0.0008838043,0.001200583,0.002378766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007254329,"about_ca_system_score_gemma":0.001020997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002162217,"about_ca_topic_score_gemma":0.002049316,"domain_scores_codex":[0.9987769,0.0001536754,0.0001331643,0.0004331055,0.0004092196,0.00009406084],"domain_scores_gemma":[0.9961588,0.001857517,0.0005978349,0.0005352031,0.0007046863,0.0001459575],"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.000531468,0.0004622539,0.01443153,0.0005604525,0.0002420574,0.0004526501,0.0002199605,0.102405,0.08760484,0.002250687,0.006879905,0.7839592],"study_design_scores_gemma":[0.00002472473,0.00006294982,0.003291727,0.00001718414,0.00001718968,0.0002710454,0.00005700781,0.9628299,0.02624629,0.00495061,0.002208881,0.000022501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05646852,0.0002097459,0.9264839,0.0001990899,0.00003862144,0.0002181919,0.001417722,0.01457332,0.0003908082],"genre_scores_gemma":[0.1218973,0.00008185412,0.8737593,0.00007454254,0.00002761514,0.0002166761,0.003192121,0.0003232553,0.0004274383],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002964691,"threshold_uncertainty_score":0.00772661,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1039758599","doi":"10.1186/s13015-015-0053-5","title":"Detecting conserved protein complexes using a dividing-and-matching algorithm and unequally lenient criteria for network comparison","year":2015,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"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 Natural Science Foundation of China","keywords":"Computer science; Protein superfamily; Similarity (geometry); Matching (statistics); Computational biology; Drosophila melanogaster; Data mining; Topology (electrical circuits); Artificial intelligence; Biology; Genetics; Mathematics; Gene","authors":[{"name":"Wei Peng","is_ca":false},{"name":"Jianxin Wang","is_ca":false},{"name":"Fang‐Xiang Wu","is_ca":true},{"name":"Yi Pan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05642390626907818,"gpt":0.3395592973962983,"spread":0.2831353911272201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003112102,0.001400147,0.001618411,0.00802498,0.001311574,0.001865982,0.002140701,0.001565805,0.001943339],"category_scores_gemma":[0.008103237,0.0006735438,0.001444054,0.004020135,0.001187148,0.003281813,0.001839649,0.0008487918,0.0005511474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001155432,"about_ca_system_score_gemma":0.0015747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003594863,"about_ca_topic_score_gemma":0.002911183,"domain_scores_codex":[0.9970236,0.0006459944,0.0003314021,0.0008828885,0.0008599971,0.0002560298],"domain_scores_gemma":[0.9967971,0.001114012,0.000581622,0.0005419127,0.0007444368,0.0002208129],"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.001134453,0.0004360228,0.02657134,0.0006901235,0.0006692527,0.0008996264,0.000957914,0.09429983,0.09187774,0.01994274,0.004352648,0.7581683],"study_design_scores_gemma":[0.00008662178,0.0001930208,0.008239981,0.00003418251,0.0001582739,0.0006281127,0.000295148,0.9369275,0.03571688,0.0123796,0.005267006,0.00007374098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1022814,0.0007007029,0.8929309,0.0001115245,0.00004259538,0.0002860282,0.0001629185,0.002004928,0.001478949],"genre_scores_gemma":[0.3124883,0.0003429836,0.6839646,0.00007974855,0.0000227937,0.0002547532,0.001025573,0.0002414106,0.001579876],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00802498,"threshold_uncertainty_score":0.01645857,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110922051","doi":"10.1186/1748-7188-7-32","title":"Towards a practical O(n logn) phylogeny algorithm","year":2012,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"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","keywords":"Computer science; Phylogenetics; Algorithm; Biology","authors":[{"name":"Jakub Truszkowski","is_ca":true},{"name":"Yanqi Hao","is_ca":true},{"name":"Daniel G. Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03332692126473845,"gpt":0.3493959329378441,"spread":0.3160690116731056,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002507293,0.0009875656,0.001186461,0.001180563,0.001101041,0.002285947,0.003628804,0.002483608,0.01235863],"category_scores_gemma":[0.01238027,0.0007528992,0.0007291561,0.002784581,0.001008548,0.005787378,0.002954961,0.002576797,0.009857686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001135365,"about_ca_system_score_gemma":0.002340284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001780796,"about_ca_topic_score_gemma":0.002414069,"domain_scores_codex":[0.9976439,0.0005671125,0.0001557355,0.0006652991,0.0006987705,0.0002691348],"domain_scores_gemma":[0.9939839,0.002197301,0.0003146117,0.002246554,0.001038163,0.0002194786],"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.001102809,0.0003245381,0.002510292,0.0007074852,0.00007605806,0.0002474553,0.0004704193,0.06416728,0.0225781,0.07555318,0.04582485,0.7864376],"study_design_scores_gemma":[0.0005421766,0.0001952567,0.0009539848,0.00009169448,0.00004132501,0.0007494746,0.0002019179,0.7794868,0.01212365,0.1737395,0.03182473,0.00004933143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01342851,0.0004266412,0.9747757,0.001148787,0.0001193107,0.0001152683,0.0003009785,0.006327308,0.003357491],"genre_scores_gemma":[0.07903437,0.0002539037,0.9147625,0.0004739562,0.0001026377,0.0002116304,0.001285107,0.0006540452,0.003221832],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01235863,"threshold_uncertainty_score":0.04134375,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165398449","doi":"10.1186/1748-7188-5-38","title":"Efficient algorithms for training the parameters of hidden Markov models using stochastic expectation maximization (EM) training and Viterbi training","year":2010,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":7,"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":"","keywords":"Viterbi algorithm; Computer science; Hidden Markov model; Iterative Viterbi decoding; Forward algorithm; Markov model; Markov chain; Soft output Viterbi algorithm; Expectation–maximization algorithm; Training (meteorology); Machine learning; Algorithm; Maximum-entropy Markov model; Artificial intelligence; Variable-order Markov model; Maximum likelihood; Decoding methods; Mathematics","authors":[{"name":"Tin Yin Lam","is_ca":true},{"name":"Irmtraud M. Meyer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07937526116788873,"gpt":0.3143771748915459,"spread":0.2350019137236571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003630829,0.002072046,0.001296947,0.001503747,0.0008566525,0.001361012,0.003727309,0.002415516,0.007979573],"category_scores_gemma":[0.02424678,0.001398477,0.0009918181,0.001530784,0.001119161,0.002701932,0.002351399,0.004315391,0.003582554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001645142,"about_ca_system_score_gemma":0.002626404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005618033,"about_ca_topic_score_gemma":0.00728459,"domain_scores_codex":[0.9980111,0.0009002439,0.0001687575,0.0004244826,0.0003858068,0.0001096458],"domain_scores_gemma":[0.9899853,0.008199654,0.0004249411,0.0005863508,0.0006964695,0.0001072127],"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.0001452482,0.0001275811,0.001120786,0.0002611544,0.0001164384,0.00007787695,0.0001942891,0.5383762,0.003098573,0.03640476,0.005655903,0.4144213],"study_design_scores_gemma":[0.00002131052,0.00001381201,0.00009528042,0.00002253814,0.00001097993,0.00003705929,0.00001307091,0.9762873,0.001993031,0.01996518,0.001527601,0.00001280744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009747596,0.0001090931,0.9974887,0.00007907666,0.00001640422,0.00003270737,0.00003343339,0.0009165839,0.0003492238],"genre_scores_gemma":[0.03777816,0.0002383267,0.9593405,0.0001331633,0.00004751924,0.0003824707,0.0003859993,0.0004154465,0.001278475],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007979573,"threshold_uncertainty_score":0.0266943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392343346","doi":"10.1186/s13015-024-00256-4","title":"SparseRNAfolD: optimized sparse RNA pseudoknot-free folding with dangle consideration","year":2024,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pseudoknot; Computer science; Algorithm; Computation; Recursion (computer science); Folding (DSP implementation); Theoretical computer science; Mathematical optimization; Mathematics; RNA","authors":[{"name":"Mateo Gray","is_ca":true},{"name":"Sebastian Will","is_ca":false},{"name":"Hosna Jabbari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01835453689503884,"gpt":0.2802774089962778,"spread":0.261922872101239,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005395985,0.0007380184,0.0009724119,0.0004089641,0.0005791382,0.0006480681,0.001297723,0.0009814529,0.007130328],"category_scores_gemma":[0.001698904,0.000306494,0.0005190035,0.0004327371,0.0005189681,0.000818374,0.001174141,0.0009565642,0.00205511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005713037,"about_ca_system_score_gemma":0.0009105756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002746266,"about_ca_topic_score_gemma":0.004487192,"domain_scores_codex":[0.9996806,0.0001036791,0.00001134864,0.00006242693,0.0001038164,0.00003816114],"domain_scores_gemma":[0.9995145,0.0001689086,0.00002359989,0.0001301591,0.0001003164,0.00006255337],"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.0007263118,0.0001658481,0.00104801,0.0002091469,0.00005063719,0.0002846834,0.0001149149,0.7896491,0.01277697,0.03246553,0.01345686,0.1490521],"study_design_scores_gemma":[0.00003119807,0.00003305137,0.00004916007,0.000005724951,0.000002873431,0.00001854847,0.000009156214,0.9888214,0.001943135,0.007478686,0.001599752,0.000007262543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07071515,0.000404448,0.9077075,0.0004037493,0.0002289021,0.0001175831,0.0004163489,0.009068672,0.01093757],"genre_scores_gemma":[0.496579,0.0002046844,0.4888988,0.0004584367,0.00005935834,0.00030434,0.001622327,0.001994391,0.009878732],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007130328,"threshold_uncertainty_score":0.0238533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392885478","doi":"10.1186/s13015-024-00258-2","title":"Infrared: a declarative tree decomposition-powered framework for bioinformatics","year":2024,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"HORIZON EUROPE Marie Sklodowska-Curie Actions; Universität Wien; Austrian Science Fund; Agence Nationale de la Recherche","keywords":"Computer science; Theoretical computer science; Feature (linguistics); Tree (set theory); Data mining; Algorithm; Mathematics","authors":[{"name":"Hua-Ting Yao","is_ca":true},{"name":"Bertrand Marchand","is_ca":false},{"name":"Sarah J. Berkemer","is_ca":false},{"name":"Yann Ponty","is_ca":false},{"name":"Sebastian Will","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01613810383166685,"gpt":0.3277411422206731,"spread":0.3116030383890062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005348738,0.002248941,0.001621048,0.001545806,0.001190689,0.004868482,0.006885411,0.00225313,0.01574241],"category_scores_gemma":[0.01262259,0.00166992,0.004871638,0.002074154,0.003024559,0.005680572,0.005100004,0.008194154,0.01070026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001778863,"about_ca_system_score_gemma":0.004095228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003302658,"about_ca_topic_score_gemma":0.005234507,"domain_scores_codex":[0.9963476,0.001131528,0.0004005837,0.0006187562,0.001240375,0.000261124],"domain_scores_gemma":[0.995363,0.002301367,0.0002854994,0.00116508,0.000600221,0.0002849013],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001892325,0.0001308739,0.0009055533,0.001304156,0.0001204117,0.0003011781,0.0005099709,0.09777445,0.005090067,0.7273576,0.04593893,0.1203778],"study_design_scores_gemma":[0.00008385094,0.00005257687,0.0001493924,0.0002581557,0.00004863266,0.0002448614,0.00006330186,0.3314371,0.003616481,0.5154392,0.1485431,0.00006321528],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002770284,0.0001540539,0.9897103,0.0002755694,0.00004947292,0.00006364638,0.0004972476,0.007459536,0.001513053],"genre_scores_gemma":[0.009650128,0.0004702617,0.981246,0.0006218691,0.0001115908,0.0006126748,0.001903148,0.003447274,0.00193706],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01574241,"threshold_uncertainty_score":0.05266356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4394688386","doi":"10.1186/s13015-024-00260-8","title":"Pfp-fm: an accelerated FM-index","year":2024,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"National Human Genome Research Institute; Japan Society for the Promotion of Science; National Institute of Allergy and Infectious Diseases; Natural Sciences and Engineering Research Council of Canada; Directorate for Biological Sciences; National Institutes of Health; National Science Foundation","keywords":"Computer science; Parsing; Suffix; Word (group theory); Sorting; Search engine indexing; Prefix; Character (mathematics); Suffix array; Index (typography); Algorithm; Artificial intelligence; Natural language processing; Data structure; Programming language; Mathematics","authors":[{"name":"Aaron Hong","is_ca":false},{"name":"Marco Antônio Oliva","is_ca":false},{"name":"Dominik Köppl","is_ca":false},{"name":"Hideo Bannai","is_ca":false},{"name":"Christina Boucher","is_ca":false},{"name":"Travis Gagie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03292274683587503,"gpt":0.3461846779970787,"spread":0.3132619311612037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007467364,0.001884546,0.00111224,0.002542709,0.00110842,0.001911006,0.004775871,0.00132585,0.01801186],"category_scores_gemma":[0.004214151,0.000700842,0.001037828,0.003708819,0.0006339944,0.00365726,0.002469211,0.001331249,0.009234801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001508729,"about_ca_system_score_gemma":0.002125485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009960888,"about_ca_topic_score_gemma":0.006124523,"domain_scores_codex":[0.9986899,0.0001147635,0.0001061981,0.0003306895,0.0005958313,0.0001625052],"domain_scores_gemma":[0.9984372,0.0004080711,0.0001025306,0.000507244,0.0004195519,0.0001254504],"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.001409681,0.0003240217,0.002600748,0.0006118346,0.00009986639,0.0002889796,0.000200546,0.01837159,0.03265528,0.01045105,0.1692707,0.7637158],"study_design_scores_gemma":[0.0005596659,0.0004323654,0.002400146,0.00009914806,0.00007761067,0.0007405545,0.0001321323,0.7682129,0.07048935,0.01888274,0.1377982,0.0001750969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03900819,0.002215725,0.73498,0.0007430591,0.0008491033,0.0005293011,0.006515872,0.2014747,0.01368396],"genre_scores_gemma":[0.1197426,0.0003836676,0.8451272,0.0004049069,0.0002692019,0.0005004718,0.01499586,0.005804365,0.01277166],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01801186,"threshold_uncertainty_score":0.06025571,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147043108","doi":"10.1186/1748-7188-8-5","title":"Protein Structure Idealization: How accurately is it possible to model protein structures with dihedral angles?","year":2013,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"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":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; Killam Trusts; City University of Hong Kong","keywords":"Dihedral angle; Protein structure prediction; Protein structure; Algorithm; Computer science; Gaussian; Idealization; Ideal (ethics); Physics; Computational chemistry; Chemistry","authors":[{"name":"Xuefeng Cui","is_ca":true},{"name":"Shuai Cheng Li","is_ca":false},{"name":"Dongbo Bu","is_ca":false},{"name":"Babak Alipanahi","is_ca":true},{"name":"Ming Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0163310326278924,"gpt":0.2876081307289795,"spread":0.2712770981010871,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00373776,0.001227487,0.001119107,0.0008673159,0.0006264461,0.001347602,0.001966995,0.001319077,0.001826696],"category_scores_gemma":[0.01124432,0.0006772617,0.0007718131,0.00122773,0.001576974,0.003925784,0.001307211,0.001304801,0.001145317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001258237,"about_ca_system_score_gemma":0.001286523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002979311,"about_ca_topic_score_gemma":0.001773218,"domain_scores_codex":[0.9977551,0.0009604209,0.0001346316,0.0004530749,0.0005098092,0.0001870086],"domain_scores_gemma":[0.9958636,0.001876968,0.0006332532,0.0009947334,0.0004593597,0.000172185],"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.0006368222,0.0001517328,0.007618367,0.0003402362,0.0001659694,0.0002538188,0.0002135378,0.8721422,0.01636051,0.03323931,0.00279503,0.06608259],"study_design_scores_gemma":[0.00006119044,0.00009327206,0.0006048652,0.00005283253,0.00002145235,0.0002149527,0.00007994868,0.9473766,0.01104036,0.03561224,0.004803749,0.00003853819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07958817,0.0009906326,0.9143956,0.000682136,0.00005243055,0.00008086429,0.0004082768,0.00120665,0.002595215],"genre_scores_gemma":[0.5618686,0.001142739,0.4322478,0.0003564167,0.00003726869,0.0002811892,0.001639281,0.000888117,0.001538684],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00373776,"threshold_uncertainty_score":0.0197674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3021210550","doi":"10.1186/s13015-020-00169-y","title":"The distance and median problems in the single-cut-or-join model with single-gene duplications","year":2020,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Genome Canada","keywords":"Join (topology); Computer science; Gene duplication; Algorithm; Gene; Data mining; Genetics; Biology; Mathematics; Combinatorics","authors":[{"name":"Aniket Mane","is_ca":true},{"name":"Manuel Lafond","is_ca":true},{"name":"Pedro Feijão","is_ca":true},{"name":"Cédric Chauve","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0360477283324637,"gpt":0.2649155196467826,"spread":0.2288677913143189,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00342187,0.001519055,0.003025544,0.001292681,0.001814156,0.003175415,0.004154549,0.004032534,0.009695612],"category_scores_gemma":[0.01555819,0.00101583,0.002382163,0.002983167,0.002158234,0.00820599,0.002653056,0.004439877,0.0009609977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003798367,"about_ca_system_score_gemma":0.003042116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01051547,"about_ca_topic_score_gemma":0.007559365,"domain_scores_codex":[0.9973065,0.0008039596,0.0001391222,0.001014693,0.0003831914,0.0003525789],"domain_scores_gemma":[0.9814777,0.01499573,0.001272121,0.0008635434,0.0006421332,0.0007487035],"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.0004504407,0.0002536153,0.001763021,0.000302692,0.00009767576,0.0001959394,0.0001900765,0.8935538,0.0008202275,0.06348138,0.006542052,0.03234912],"study_design_scores_gemma":[0.0001141473,0.00008181231,0.0004524686,0.00002436412,0.00002821189,0.0001308519,0.0001109155,0.8267398,0.0006680043,0.1699273,0.001694751,0.00002727452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1930964,0.002398783,0.7840443,0.003995349,0.0001626181,0.0003603107,0.003613256,0.001146091,0.01118289],"genre_scores_gemma":[0.5506639,0.00153959,0.4299246,0.000686036,0.0003316996,0.0004795963,0.005543141,0.0006663071,0.01016514],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01051547,"threshold_uncertainty_score":0.03243506,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964468345","doi":"10.1186/s13015-019-0153-8","title":"A branching process for homology distribution-based inference of polyploidy, speciation and loss","year":2019,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"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":"Inference; Genome; Biology; Gene; Branching process; Computational biology; Divergence (linguistics); Evolutionary biology; Genetics; Mathematics; Computer science; Statistics; Artificial intelligence","authors":[{"name":"Yue Zhang","is_ca":true},{"name":"Chunfang Zheng","is_ca":true},{"name":"David Sankoff","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01048060292094039,"gpt":0.3043564349767752,"spread":0.2938758320558348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01234408,0.0008236764,0.00139875,0.002513575,0.001311343,0.001824179,0.003824502,0.002031362,0.003581997],"category_scores_gemma":[0.04248474,0.001137658,0.001858006,0.002006273,0.002473436,0.002705276,0.002864043,0.003132716,0.0005954292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002308335,"about_ca_system_score_gemma":0.001345719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00742316,"about_ca_topic_score_gemma":0.005544443,"domain_scores_codex":[0.9977173,0.001071529,0.0001250191,0.0006478733,0.0003024827,0.000135841],"domain_scores_gemma":[0.9647015,0.03118122,0.00133434,0.001207291,0.0009593795,0.0006163293],"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.0002884971,0.0001075731,0.01302278,0.000138672,0.0002492198,0.0002848828,0.0004863356,0.7955964,0.003513332,0.1055989,0.001336539,0.07937687],"study_design_scores_gemma":[0.00001864696,0.00001034767,0.0004269841,0.0000105951,0.0000129542,0.00003577575,0.00001035954,0.9571552,0.0003442679,0.04169212,0.0002743055,0.000008512167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02586798,0.0001922674,0.9728521,0.0001719555,0.00001683433,0.00004892679,0.0001125583,0.0004019273,0.0003354117],"genre_scores_gemma":[0.5095795,0.0003176928,0.4855715,0.0002539906,0.0001172677,0.0003866933,0.001342617,0.0004217704,0.002008945],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01234408,"threshold_uncertainty_score":0.06528252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130654549","doi":"10.1186/1748-7188-8-20","title":"Fast half-sibling population reconstruction: theory and algorithms","year":2013,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"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; Government of Ontario","keywords":"Kinship; Computer science; Heuristic; Population; Inference; Inheritance (genetic algorithm); Cluster analysis; Integer (computer science); Theoretical computer science; Data mining; Machine learning; Artificial intelligence; Biology; Demography","authors":[{"name":"Daniel L. Dexter","is_ca":true},{"name":"Daniel G. Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00999279403419891,"gpt":0.266749084789505,"spread":0.2567562907553061,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003422345,0.001140645,0.001206082,0.002033811,0.001379848,0.001683105,0.004167564,0.00207388,0.006487633],"category_scores_gemma":[0.01418486,0.0008719338,0.001511094,0.002492697,0.001422365,0.003624347,0.002570194,0.002491976,0.001732729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001595753,"about_ca_system_score_gemma":0.002109898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005080748,"about_ca_topic_score_gemma":0.004970049,"domain_scores_codex":[0.9986992,0.0004792302,0.00008372525,0.0002707088,0.0003349719,0.0001321917],"domain_scores_gemma":[0.9908469,0.006675729,0.0004810652,0.001026464,0.0007571218,0.0002126512],"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.0002430655,0.0001759189,0.005311549,0.0003652226,0.0001426522,0.0002022035,0.0004168943,0.5699641,0.001688181,0.110382,0.01121438,0.2998938],"study_design_scores_gemma":[0.00003005274,0.00001877165,0.0002634093,0.00002718998,0.00001563305,0.0001075773,0.00004895509,0.9099054,0.0005688288,0.08758961,0.001412643,0.00001182582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007748647,0.0003369909,0.9888713,0.0002620274,0.0000229475,0.00007337811,0.0001580117,0.0009014406,0.001625281],"genre_scores_gemma":[0.09128582,0.0003355918,0.9050992,0.000171644,0.00005343482,0.0002933533,0.0008847924,0.0002372924,0.00163896],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006487633,"threshold_uncertainty_score":0.0217033,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115843315","doi":"10.1186/1748-7188-6-8","title":"An FPT haplotyping algorithm on pedigrees with a small number of sites","year":2011,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genetic Associations and Epidemiology","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pedigree chart; Computer science; Algorithm; Haplotype; Data mining; Biology; Genetics","authors":[{"name":"Duong D. Doan","is_ca":true},{"name":"Patricia Evans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03441372841316802,"gpt":0.3044060543597645,"spread":0.2699923259465964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001717649,0.0007437124,0.0009751052,0.001152358,0.000771151,0.0008550444,0.001729177,0.001402706,0.006458589],"category_scores_gemma":[0.00752087,0.0005983656,0.0008482368,0.001760867,0.0004933978,0.001750528,0.001484194,0.0009233091,0.001273526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009432902,"about_ca_system_score_gemma":0.001795598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005769014,"about_ca_topic_score_gemma":0.004776907,"domain_scores_codex":[0.9993192,0.0002201858,0.00005607564,0.0002061618,0.0001112467,0.00008710971],"domain_scores_gemma":[0.9969174,0.00213337,0.0001550468,0.0004156859,0.000267287,0.0001112475],"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.0004268803,0.000152848,0.005664192,0.0002204129,0.0001025005,0.0004136168,0.0002734727,0.3366951,0.002992254,0.01319519,0.0133458,0.6265177],"study_design_scores_gemma":[0.0002187526,0.00005188275,0.0009127689,0.00002390067,0.00002965123,0.0003093229,0.00004911598,0.9672974,0.0006731858,0.02794894,0.002474011,0.00001101939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06535318,0.0004338215,0.9245601,0.0007035362,0.00005945863,0.0003024515,0.001556198,0.003514832,0.00351635],"genre_scores_gemma":[0.1345028,0.0001194751,0.8600463,0.0001861435,0.00003302355,0.0004371898,0.002665229,0.0002542142,0.001755593],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006458589,"threshold_uncertainty_score":0.02160609,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2789974803","doi":"10.1186/s13015-018-0123-6","title":"Derivative-free neural network for optimizing the scoring functions associated with dynamic programming of pairwise-profile alignment","year":2018,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Institute of Genetics","keywords":"Computer science; Pairwise comparison; Cosine similarity; Artificial neural network; Similarity (geometry); Multiple sequence alignment; Artificial intelligence; Data mining; Smith–Waterman algorithm; Function (biology); Solver; Sequence alignment; Pattern recognition (psychology); Sequence (biology); Algorithm; Machine learning; Image (mathematics)","authors":[{"name":"Kazunori Yamada","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0158604832505475,"gpt":0.2656652575393171,"spread":0.2498047742887696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009955633,0.001077322,0.0005838004,0.000487377,0.0003575283,0.0005646704,0.0009681511,0.001064579,0.001744742],"category_scores_gemma":[0.002523521,0.0004429311,0.0005357364,0.0005330319,0.0004525492,0.0007696842,0.0005911089,0.001154287,0.0002744188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001180998,"about_ca_system_score_gemma":0.001348395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008580235,"about_ca_topic_score_gemma":0.008104019,"domain_scores_codex":[0.9996735,0.00008665423,0.00001949509,0.00009597275,0.00008385866,0.00004048826],"domain_scores_gemma":[0.9993386,0.0003774501,0.00006090858,0.00002722665,0.0001730046,0.00002286212],"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.00004494749,0.00003824763,0.0004991099,0.000050593,0.00002362662,0.00003464988,0.0000260345,0.9423866,0.002643379,0.002705873,0.0004825844,0.0510643],"study_design_scores_gemma":[0.000001358054,0.000006434626,0.00002644681,0.00000138127,0.000001785867,0.000002429395,0.000001074218,0.9994029,0.0002588649,0.0002390443,0.00005698907,0.000001243498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03327204,0.000235714,0.9635227,0.0001346643,0.00003525042,0.000054793,0.00003178457,0.0004276517,0.002285388],"genre_scores_gemma":[0.5821576,0.000271713,0.4124196,0.0001742293,0.00003228735,0.0003519827,0.0002067112,0.0001334533,0.00425238],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008580235,"threshold_uncertainty_score":0.01706058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391565229","doi":"10.1186/s13015-023-00242-2","title":"Predicting horizontal gene transfers with perfect transfer networks","year":2024,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Université de Sherbrooke","keywords":"Phylogenetic tree; Character (mathematics); Horizontal gene transfer; Inference; Phylogenetic network; Biology; Set (abstract data type); Similarity (geometry); Phylogenetics; Evolutionary biology; Gene; Genetics; Computational biology; Computer science; Artificial intelligence; Mathematics","authors":[{"name":"Alitzel López Sánchez","is_ca":true},{"name":"Manuel Lafond","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007755730313516916,"gpt":0.2434699862928719,"spread":0.2357142559793549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001142281,0.0006171645,0.0004822695,0.001725805,0.0006148911,0.001208716,0.001013684,0.001278001,0.002481401],"category_scores_gemma":[0.008670426,0.0004763597,0.0008317307,0.001245672,0.001041095,0.003121072,0.001010267,0.001108475,0.0003644144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001389808,"about_ca_system_score_gemma":0.0007504617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002835599,"about_ca_topic_score_gemma":0.003327377,"domain_scores_codex":[0.9992318,0.0001989198,0.00005568004,0.0002990917,0.0001334908,0.00008098478],"domain_scores_gemma":[0.9920235,0.005632657,0.00117552,0.0005592628,0.0003828378,0.0002262878],"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.0002150639,0.00007977712,0.01945819,0.0002358865,0.00009871699,0.0002293462,0.0001356396,0.8908937,0.002201301,0.01971346,0.001603335,0.06513554],"study_design_scores_gemma":[0.000009184082,0.00002147051,0.001516003,0.00001902598,0.00001656605,0.00007362511,0.00002975438,0.9492609,0.0007088741,0.04769734,0.000640074,0.000007171613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.324178,0.001363538,0.6673747,0.001064493,0.00003597628,0.00008880875,0.0020398,0.0009632229,0.002891421],"genre_scores_gemma":[0.8658165,0.0005171577,0.1296425,0.000125195,0.00007144317,0.00007501066,0.00248659,0.00008413383,0.001181561],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002835599,"threshold_uncertainty_score":0.01008373,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2544103171","doi":"10.1186/s13015-017-0101-4","title":"Aligning coding sequences with frameshift extension penalties","year":2017,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Canada Research Chairs; Université de Sherbrooke","keywords":"Frameshift mutation; Coding (social sciences); Extension (predicate logic); Gene; Homologous chromosome; Encoding (memory); Efficient algorithm","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02500415426522971,"gpt":0.3100925058355515,"spread":0.2850883515703218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008807561,0.0009212426,0.0006477942,0.001140706,0.0004455642,0.0005483655,0.0008699744,0.0007201284,0.002498623],"category_scores_gemma":[0.002965334,0.0002217174,0.0006431065,0.00144674,0.0003747204,0.000685123,0.0007087664,0.0008221301,0.001350449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003760403,"about_ca_system_score_gemma":0.0008824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001264784,"about_ca_topic_score_gemma":0.001287172,"domain_scores_codex":[0.9991757,0.0001951569,0.00006461999,0.0002357933,0.0002584462,0.00007020812],"domain_scores_gemma":[0.9987113,0.0004993089,0.0002112939,0.0002079181,0.0003102276,0.00005983995],"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.0005265889,0.0002215422,0.006349471,0.0004676387,0.0001588571,0.0002901619,0.0001716246,0.1785689,0.1000007,0.01066274,0.004008426,0.6985732],"study_design_scores_gemma":[0.00005752925,0.0002134981,0.002578786,0.00003465729,0.00005510591,0.0004514031,0.00006848518,0.9224485,0.04776149,0.01970619,0.006595909,0.00002848219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05267472,0.000266306,0.9439727,0.00004835975,0.0000402818,0.00009390915,0.0001412801,0.002072217,0.0006902389],"genre_scores_gemma":[0.1867327,0.0001571641,0.8104975,0.00004624888,0.00003620719,0.0001148524,0.000851356,0.0003746068,0.001189573],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002498623,"threshold_uncertainty_score":0.008358717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039803514","doi":"10.1186/1748-7188-6-11","title":"Listing all sorting reversals in quadratic time","year":2011,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"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":"","keywords":"Permutation (music); Sorting; Listing (finance); Computer science; Identity (music); Sorting algorithm; Quadratic equation; Algorithm; Time complexity; Combinatorics; Mathematics","authors":[{"name":"Krister M. Swenson","is_ca":true},{"name":"Ghada Badr","is_ca":true},{"name":"David Sankoff","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03749375139985743,"gpt":0.3000611005173297,"spread":0.2625673491174723,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007699687,0.001741649,0.001399022,0.001402295,0.001525197,0.003203509,0.002224714,0.001000104,0.04062846],"category_scores_gemma":[0.005271393,0.0006443402,0.001083239,0.003482431,0.0005955452,0.00437428,0.001316513,0.001341207,0.01195478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001231453,"about_ca_system_score_gemma":0.003747136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003197876,"about_ca_topic_score_gemma":0.008839201,"domain_scores_codex":[0.9983727,0.0002009143,0.0001784055,0.0003055713,0.000631098,0.0003112225],"domain_scores_gemma":[0.9964193,0.001349867,0.0002835247,0.0009926859,0.0007677502,0.0001868856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000611415,0.0004388433,0.002131735,0.0007880526,0.00008104974,0.000231267,0.0001546529,0.01648172,0.02456543,0.0166864,0.06270196,0.8751275],"study_design_scores_gemma":[0.001609978,0.001293309,0.005519204,0.000265194,0.00034035,0.002034235,0.001001112,0.2833291,0.1381874,0.3484652,0.2175709,0.0003839185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09165924,0.001854365,0.805492,0.002063719,0.000734928,0.0008896086,0.00887869,0.04736053,0.04106688],"genre_scores_gemma":[0.250665,0.0007028634,0.6911362,0.0008328294,0.0002019096,0.0004497397,0.01549592,0.003592877,0.03692272],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04062846,"threshold_uncertainty_score":0.1359158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2965995818","doi":"10.1186/s13015-019-0150-y","title":"A cubic algorithm for the generalized rank median of three genomes","year":2019,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"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; Canadian Institutes of Health Research; Fundação de Amparo à Pesquisa do Estado de São Paulo; Genome Canada; Alfred P. Sloan Foundation","keywords":"Genome; Linear subspace; Heuristics; Time complexity; Combinatorics; Rank (graph theory); Matrix (chemical analysis); Computer science; Algorithm; Omega; Polynomial; Upper and lower bounds; Mathematics; Mathematical optimization; Biology; Pure mathematics; Physics; Genetics","authors":[{"name":"Leonid Chindelevitch","is_ca":true},{"name":"Sean La","is_ca":true},{"name":"João Meidânis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01477803924146979,"gpt":0.2761304000805498,"spread":0.26135236083908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009039096,0.00100039,0.001369833,0.001677924,0.001371796,0.001820279,0.001769919,0.001240149,0.0168876],"category_scores_gemma":[0.003617077,0.000562627,0.001710743,0.001953102,0.000961147,0.001961991,0.003026481,0.002081935,0.003133769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001725457,"about_ca_system_score_gemma":0.003200216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007175635,"about_ca_topic_score_gemma":0.01021602,"domain_scores_codex":[0.9989582,0.0001532359,0.00006668293,0.0003664523,0.0002600244,0.0001952804],"domain_scores_gemma":[0.9989483,0.0004126733,0.00009825412,0.0002720015,0.0001811274,0.00008767426],"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.0006379602,0.0003160801,0.001709594,0.0003810621,0.0001183758,0.0002132914,0.0004896207,0.1655527,0.01581626,0.06490953,0.01809351,0.7317622],"study_design_scores_gemma":[0.0003291902,0.000270795,0.0007748917,0.00003911078,0.00004311596,0.0002321915,0.0003624547,0.8292009,0.01001794,0.1419152,0.01674238,0.00007181091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02571553,0.0001589679,0.9614118,0.0003421012,0.00005452918,0.0001949937,0.0005397375,0.005821044,0.005761399],"genre_scores_gemma":[0.09747425,0.00006545561,0.8968763,0.0000958886,0.00002625983,0.0001825483,0.00129638,0.0005691306,0.003413758],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0168876,"threshold_uncertainty_score":0.05649465,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1909028472","doi":"10.1186/s13015-015-0055-3","title":"Erratum to: Inferring interaction type in gene regulatory networks using co-expression data","year":2015,"lang":"en","type":"erratum","venue":"Algorithms for Molecular Biology","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Computer science; Expression (computer science); Type (biology); Data type; Computational biology; Data mining; Gene regulatory network; Data science; Gene expression; Gene; Biology; Genetics; Ecology","authors":[{"name":"Pegah Khosravi","is_ca":true},{"name":"Vahid Gazestani","is_ca":true},{"name":"Leila Pirhaji","is_ca":false},{"name":"Brian K. Law","is_ca":true},{"name":"Mehdi Sadeghi","is_ca":false},{"name":"Gary D. Bader","is_ca":true},{"name":"Bahram Goliaei","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04794319886971091,"gpt":0.3569521048979705,"spread":0.3090089060282596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003779329,0.002866341,0.002086436,0.004236308,0.003186265,0.004299688,0.003377916,0.00482467,0.06560611],"category_scores_gemma":[0.05956685,0.001714066,0.001852685,0.003754602,0.002723069,0.0033772,0.002567299,0.008589642,0.03730408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003870685,"about_ca_system_score_gemma":0.005737679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0169394,"about_ca_topic_score_gemma":0.02885329,"domain_scores_codex":[0.9959882,0.000664117,0.0006960086,0.0006233932,0.001830201,0.0001980181],"domain_scores_gemma":[0.9801364,0.007498496,0.001092839,0.00177316,0.008706379,0.0007927089],"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.00003532688,0.00000907613,0.0001144403,0.0000949035,0.00001841788,0.0001948798,0.00002120499,0.0002008113,0.00007228255,0.001270405,0.9880638,0.009904411],"study_design_scores_gemma":[0.00006673961,0.00002696218,0.0006884991,0.0004350828,0.00008487891,0.001339797,0.00009536841,0.00167003,0.0008286858,0.006694669,0.9879848,0.00008450229],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0004781079,0.00290099,0.01872083,0.05637234,0.9078612,0.00006316386,0.005408953,0.002562032,0.005632521],"genre_scores_gemma":[0.03339425,0.02237921,0.1247362,0.1642067,0.2259278,0.0006022717,0.03665561,0.01557854,0.3765194],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.06560611,"threshold_uncertainty_score":0.2194743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116920786","doi":"10.1186/1748-7188-8-24","title":"Asymptotic structural properties of quasi-random saturated structures of RNA","year":2013,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"National Science Foundation","keywords":"Pseudoknot; Combinatorics; Mathematics; Distribution (mathematics); Loop (graph theory); Statistical physics; Discrete mathematics; Physics; RNA; Mathematical analysis; Chemistry","authors":[{"name":"Peter Clote","is_ca":false},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01265192242207659,"gpt":0.2524425439793396,"spread":0.239790621557263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002052586,0.0004155013,0.0004219816,0.001629852,0.0007845067,0.001352111,0.0013171,0.001016828,0.004533725],"category_scores_gemma":[0.01995866,0.0006565665,0.000575831,0.0008201653,0.002552574,0.002868885,0.001161775,0.00107619,0.0005285413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001707493,"about_ca_system_score_gemma":0.0006722836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005721473,"about_ca_topic_score_gemma":0.0006807185,"domain_scores_codex":[0.9991556,0.0002576918,0.00004560937,0.0001854135,0.0002357789,0.0001197455],"domain_scores_gemma":[0.9775604,0.01530626,0.003010358,0.001554824,0.00161925,0.0009489483],"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.0005441262,0.0003496814,0.04005994,0.0006531311,0.0001769482,0.001048812,0.0008071937,0.2532144,0.04401881,0.6314917,0.004163626,0.0234717],"study_design_scores_gemma":[0.00005042617,0.0001836398,0.007079565,0.00004800291,0.00003857731,0.0008437289,0.0001839059,0.7047559,0.006914783,0.2788724,0.0009809133,0.00004807116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8076941,0.0004949297,0.183668,0.000517516,0.00001933403,0.00007060584,0.0004111098,0.0005183263,0.006606049],"genre_scores_gemma":[0.9849812,0.0002411385,0.01274645,0.0001133985,0.00004275232,0.0001001789,0.0005248181,0.0001267084,0.00112334],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004533725,"threshold_uncertainty_score":0.01516688,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017156855","doi":"10.1186/1748-7188-5-35","title":"Estimating the evidence of selection and the reliability of inference in unigenic evolution","year":2010,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"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; Government of Ontario","keywords":"Inference; Computer science; Selection (genetic algorithm); Reliability (semiconductor); Data mining; Data science; Econometrics; Machine learning; Artificial intelligence; Mathematics","authors":[{"name":"Andrew D. Fernandes","is_ca":true},{"name":"Benjamin P. Kleinstiver","is_ca":true},{"name":"David R. Edgell","is_ca":true},{"name":"Lindi M. Wahl","is_ca":true},{"name":"Gregory B. Gloor","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007156918695487575,"gpt":0.2929834438655729,"spread":0.2858265251700853,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.05392248,0.00140062,0.001741536,0.00468706,0.001087431,0.002447564,0.002807553,0.002462141,0.001166714],"category_scores_gemma":[0.2769757,0.0008559708,0.001802162,0.002236731,0.00577983,0.002918357,0.003464536,0.003139036,0.0002787146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001350264,"about_ca_system_score_gemma":0.001047571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001510881,"about_ca_topic_score_gemma":0.001006835,"domain_scores_codex":[0.9649807,0.02297509,0.002093469,0.004516519,0.004868459,0.0005656427],"domain_scores_gemma":[0.4621812,0.4926945,0.02187096,0.01475827,0.007266737,0.001228245],"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.002085567,0.0003028168,0.3609478,0.001681428,0.003439697,0.001087336,0.002211367,0.4023931,0.0249523,0.03820145,0.001134045,0.1615631],"study_design_scores_gemma":[0.0001286248,0.0004949409,0.04162192,0.0002084803,0.0003567286,0.0006411128,0.000268479,0.8394172,0.01992181,0.09565223,0.001131707,0.0001568568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2596993,0.001122212,0.736867,0.0003195297,0.00004992428,0.0001168768,0.0001963143,0.0004584852,0.001170373],"genre_scores_gemma":[0.8758316,0.0002671009,0.1228525,0.0001349952,0.00006718486,0.0001516676,0.0003488829,0.0001221061,0.0002240357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05392248,"threshold_uncertainty_score":0.2851727,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414725606","doi":"10.1186/s13015-025-00283-9","title":"Finding maximum common contractions between phylogenetic networks","year":2025,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Phylogenetic tree; Generalization; Contraction (grammar); Set (abstract data type); Computation; Space (punctuation); Upper and lower bounds","authors":[{"name":"Bertrand Marchand","is_ca":true},{"name":"Nadia Tahiri","is_ca":true},{"name":"Shohreh Golpaigani Fard","is_ca":true},{"name":"Olivier Tremblay-Savard","is_ca":true},{"name":"Manuel Lafond","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01606171810145554,"gpt":0.307544356855016,"spread":0.2914826387535605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002967784,0.0008164646,0.001542251,0.00244876,0.001583641,0.002575445,0.002444607,0.001578548,0.003066888],"category_scores_gemma":[0.02598535,0.0007814122,0.001479342,0.002266863,0.002667933,0.01134553,0.004211708,0.00258958,0.0005188719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001258226,"about_ca_system_score_gemma":0.0009573076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007280275,"about_ca_topic_score_gemma":0.001261089,"domain_scores_codex":[0.9963472,0.001095038,0.000252404,0.001153457,0.0008448275,0.0003070751],"domain_scores_gemma":[0.9765273,0.01713816,0.001728948,0.002420924,0.001241064,0.0009435512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000740118,0.0002209338,0.01196723,0.001277985,0.0002693853,0.001016157,0.003913788,0.2018659,0.02235927,0.5158471,0.00692976,0.2335923],"study_design_scores_gemma":[0.00003531878,0.0001374407,0.002031761,0.0001142682,0.00006144509,0.0005884859,0.000774221,0.2759478,0.0086948,0.7026647,0.008904841,0.00004493439],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2327546,0.0007679184,0.7591562,0.0008063522,0.0000554653,0.0001584342,0.0008762847,0.0005208562,0.004903771],"genre_scores_gemma":[0.6131591,0.0005956584,0.3794735,0.0002339518,0.00009428594,0.0002521486,0.002779463,0.0003466164,0.003065321],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003066888,"threshold_uncertainty_score":0.01569533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413110219","doi":"10.1186/s13015-025-00281-x","title":"b-move: faster lossless approximate pattern matching in a run-length compressed index","year":2025,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"National Institutes of Health; National Human Genome Research Institute; Vlaamse regering; Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek","keywords":"Computer science; Search engine indexing; Lossless compression; Index (typography); RefSeq; Memory footprint; Pattern matching; Scalability; Matching (statistics); Overhead (engineering); Theoretical computer science; Data mining; Genome; Algorithm; Data compression; Information retrieval; Mathematics; Artificial intelligence; Database","authors":[{"name":"Lore Depuydt","is_ca":false},{"name":"Luca Renders","is_ca":false},{"name":"Simon Van de Vyver","is_ca":false},{"name":"Lennart Veys","is_ca":false},{"name":"Travis Gagie","is_ca":true},{"name":"Jan Fostier","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01169109429062735,"gpt":0.2933725954004427,"spread":0.2816815011098153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006230518,0.0009995074,0.001153042,0.001616199,0.0006465054,0.001681266,0.002569399,0.0008374893,0.006441416],"category_scores_gemma":[0.003855894,0.0004864694,0.0007157632,0.003522665,0.0005898811,0.004183003,0.00264367,0.001095511,0.005458747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000778043,"about_ca_system_score_gemma":0.001658142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004679794,"about_ca_topic_score_gemma":0.00520448,"domain_scores_codex":[0.9986367,0.0001160245,0.0001153817,0.0002539294,0.0007476835,0.0001303302],"domain_scores_gemma":[0.9988658,0.0002485649,0.0001163543,0.0004460156,0.0002399875,0.00008332775],"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.001914829,0.0004930982,0.003235339,0.0006676341,0.0001517847,0.00054729,0.0005701106,0.0204404,0.1051581,0.02718896,0.06370567,0.7759268],"study_design_scores_gemma":[0.0006373611,0.001090342,0.002240548,0.0001262228,0.0001429225,0.001701285,0.0004779919,0.7094913,0.1484904,0.03019627,0.1051889,0.0002165073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08655799,0.003497995,0.8442172,0.0005339556,0.0005471045,0.0004204187,0.003001921,0.04745845,0.01376491],"genre_scores_gemma":[0.2493844,0.0009340763,0.7227748,0.0005742605,0.0001918885,0.0005558466,0.01218316,0.002046409,0.01135514],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006441416,"threshold_uncertainty_score":0.02154869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403127906","doi":"10.1186/s13015-024-00267-1","title":"New generalized metric based on branch length distance to compare B cell lineage trees","year":2024,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Chronic Lymphocytic Leukemia Research","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Université de Sherbrooke","keywords":"Metric (unit); Computer science; Lineage (genetic); Combinatorics; Mathematics; Biology; Genetics","authors":[{"name":"Mahsa Farnia","is_ca":true},{"name":"Nadia Tahiri","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02388740729964758,"gpt":0.3531649598430179,"spread":0.3292775525433703,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003614567,0.0009898315,0.001328718,0.006764742,0.001112626,0.002488364,0.001827698,0.001542596,0.001643661],"category_scores_gemma":[0.01797328,0.0003026077,0.0009297636,0.006054919,0.001401574,0.004315555,0.0021701,0.001592668,0.000525769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001869526,"about_ca_system_score_gemma":0.001521408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002619352,"about_ca_topic_score_gemma":0.002783703,"domain_scores_codex":[0.9960269,0.001260042,0.0004479097,0.0007080371,0.001391353,0.0001657827],"domain_scores_gemma":[0.9903288,0.004264194,0.00159641,0.001254635,0.002054214,0.0005017609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004026279,0.000220979,0.04195705,0.0008104338,0.0005881427,0.0002916106,0.0006712529,0.336688,0.02531336,0.1461745,0.01017067,0.4367113],"study_design_scores_gemma":[0.00004486833,0.0003772299,0.01192279,0.0001078236,0.0001077897,0.0006837438,0.0002201414,0.8457347,0.007798773,0.1119351,0.02094119,0.0001258991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05160097,0.001810929,0.9411709,0.0003062811,0.0001663638,0.000159138,0.001148439,0.0005921686,0.003044815],"genre_scores_gemma":[0.3595735,0.001032853,0.6335926,0.0002381297,0.0001800556,0.0004786892,0.003049742,0.0003427544,0.001511596],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006764742,"threshold_uncertainty_score":0.01911587,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2982419655","doi":"10.1186/s13015-020-00175-0","title":"Reconstruction of time-consistent species trees","year":2020,"lang":"en","type":"preprint","venue":"Algorithms for Molecular Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Gene duplication; Event (particle physics); Horizontal gene transfer; Tree (set theory); Gene; Biology; Tree of life (biology); Evolutionary biology; Genetic algorithm; Construct (python library); Phylogenetics; Gene family; Phylogenetic tree; Computational biology; Genetics; Mathematics; Genome; Combinatorics; Computer science; Physics","authors":[{"name":"Manuel Lafond","is_ca":true},{"name":"Marc Hellmuth","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02409890680831704,"gpt":0.2661840530394918,"spread":0.2420851462311747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001736204,0.0004342843,0.0005896493,0.0008903328,0.0007760194,0.001424153,0.001932394,0.001361194,0.003880755],"category_scores_gemma":[0.01312909,0.0006234519,0.001174349,0.001167223,0.001329373,0.002831487,0.001370224,0.001570659,0.0005532132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001433336,"about_ca_system_score_gemma":0.001271351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001814841,"about_ca_topic_score_gemma":0.002136327,"domain_scores_codex":[0.9988017,0.0003363659,0.00008000835,0.0004575148,0.0002271633,0.0000972439],"domain_scores_gemma":[0.9900962,0.006831031,0.000853084,0.001142925,0.000809775,0.0002669822],"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.0008017531,0.0001528958,0.0121772,0.0006237596,0.0001458093,0.0005543033,0.0008600792,0.6710693,0.01912093,0.178297,0.005453668,0.1107432],"study_design_scores_gemma":[0.00006425193,0.0000402285,0.001075797,0.00004110198,0.00002875813,0.0002842397,0.0001591118,0.7168157,0.005466534,0.2722433,0.003759364,0.00002159055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1193172,0.0002961382,0.8755751,0.0006570868,0.00002691738,0.00008983376,0.001204706,0.0007920551,0.002040882],"genre_scores_gemma":[0.3885623,0.0001887808,0.6065103,0.0001699648,0.00002560486,0.0001023209,0.0030569,0.0002846731,0.001099132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003880755,"threshold_uncertainty_score":0.01298249,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388490419","doi":"10.1186/s13015-023-00240-4","title":"Relative timing information and orthology in evolutionary scenarios","year":2023,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Stockholms Universitet; Deutsche Forschungsgemeinschaft","keywords":"Extant taxon; Combinatorics; Vertex (graph theory); Graph; Time complexity; Computer science; Biology; Mathematics; Theoretical computer science; Discrete mathematics; Evolutionary biology","authors":[{"name":"David Schaller","is_ca":false},{"name":"Tom Hartmann","is_ca":false},{"name":"Manuel Lafond","is_ca":true},{"name":"Peter F. Stadler","is_ca":false},{"name":"Nicolas Wieseke","is_ca":false},{"name":"Marc Hellmuth","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01593339747570286,"gpt":0.2869197491809849,"spread":0.270986351705282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199732,0.0007660997,0.000721015,0.002332053,0.001644201,0.002411675,0.001795455,0.001821479,0.007367108],"category_scores_gemma":[0.01582051,0.0008292964,0.001374564,0.002886017,0.002238646,0.008618729,0.001903981,0.002252083,0.0008287604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001971127,"about_ca_system_score_gemma":0.001251937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001780836,"about_ca_topic_score_gemma":0.001979034,"domain_scores_codex":[0.9981595,0.0005820305,0.0001268863,0.0006315898,0.00031854,0.0001814872],"domain_scores_gemma":[0.9879631,0.008660353,0.0008837949,0.001451366,0.0006259668,0.0004154749],"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.0005022267,0.0002314354,0.01079352,0.0007974078,0.0001065781,0.0009172079,0.001371371,0.1849706,0.005766375,0.6813866,0.0062616,0.1068952],"study_design_scores_gemma":[0.00002044474,0.00003447623,0.001081393,0.00004651911,0.00003150299,0.0004487893,0.0002121186,0.1173915,0.001797812,0.8749796,0.003929364,0.00002641817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2008871,0.0006116458,0.7811496,0.002070144,0.00008465279,0.0002479497,0.003263345,0.001776192,0.009909277],"genre_scores_gemma":[0.7091494,0.0004589727,0.2832461,0.0002788338,0.00008819136,0.000166352,0.004217862,0.0003195577,0.002074778],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007367108,"threshold_uncertainty_score":0.02464545,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385397331","doi":"10.1186/s13015-023-00231-5","title":"On the complexity of non-binary tree reconciliation with endosymbiotic gene transfer","year":2023,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Legume Nitrogen Fixing Symbiosis","field":"Agricultural and Biological Sciences","cited_by":0,"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","keywords":"Binary number; Tree (set theory); Genome; Gene; Gene duplication; Binary tree; Biology; Genetics; Computational biology; Computer science; Algorithm; Mathematics; Combinatorics","authors":[{"name":"Mathieu Gascon","is_ca":true},{"name":"Nadia El-Mabrouk","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04071512233507958,"gpt":0.253661973143377,"spread":0.2129468508082974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004119105,0.001996533,0.003562562,0.00163012,0.002926196,0.005019647,0.004148812,0.003240043,0.008771826],"category_scores_gemma":[0.02406197,0.001271471,0.003501491,0.003193327,0.002436371,0.009204438,0.004565158,0.005086085,0.001564954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003151391,"about_ca_system_score_gemma":0.00341101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006066236,"about_ca_topic_score_gemma":0.007714127,"domain_scores_codex":[0.9962546,0.001266979,0.0002253296,0.001124452,0.0006180494,0.0005106085],"domain_scores_gemma":[0.9575535,0.03680369,0.001611275,0.002289825,0.001137019,0.000604641],"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.001308871,0.0004028761,0.003613495,0.001430942,0.0003099783,0.0005465429,0.0008065595,0.7740363,0.005266566,0.06090471,0.01526081,0.1361124],"study_design_scores_gemma":[0.000147994,0.00007658376,0.0006589085,0.0000479762,0.00007923611,0.0001993027,0.0001610522,0.8471652,0.00150016,0.1479263,0.001995379,0.00004186359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2336215,0.003447271,0.7348093,0.006439202,0.0003190353,0.0005097465,0.003312528,0.004373532,0.01316774],"genre_scores_gemma":[0.4295134,0.001666954,0.5530167,0.0009986714,0.0004622445,0.0006406818,0.006846535,0.001648242,0.005206526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008771826,"threshold_uncertainty_score":0.02934474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413308490","doi":"10.1186/s13015-025-00284-8","title":"The path-label reconciliation (PLR) dissimilarity measure for gene trees","year":2025,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología; Université de Sherbrooke","keywords":"Metric (unit); Computer science; Measure (data warehouse); Normalization (sociology); Tree (set theory); Path (computing); Set (abstract data type); Data mining; Artificial intelligence; Algorithm; Mathematics; Combinatorics","authors":[{"name":"Alitzel López Sánchez","is_ca":true},{"name":"José Antonio Ramírez-Rafael","is_ca":false},{"name":"Alejandro Flores-Lamas","is_ca":false},{"name":"Maribel Hernández-Rosales","is_ca":false},{"name":"Manuel Lafond","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01841881038842055,"gpt":0.2945175570745436,"spread":0.2760987466861231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006373764,0.0009099428,0.001553972,0.004815611,0.001330874,0.002716415,0.002996808,0.002110646,0.002139141],"category_scores_gemma":[0.04210073,0.000390135,0.001327883,0.003996951,0.002085679,0.005007794,0.002837803,0.002025332,0.000621214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002327842,"about_ca_system_score_gemma":0.0009471244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000969364,"about_ca_topic_score_gemma":0.0008786743,"domain_scores_codex":[0.9912437,0.003517405,0.0006467518,0.002164102,0.002110723,0.0003173565],"domain_scores_gemma":[0.9683091,0.01891726,0.004127525,0.004282755,0.003583902,0.0007794959],"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.0009217547,0.0002028628,0.03128407,0.00113184,0.0006868619,0.0004575982,0.001039663,0.4268127,0.01948181,0.1383425,0.006353276,0.3732851],"study_design_scores_gemma":[0.00004796172,0.0003942423,0.008733965,0.0001057616,0.00007864861,0.0009832939,0.0002910994,0.7955493,0.01171379,0.1711273,0.0108562,0.000118444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1250627,0.001550687,0.8680665,0.0005198706,0.0001084533,0.0001343969,0.001118897,0.0009513267,0.002487004],"genre_scores_gemma":[0.491826,0.0003049384,0.5037017,0.0001901265,0.0001754558,0.0002798508,0.002287935,0.0004562573,0.0007777039],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006373764,"threshold_uncertainty_score":0.0337081,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}