{"id":"W2799512315","doi":"10.1007/978-981-10-8476-8_12","title":"BWT: An Index Structure to Speed-Up Both Exact and Inexact String Matching","year":2018,"lang":"en","type":"book-chapter","venue":"Studies in big data","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Substring; String searching algorithm; Trie; String (physics); Search tree; Approximate string matching; Pattern matching; Combinatorics; Mathematics; Redundancy (engineering); String metric; Tree (set theory); Algorithm; Set (abstract data type); Suffix tree; Computer science; Discrete mathematics; Data structure; Search algorithm; 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","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003814863,0.0004577328,0.0005674908,0.0002906203,0.0002369104,0.0002626569,0.003046974,0.0001906684,0.00002646672],"category_scores_gemma":[0.00005682998,0.0003768623,0.00002287736,0.0001020509,0.0001378133,0.001048626,0.01427161,0.0004924132,0.00001550624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007709906,"about_ca_system_score_gemma":0.00006257565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001525847,"about_ca_topic_score_gemma":0.0006448332,"domain_scores_codex":[0.9973488,0.00003170115,0.0003973385,0.001397529,0.0004583301,0.0003663097],"domain_scores_gemma":[0.9963681,0.00009074768,0.0001929117,0.003126715,0.00007291364,0.0001486003],"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.0000878674,0.0000510983,0.000389575,0.0004629109,0.0005257869,0.0004029829,0.01250634,0.00007780083,0.0000809576,0.02579241,0.1221706,0.8374516],"study_design_scores_gemma":[0.001388322,0.0005547893,0.00225231,0.003606545,0.00008803891,0.0001421167,0.001351456,0.008375672,0.00003313652,0.1409148,0.8384836,0.002809242],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03045967,0.05431762,0.7243883,0.002494109,0.06277531,0.00705899,0.03225245,0.002140968,0.08411261],"genre_scores_gemma":[0.4714754,0.02890671,0.3422943,0.007884105,0.0351797,0.00004250295,0.009924057,0.001058481,0.1032348],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8346424,"threshold_uncertainty_score":0.9998683,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1618064547317648,"score_gpt":0.3517274774142601,"score_spread":0.1899210226824954,"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."}}