{"id":"W2080616298","doi":"10.1016/j.tcs.2012.02.001","title":"A linear partitioning algorithm for Hybrid Lyndons using<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>V</mml:mi></mml:math>-order","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lexicographical order; Factorization; Algorithm; Concatenation (mathematics); Order (exchange); String (physics); Computer science; Generalization; Mathematics; Edit distance; Discrete mathematics; Combinatorics","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.0007249346,0.0006876188,0.0007759383,0.00148947,0.001031543,0.00165657,0.001572938,0.0007984632,0.01472971],"category_scores_gemma":[0.002569985,0.0005618462,0.0007884616,0.001468209,0.0007051522,0.001726863,0.002126844,0.00127703,0.004837883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009855039,"about_ca_system_score_gemma":0.00129095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005524872,"about_ca_topic_score_gemma":0.009449497,"domain_scores_codex":[0.999453,0.00008494663,0.00005998453,0.0001267223,0.0002061307,0.00006921825],"domain_scores_gemma":[0.9991645,0.0003314745,0.00004669726,0.0001743742,0.0002240165,0.00005901972],"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.0005882401,0.0001529643,0.0008211922,0.0002758841,0.00005561546,0.0001433821,0.0004174572,0.04862024,0.02627281,0.05416043,0.01858195,0.8499098],"study_design_scores_gemma":[0.000236754,0.0003159611,0.0006520177,0.00009231533,0.0000478013,0.0003465123,0.0004192917,0.8643466,0.03180074,0.07020079,0.03145768,0.00008359623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01336958,0.0001783612,0.9796243,0.0001116557,0.00005124487,0.0000904182,0.000197702,0.002381188,0.003995506],"genre_scores_gemma":[0.07649239,0.0001315614,0.9126287,0.00009710396,0.00003974913,0.0002114297,0.001286106,0.0007687404,0.008344225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01472971,"threshold_uncertainty_score":0.04927576,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01912243201583043,"score_gpt":0.2641328297190501,"score_spread":0.2450103977032196,"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."}}