{"id":"W2129107669","doi":"10.1109/iembs.2008.4649419","title":"An efficient algorithm for local sequence alignment","year":2008,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Substring; Smith–Waterman algorithm; Pairwise comparison; Algorithm; Computer science; Multiple sequence alignment; Sequence (biology); Sensitivity (control systems); String searching algorithm; Suffix tree; Matching (statistics); Tree (set theory); Algorithm design; Pattern matching; Sequence alignment; Mathematics; Data structure; Artificial intelligence; Combinatorics","routes":{"ca_aff":true,"ca_fund":false,"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.0001442907,0.0001086544,0.0001043371,0.00003905271,0.0002410077,0.00005262418,0.0007529256,0.0000385293,0.00001826312],"category_scores_gemma":[0.000003074974,0.0000830413,0.00004239828,0.0001219821,0.0000628094,0.0003068604,0.0001786204,0.00004389093,0.00003741042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004463426,"about_ca_system_score_gemma":0.0000623707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000573138,"about_ca_topic_score_gemma":9.008092e-7,"domain_scores_codex":[0.9988756,0.00002163656,0.0001520596,0.0004088921,0.0002763424,0.0002654645],"domain_scores_gemma":[0.9991007,0.00003706089,0.00003539416,0.0006103197,0.00006451689,0.0001519735],"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.00000310456,0.000276805,0.00001475101,0.00000375342,0.000006467494,0.00004258615,0.0003158038,0.00748497,0.000637388,0.022922,0.004873571,0.9634188],"study_design_scores_gemma":[0.0002539355,0.0001648416,0.00009924726,0.000004727905,0.000001196917,0.00005614255,0.00001958112,0.9863982,0.004412332,0.0003819274,0.008068985,0.0001388912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00120403,0.00003418217,0.997654,0.0001245983,0.0002732144,0.0001927177,0.00001516092,0.0001845355,0.000317522],"genre_scores_gemma":[0.1300653,0.00000832379,0.8691483,0.0004151438,0.00007951864,0.00003314851,0.00001675984,0.000006380642,0.0002271593],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9789132,"threshold_uncertainty_score":0.3386326,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03254838593944982,"score_gpt":0.2805729969347189,"score_spread":0.2480246109952691,"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."}}