{"id":"W2153611381","doi":"10.1007/11880561_11","title":"Inverted Files Versus Suffix Arrays for Locating Patterns in Primary Memory","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Compressed suffix array; Suffix array; Inverted index; Suffix; String searching algorithm; Pattern matching; Data structure; Word (group theory); Matching (statistics); Algorithm; Information retrieval; Artificial intelligence; Mathematics; Programming language; Search engine indexing","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.0007445785,0.0005733829,0.0006142653,0.0008209408,0.0002542869,0.0004633175,0.003445208,0.0003482358,0.00001215527],"category_scores_gemma":[0.00008908231,0.0005314611,0.0001344026,0.0005199467,0.0003215132,0.0008519252,0.001716455,0.000717643,0.00001208357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004772941,"about_ca_system_score_gemma":0.0005807054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002142916,"about_ca_topic_score_gemma":0.0003255401,"domain_scores_codex":[0.9958885,0.00003689442,0.0006744577,0.001742867,0.0008587719,0.0007984982],"domain_scores_gemma":[0.9969018,0.0009864757,0.0003431448,0.001438334,0.0001935727,0.0001366641],"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.00003447841,0.0000737369,0.0001363601,0.0001657164,0.00001033597,0.0000852598,0.0004902986,0.05757564,0.000165772,0.002110561,0.0004604384,0.9386914],"study_design_scores_gemma":[0.001224579,0.0002314318,0.0005861967,0.000886361,0.000007164083,0.00001697501,4.387281e-7,0.9770101,0.0007869849,0.01701182,0.001375323,0.0008626295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002159608,0.0003338326,0.9940969,0.0002469051,0.00253672,0.0006122494,0.00004735652,0.0001470723,0.001763057],"genre_scores_gemma":[0.04725106,0.00004995029,0.9490182,0.001669387,0.001296113,0.00006894389,0.0002367466,0.0000841562,0.0003253871],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9378288,"threshold_uncertainty_score":0.9997137,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02071201063024454,"score_gpt":0.2418302402477684,"score_spread":0.2211182296175239,"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."}}