{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001764997,0.002539075,0.002336659,0.003369177,0.002009993,0.002504636,0.004080852,0.002012476,0.01958465],"category_scores_gemma":[0.005608305,0.001358279,0.001798727,0.004763794,0.0009887216,0.003525666,0.003379365,0.002926486,0.02629968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001018626,"about_ca_system_score_gemma":0.001735658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001773447,"about_ca_topic_score_gemma":0.003001575,"domain_scores_codex":[0.9974265,0.0005389763,0.0002996607,0.0007021275,0.0008500253,0.0001826953],"domain_scores_gemma":[0.998278,0.0004590747,0.0001454053,0.0006198174,0.0004427924,0.00005490138],"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.0003011045,0.000203422,0.0009624128,0.0007320984,0.0002821729,0.0003244747,0.0003498268,0.02788896,0.022268,0.04150371,0.1005813,0.8046025],"study_design_scores_gemma":[0.0003844406,0.000321071,0.001245706,0.0001881725,0.0001814235,0.001621006,0.0003374609,0.515889,0.04446217,0.1470543,0.2881257,0.0001895879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001388685,0.0004372453,0.9829811,0.0001061191,0.0001497098,0.0002212509,0.000740667,0.01147219,0.002502919],"genre_scores_gemma":[0.01155518,0.0002055538,0.9810647,0.000110745,0.00006205556,0.0005079597,0.002679969,0.0008202665,0.002993445],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01958465,"threshold_uncertainty_score":0.06551719,"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."}}