{"id":"W2021216077","doi":"10.1142/s0129054105003704","title":"SORTING SUFFIXES OF TWO-PATTERN STRINGS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalized suffix tree; Mathematics; Recursion (computer science); String (physics); Sorting; Generalization; Morphism; Suffix tree; Set (abstract data type); Lexicographical order; Iterated function; Time complexity; Combinatorics; Trie; Algorithm; Discrete mathematics; Data structure; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0009386868,0.00009367461,0.0001855646,0.0006045595,0.00009423726,0.0002329199,0.003550834,0.00001853692,0.00002005619],"category_scores_gemma":[0.00009156951,0.0000805847,0.000102804,0.0004669926,0.0002583518,0.003196536,0.0007092833,0.0001238392,0.000005202894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007538328,"about_ca_system_score_gemma":0.0003744529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003202125,"about_ca_topic_score_gemma":0.000004288519,"domain_scores_codex":[0.9975466,0.00002769154,0.000819742,0.000193781,0.001255657,0.0001564883],"domain_scores_gemma":[0.9964133,0.0001410077,0.001102904,0.0003214861,0.001934864,0.00008643742],"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.000007457304,0.0002510441,0.003067381,0.000005953437,0.00004645986,0.000007978039,0.0007967012,0.01676768,0.009609021,0.03248239,0.0002181174,0.9367398],"study_design_scores_gemma":[0.001300694,0.0003013479,0.01733172,0.0003436417,0.0000131122,0.0003392937,0.00002792516,0.9149994,0.0558702,0.006375491,0.002858388,0.0002388361],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1392992,0.00003866783,0.8582563,0.001004741,0.00115896,0.00003351717,0.000003605759,0.00001052736,0.000194419],"genre_scores_gemma":[0.6862101,0.0000101584,0.3134196,0.00007556449,0.000274968,3.089152e-7,7.930567e-7,0.000002242753,0.000006354978],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.936501,"threshold_uncertainty_score":0.6598392,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01795237119105154,"score_gpt":0.3194346811573973,"score_spread":0.3014823099663458,"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."}}