{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009630743,0.0001024104,0.0001128519,0.0002321064,0.00006585502,0.00004995049,0.000541309,0.00005931172,0.0001334862],"category_scores_gemma":[0.00001103475,0.00008740574,0.00003240181,0.0004890888,0.00004027443,0.001211697,0.0002750919,0.00004904989,0.0000829832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004128968,"about_ca_system_score_gemma":0.00001625818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001612076,"about_ca_topic_score_gemma":0.000002347826,"domain_scores_codex":[0.9990159,0.00001761896,0.0003119829,0.0001849905,0.0002820387,0.000187425],"domain_scores_gemma":[0.9992142,0.00001454141,0.0001507416,0.000471936,0.0001033452,0.00004525179],"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":[3.733088e-7,0.00003186576,0.0001495443,0.000006791542,0.000009151532,0.000003212309,0.000293623,0.0000108847,0.004438608,0.006181002,0.0006810717,0.9881939],"study_design_scores_gemma":[0.001365993,0.0003240222,0.0005320131,0.00003483907,0.00001115543,0.00005529236,0.0004794102,0.7533271,0.2272372,0.003360863,0.01288783,0.0003842935],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001540521,0.00006282113,0.997447,0.0003289735,0.0001048465,0.0001945266,0.00002112441,0.0001984715,0.0001017007],"genre_scores_gemma":[0.07247922,0.00003738729,0.9272075,0.000182471,0.000008906446,0.00002633589,0.00002681109,0.000003590962,0.00002780993],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9878096,"threshold_uncertainty_score":0.3564303,"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."}}