{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008759871,0.0007847755,0.001319133,0.00264552,0.001271349,0.002211254,0.001787326,0.001010279,0.005023564],"category_scores_gemma":[0.005697152,0.0004632942,0.0009434853,0.005278647,0.0008630284,0.005531698,0.002315766,0.00140404,0.005370436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006898725,"about_ca_system_score_gemma":0.002677394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001449106,"about_ca_topic_score_gemma":0.002015293,"domain_scores_codex":[0.9982893,0.0001716534,0.0002391473,0.0003944249,0.000773414,0.0001319653],"domain_scores_gemma":[0.9973052,0.0007505404,0.0002530359,0.0007388205,0.0008117823,0.0001406751],"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.0002940624,0.0001895013,0.000975518,0.0004284564,0.0000527169,0.0001862073,0.0004648933,0.01048842,0.05486055,0.04913285,0.01362607,0.8693008],"study_design_scores_gemma":[0.0002678527,0.0007933018,0.001355177,0.0001631438,0.0001560771,0.002505317,0.0005768951,0.659881,0.1061072,0.1307643,0.09720081,0.0002289252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004277341,0.0002883412,0.9916818,0.000106232,0.0001338997,0.00009847265,0.0002954928,0.001840537,0.001277846],"genre_scores_gemma":[0.02596599,0.0003113482,0.9691247,0.0001051567,0.0001568876,0.0001874625,0.00126356,0.0003062401,0.00257855],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005023564,"threshold_uncertainty_score":0.01680553,"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."}}