{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009751432,0.0005615251,0.0008752287,0.001451613,0.0007803998,0.001530153,0.001105139,0.001006285,0.005526544],"category_scores_gemma":[0.005956025,0.0003859311,0.000821295,0.002568591,0.001062115,0.003438398,0.001683928,0.001038905,0.002818532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006943114,"about_ca_system_score_gemma":0.00095531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005873266,"about_ca_topic_score_gemma":0.0009016215,"domain_scores_codex":[0.998604,0.0002483642,0.0002124329,0.0002837149,0.0004933065,0.0001581067],"domain_scores_gemma":[0.9961804,0.001598396,0.0002831549,0.0009907873,0.0008439806,0.0001032838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006412177,0.0002582502,0.00242606,0.0006819324,0.00008706994,0.0007677285,0.001152294,0.01848288,0.09081627,0.2341922,0.005563226,0.644931],"study_design_scores_gemma":[0.0001886144,0.0008006716,0.002251843,0.0001776534,0.00009329998,0.001837728,0.0004729388,0.3547366,0.1820614,0.3786451,0.07858685,0.0001472698],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1134431,0.0004396778,0.8730161,0.0002452142,0.0001859142,0.000206155,0.0003067222,0.002964296,0.009192797],"genre_scores_gemma":[0.2207053,0.0002760944,0.7670078,0.0002390048,0.00007293239,0.0002002072,0.001317738,0.0004506215,0.009730348],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005526544,"threshold_uncertainty_score":0.01848811,"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."}}