{"id":"W2101882219","doi":"10.1007/978-3-540-70600-7_7","title":"Searching for Supermaximal Repeats in Large DNA Sequences","year":2008,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Suffix; Suffix tree; Computer science; Index (typography); Tree (set theory); Algorithm; Generalized suffix tree; Computational biology; Biology; Mathematics; Data structure; Combinatorics; Programming language; Linguistics","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.000483999,0.0004138064,0.0006959431,0.001159723,0.0005294313,0.0006013477,0.00114022,0.0007839735,0.004464292],"category_scores_gemma":[0.002865523,0.0004434348,0.0004637058,0.001875646,0.0004169724,0.001711228,0.0007570591,0.0006886869,0.001360233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002269256,"about_ca_system_score_gemma":0.0004704565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002575802,"about_ca_topic_score_gemma":0.0008707025,"domain_scores_codex":[0.9996721,0.00005283235,0.00003126932,0.0001095096,0.0001104832,0.00002397602],"domain_scores_gemma":[0.998616,0.0008284214,0.0001876577,0.0002011531,0.00009295091,0.00007386886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001133211,0.0001677402,0.01006266,0.001305587,0.0001653917,0.001472275,0.0008749729,0.02322611,0.2694418,0.04747844,0.008669605,0.6360022],"study_design_scores_gemma":[0.0001544179,0.0006627971,0.008408703,0.0002418219,0.0002286587,0.005529262,0.0009787065,0.4482382,0.2681553,0.2288877,0.03839963,0.000114759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4623203,0.003441143,0.5211247,0.0005627458,0.0001404693,0.0001077677,0.001425205,0.002944065,0.007933616],"genre_scores_gemma":[0.4837619,0.001337451,0.5043687,0.000230994,0.0001229351,0.0001057933,0.003390233,0.0003929649,0.006288965],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004464292,"threshold_uncertainty_score":0.01493454,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.055909415260263,"score_gpt":0.3174156906200162,"score_spread":0.2615062753597532,"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."}}