{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001615614,0.0002152838,0.0003273181,0.0001983556,0.0002263729,0.0002880437,0.003516959,0.0000715066,0.0000100504],"category_scores_gemma":[0.0001140759,0.0001718092,0.0000846303,0.0008263013,0.001580896,0.0009196678,0.002028946,0.0001380351,0.00001040729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005993469,"about_ca_system_score_gemma":0.000216846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001154728,"about_ca_topic_score_gemma":2.865447e-7,"domain_scores_codex":[0.9970577,0.00007252324,0.0004060221,0.0007614167,0.001109857,0.0005924384],"domain_scores_gemma":[0.9975021,0.0002782252,0.0001562465,0.001121564,0.0004675972,0.0004743006],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004059156,0.0001287389,0.0001480205,0.00001637672,0.000006720881,0.000004713175,0.0004101536,0.001660671,0.0004967274,0.9593083,0.0005252641,0.03725371],"study_design_scores_gemma":[0.000775897,0.0002798424,0.0004138183,0.00003677892,0.00000407338,0.00001012712,0.00001092955,0.8313634,0.007427927,0.1585144,0.0009635919,0.0001992082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007787489,0.00003680944,0.9898665,0.0004911376,0.0006101496,0.0003300535,0.00001312814,0.0001308616,0.0007338511],"genre_scores_gemma":[0.806307,0.000001386241,0.1933039,0.0002644325,0.00009903347,0.000008268126,0.000002251689,0.000007825992,0.00000590971],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8297027,"threshold_uncertainty_score":0.7006176,"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."}}