{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007408145,0.0006481349,0.00054949,0.0005900034,0.0005117307,0.0005137739,0.003017311,0.000268547,0.00001376175],"category_scores_gemma":[0.00003677267,0.0005044122,0.0001330038,0.0006220659,0.0006603038,0.0004429288,0.001238624,0.000546163,0.00002229837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005340002,"about_ca_system_score_gemma":0.0007469465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002539586,"about_ca_topic_score_gemma":0.00001390547,"domain_scores_codex":[0.9953411,0.00003336095,0.0004298612,0.002032915,0.001282485,0.0008802371],"domain_scores_gemma":[0.9968325,0.0004031225,0.0003197695,0.001800605,0.000327807,0.0003161811],"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.000009561794,0.00008573903,0.000005016993,0.0000402775,0.00002224868,0.0001364489,0.0004851184,0.0648747,0.0001372562,0.02563481,0.0003716069,0.9081972],"study_design_scores_gemma":[0.0005792836,0.0003957233,0.000004086203,0.000513114,0.000013754,0.00012298,4.0609e-7,0.9578329,0.001640088,0.02373751,0.01438732,0.0007728564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001163547,0.0002883804,0.9954822,0.0009286505,0.001311828,0.0009587214,0.00004932816,0.0001396933,0.0008295291],"genre_scores_gemma":[0.001151485,0.00003477724,0.9963753,0.001704724,0.0002031832,0.00004161828,0.00001758053,0.00004002503,0.0004313326],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9074243,"threshold_uncertainty_score":0.9997407,"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."}}