{"id":"W2009601525","doi":"10.1109/tc.2013.29","title":"FLOTT—A Fast, Low Memory T-TransformAlgorithm for Measuring String Complexity","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; String (physics); Algorithm; Suffix; Time complexity; Compressed suffix array; Computational complexity theory; Suffix tree; Theoretical computer science; Measure (data warehouse); Generalized suffix tree; Data structure; Mathematics; Data mining; Programming language","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001043617,0.001134571,0.0007795336,0.002893316,0.001036321,0.00182424,0.001721729,0.001092971,0.007712521],"category_scores_gemma":[0.00884565,0.0004194585,0.0008359605,0.00251986,0.0009136011,0.003548364,0.001713599,0.0012142,0.003561492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001181335,"about_ca_system_score_gemma":0.001704174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002059988,"about_ca_topic_score_gemma":0.002475199,"domain_scores_codex":[0.9983363,0.0001668891,0.0001188727,0.000217302,0.001016118,0.0001445932],"domain_scores_gemma":[0.9972235,0.0009678158,0.0003922081,0.000492782,0.0007950959,0.0001286924],"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.0007801297,0.0001533615,0.004163837,0.0004209437,0.0001130811,0.0001852022,0.0002213563,0.04005376,0.06562441,0.03626258,0.02442255,0.8275988],"study_design_scores_gemma":[0.0001553086,0.000649691,0.003526368,0.00009714285,0.00006633993,0.0007995963,0.0001753524,0.7473297,0.155946,0.05441987,0.03666119,0.0001733441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01925766,0.0004872759,0.968037,0.00009961287,0.0001260111,0.0001350831,0.000479719,0.007949655,0.003427939],"genre_scores_gemma":[0.1481605,0.000391743,0.8430868,0.0001340837,0.0001136282,0.0004405499,0.002549029,0.001239879,0.003883815],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007712521,"threshold_uncertainty_score":0.02580094,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0322719717284187,"score_gpt":0.239515721880065,"score_spread":0.2072437501516463,"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."}}