{"id":"W2936676849","doi":"10.1186/s13104-019-4256-6","title":"An OpenMP-based tool for finding longest common subsequence in bioinformatics","year":2019,"lang":"en","type":"article","venue":"BMC Research Notes","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"George & Fay Yee Centre for Healthcare Innovation; Research Institute in Oncology and Hematology; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Longest common subsequence problem; Longest increasing subsequence; Computer science; Bioinformatics; Subsequence; Computational biology; Biology; Mathematics; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001091168,0.0001051179,0.0001417913,0.00009625202,0.00009994397,0.00006499436,0.0003493999,0.00009528988,0.000009207778],"category_scores_gemma":[0.0003428927,0.00009728629,0.00004821263,0.0001265471,0.00008791335,0.000002859563,0.0001189899,0.0001006578,0.00002069702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002403197,"about_ca_system_score_gemma":0.0001783516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009981824,"about_ca_topic_score_gemma":0.0005588572,"domain_scores_codex":[0.9988846,0.00009317254,0.000199291,0.0002471072,0.0001715227,0.0004043689],"domain_scores_gemma":[0.9990731,0.0002637253,0.00003765425,0.0004335014,0.0001357641,0.00005623319],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001531079,0.00006197167,0.5190077,0.0001206654,0.000009817598,7.498517e-7,0.00008302801,0.002021808,0.476161,0.0001938754,0.00009889095,0.002087366],"study_design_scores_gemma":[0.002563158,0.002403371,0.3775186,0.00009163223,0.00000734746,0.000003446912,0.0004772461,0.02528238,0.5839559,0.0007655906,0.006351702,0.0005796108],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9975991,0.0002838017,0.0009592242,0.00008824454,0.00006171125,0.0007166371,0.00004467812,0.00000250186,0.0002440987],"genre_scores_gemma":[0.9903626,0.00005768656,0.009176517,0.00006532579,0.00007543196,0.00009313932,0.00008219534,0.00001621971,0.00007091428],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1414891,"threshold_uncertainty_score":0.396722,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1330272456947429,"score_gpt":0.4072348394473478,"score_spread":0.274207593752605,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}