{"id":"W4413998513","doi":"10.3389/fbinf.2025.1577324","title":"A novel linear indexing method for strings under all internal nodes in a suffix tree","year":2025,"lang":"en","type":"article","venue":"Frontiers in Bioinformatics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"University of Connecticut","keywords":"Search engine indexing; Suffix; Generalized suffix tree; Computer science; Tree (set theory); Compressed suffix array; Suffix tree; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Data structure; Combinatorics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0005807553,0.000152643,0.0002584308,0.0005248299,0.00004794579,0.0001369615,0.0009063955,0.0001106949,7.029739e-7],"category_scores_gemma":[0.00008132881,0.0001367239,0.00005971621,0.0003991519,0.0000277121,0.0008504672,0.0004925845,0.0002278445,0.00000140461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001571651,"about_ca_system_score_gemma":0.0001099146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001035433,"about_ca_topic_score_gemma":0.00004342855,"domain_scores_codex":[0.99876,0.00001933199,0.0005299004,0.0001943029,0.0001715485,0.0003248942],"domain_scores_gemma":[0.9992946,0.0001213519,0.0001289015,0.0003636187,0.00004336234,0.00004813527],"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.0001637985,0.000441,0.01153032,0.0005455665,0.0001423744,0.000008151907,0.009273064,0.01472543,0.0002446247,0.04598818,0.03370809,0.8832294],"study_design_scores_gemma":[0.001254836,0.00003003295,0.001225515,0.0002101845,0.000004573829,0.000002744761,0.0004723972,0.9838126,0.0002906699,0.004042136,0.008504615,0.0001496411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000410456,0.00009654065,0.9971238,0.0003151706,0.0008232952,0.000263848,0.00001747309,0.00004809478,0.0009013399],"genre_scores_gemma":[0.001253803,0.00002107002,0.9976184,0.0008321859,0.00002262492,0.00002215531,0.00001560269,0.000005737155,0.0002083997],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9690872,"threshold_uncertainty_score":0.5575439,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01974927913347399,"score_gpt":0.3020532318946071,"score_spread":0.2823039527611331,"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."}}