{"id":"W1201605537","doi":"10.1016/j.tcs.2015.08.008","title":"FM-index of alignment: A compressed index for similar strings","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Institute for Information and Communications Technology Promotion; Ministry of Education, Science and Technology; Ministère des Affaires Etrangères; Providence Health Care; Ministry of Science, ICT and Future Planning; National Research Foundation of Korea","keywords":"Suffix; Index (typography); Suffix array; Computer science; Compressed suffix array; Inverted index; Suffix tree; Algorithm; Search engine indexing; Mathematics; Artificial intelligence; Data structure","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001074605,0.001045415,0.001572384,0.005900476,0.001193591,0.001961081,0.001967459,0.001708601,0.01104982],"category_scores_gemma":[0.01300464,0.0004774083,0.0006056735,0.008002302,0.0009446137,0.005170679,0.002890503,0.001697587,0.004260358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009334921,"about_ca_system_score_gemma":0.001788669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001180289,"about_ca_topic_score_gemma":0.001477593,"domain_scores_codex":[0.998419,0.0002408252,0.0001617188,0.0002351833,0.0007811031,0.000162072],"domain_scores_gemma":[0.9951317,0.00125516,0.0003159905,0.002066053,0.0009611616,0.000269953],"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.002158727,0.0002672196,0.001684456,0.0004829054,0.00008401223,0.0004170956,0.0003331931,0.01133116,0.04181605,0.05735751,0.05531199,0.8287557],"study_design_scores_gemma":[0.0005814429,0.001469072,0.004017157,0.0004229803,0.0002550626,0.004108842,0.0005280274,0.4569452,0.1109117,0.284243,0.136242,0.0002755529],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06878708,0.003689897,0.890504,0.001543654,0.001247526,0.00053011,0.01014615,0.01136244,0.01218924],"genre_scores_gemma":[0.2201005,0.00140779,0.7468106,0.0008026382,0.001157439,0.0008296287,0.01718905,0.001706543,0.009995821],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01104982,"threshold_uncertainty_score":0.03696531,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02091421018035305,"score_gpt":0.2700424881084069,"score_spread":0.2491282779280539,"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."}}