{"id":"W1973228454","doi":"10.1007/s00453-012-9726-3","title":"Efficient Fully-Compressed Sequence Representations","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Disjoint sets; Substring; Mathematics; Amortized analysis; Redundancy (engineering); Data structure; Binary logarithm; Compressed suffix array; Subsequence; Algorithm; Sequence (biology); Discrete mathematics; Suffix tree; Computer science","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.0007037903,0.001180836,0.001017344,0.001543336,0.0004400545,0.001743359,0.001374427,0.001556383,0.005755917],"category_scores_gemma":[0.006186249,0.0004831679,0.0005678613,0.002397514,0.0007018791,0.003609467,0.002130844,0.001674044,0.002328351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004397981,"about_ca_system_score_gemma":0.001287453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009015275,"about_ca_topic_score_gemma":0.001422793,"domain_scores_codex":[0.9987448,0.000250496,0.0000989518,0.0001998757,0.0005754146,0.0001304006],"domain_scores_gemma":[0.9975072,0.0009110777,0.0001396024,0.0009139878,0.0004584879,0.00006965807],"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.0009083133,0.0002542275,0.0005998759,0.0002755035,0.00006347965,0.000387955,0.0001755752,0.1090471,0.03244301,0.09212741,0.017337,0.7463806],"study_design_scores_gemma":[0.00008401243,0.0001706996,0.0003383961,0.00005765121,0.00003170966,0.0005812052,0.00008781894,0.8715865,0.02488552,0.09434929,0.007790629,0.00003660168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02962774,0.000811587,0.9623908,0.0005845553,0.0003180404,0.00010453,0.001083826,0.001610772,0.003468188],"genre_scores_gemma":[0.2952037,0.001287146,0.6863126,0.0004313586,0.000531397,0.0004100451,0.004614764,0.0003817899,0.01082729],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005755917,"threshold_uncertainty_score":0.01925552,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03079680232543067,"score_gpt":0.2926913199302248,"score_spread":0.2618945176047941,"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."}}