{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001687784,0.001449984,0.000918559,0.001755391,0.001523907,0.001233741,0.004190479,0.001785261,0.01033307],"category_scores_gemma":[0.007385872,0.001073043,0.00100341,0.002251236,0.0006981884,0.001575466,0.001845811,0.002109094,0.005034253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000668726,"about_ca_system_score_gemma":0.001658806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001731742,"about_ca_topic_score_gemma":0.002118696,"domain_scores_codex":[0.9984739,0.0003505201,0.0001676923,0.0003095366,0.0005644619,0.0001338138],"domain_scores_gemma":[0.9978934,0.0009704541,0.0002134578,0.0002480917,0.0005501472,0.0001244955],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001635624,0.0007680586,0.006382145,0.002124205,0.0005024903,0.002039643,0.0008876936,0.1078611,0.06937423,0.03461855,0.1279383,0.6458679],"study_design_scores_gemma":[0.0005480524,0.0001913049,0.001782524,0.0001797355,0.00008254752,0.0006685517,0.00008792729,0.8411177,0.04067855,0.03908314,0.07546901,0.0001109924],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007395155,0.0004262479,0.9356598,0.0002535706,0.00014547,0.0002845431,0.00153451,0.05083216,0.003468572],"genre_scores_gemma":[0.03646697,0.0002668959,0.9523897,0.0001290004,0.00005432232,0.001011896,0.004078244,0.002628206,0.002974793],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01033307,"threshold_uncertainty_score":0.03456753,"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."}}