{"id":"W1783789643","doi":"10.1007/3-540-45071-8_8","title":"A Space Efficient Algorithm for Sequence Alignment with Inversions","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Substring; Shuffling; Algorithm; Computation; Sequence (biology); Computer science; Smith–Waterman algorithm; Dynamic programming; Space (punctuation); Pairwise comparison; Multiple sequence alignment; Longest common subsequence problem; Sequence alignment; Combinatorics; Mathematics; Data structure; Genetics; Biology; Gene; Artificial intelligence","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.001296877,0.002711002,0.002033677,0.00257178,0.001679352,0.002034073,0.002619168,0.001812995,0.01060999],"category_scores_gemma":[0.004771371,0.001066346,0.001566508,0.004834246,0.001022117,0.003133455,0.003209481,0.002925605,0.009289952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007649678,"about_ca_system_score_gemma":0.001784334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002175776,"about_ca_topic_score_gemma":0.00332642,"domain_scores_codex":[0.998306,0.0003697477,0.0001483055,0.0003792296,0.0006243161,0.0001723706],"domain_scores_gemma":[0.9982545,0.000691833,0.0001075488,0.0004879016,0.000404798,0.00005331573],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003739231,0.0001662053,0.000296018,0.0002694195,0.00009679686,0.0001688655,0.0002509097,0.02424086,0.02805138,0.03822918,0.01897283,0.8888835],"study_design_scores_gemma":[0.0003771581,0.0005391953,0.0006291469,0.0001295206,0.0001723495,0.001271275,0.0003322811,0.6321723,0.07222243,0.2038507,0.08811441,0.0001892127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001803667,0.0002194285,0.99302,0.00006503793,0.00009191941,0.00006259446,0.0001121419,0.003683801,0.0009414149],"genre_scores_gemma":[0.01248947,0.0001600463,0.9840103,0.00006207992,0.00004934888,0.000164944,0.000551861,0.0004657562,0.002046228],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01060999,"threshold_uncertainty_score":0.03549391,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01936099125667417,"score_gpt":0.2453731477432315,"score_spread":0.2260121564865574,"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."}}