{"id":"W2122131968","doi":"10.1109/ccece.2000.849758","title":"Multithreaded implementation of a biomolecular sequence alignment algorithm-software/information technology","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Alignment-free sequence analysis; Multiple sequence alignment; Dynamic programming; Computer science; Sequence alignment; Smith–Waterman algorithm; Structural alignment; Sequence (biology); Tree (set theory); Algorithm; Heuristic; Pairwise comparison; Software; Artificial intelligence; Mathematics; Peptide sequence; Biology","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.001187053,0.0006558098,0.0007323173,0.0007839832,0.000630518,0.001465801,0.001789246,0.0006885293,0.008156071],"category_scores_gemma":[0.002309781,0.0005730201,0.0009115396,0.0009515202,0.0003918649,0.001323423,0.0009198275,0.001732172,0.00481447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007518808,"about_ca_system_score_gemma":0.00133505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001354362,"about_ca_topic_score_gemma":0.001405156,"domain_scores_codex":[0.9989968,0.0001703093,0.0001280549,0.000200817,0.0003764479,0.0001276004],"domain_scores_gemma":[0.9991122,0.0001778937,0.00005893429,0.0002963076,0.0002820003,0.00007261523],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007115157,0.0005767505,0.003219173,0.0005145227,0.0003091248,0.000516877,0.0004760214,0.04423631,0.1121226,0.0752738,0.03925416,0.7227891],"study_design_scores_gemma":[0.0002482562,0.0003972795,0.001619567,0.00009394353,0.0001478044,0.000654984,0.00007279159,0.6426514,0.1281279,0.0340986,0.1917659,0.0001215227],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.004773774,0.0001925304,0.9717458,0.00007623602,0.0001045725,0.0001400714,0.0001845003,0.0180168,0.004765686],"genre_scores_gemma":[0.05110071,0.0002041782,0.939644,0.0001197922,0.00004073901,0.0003783694,0.001215009,0.001865877,0.005431203],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.008156071,"threshold_uncertainty_score":0.02728474,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02036489049384143,"score_gpt":0.2750032255253125,"score_spread":0.254638335031471,"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."}}