{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000419995,0.0003154151,0.0003275119,0.0001968903,0.0006650862,0.0002589585,0.001090523,0.0001010327,0.00001006198],"category_scores_gemma":[0.000003168913,0.0003096098,0.0002446684,0.0003103721,0.00007841433,0.0008907765,0.00001230493,0.0003104095,0.00003416993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009069068,"about_ca_system_score_gemma":0.00005198924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004730707,"about_ca_topic_score_gemma":0.00001762202,"domain_scores_codex":[0.997867,0.00009405587,0.0003897282,0.0006680293,0.0004385456,0.0005425893],"domain_scores_gemma":[0.9984667,0.0002916168,0.00009196887,0.0007947293,0.0001185807,0.0002363739],"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.0000317441,0.0002013798,0.000001079561,0.00006081092,0.00004841101,0.000003315954,0.0003132275,0.11217,0.0004336051,0.001763092,0.0003773104,0.884596],"study_design_scores_gemma":[0.001254121,0.0002428284,0.00005364411,0.0001325843,0.00001553464,0.00002428146,0.00001790023,0.9747879,0.02043334,0.0006184488,0.002025157,0.0003942838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001553692,0.00001707958,0.9938372,0.0002742106,0.003088148,0.0004364043,0.00004685867,0.0005441743,0.0002022462],"genre_scores_gemma":[0.5754748,0.00001363629,0.4236403,0.0004321109,0.0002593604,0.0000685587,0.000008989996,0.00003370325,0.00006858129],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8842018,"threshold_uncertainty_score":0.9999356,"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."}}