{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001372377,0.0001972689,0.0002517603,0.001026545,0.0006594647,0.0005004003,0.003702984,0.0001118825,0.000003134125],"category_scores_gemma":[0.00005394797,0.0001884412,0.00004606767,0.0003790985,0.0005108856,0.009444362,0.003210634,0.0004124845,0.00001531564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001326733,"about_ca_system_score_gemma":0.0003853384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002621489,"about_ca_topic_score_gemma":0.00002656337,"domain_scores_codex":[0.9981791,0.00003322209,0.0006637373,0.0003478659,0.0004411281,0.0003348857],"domain_scores_gemma":[0.9973264,0.0002770823,0.0002131386,0.00182764,0.0002589702,0.00009673335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004266478,0.00003161972,0.0001044122,0.0000402667,0.000003182556,0.000002042429,0.004811949,0.0002325473,0.000006334316,0.6294575,0.000455905,0.36485],"study_design_scores_gemma":[0.0004276579,0.0000538556,0.00148569,0.0002608347,0.000001303462,0.00004296478,0.00002108102,0.776513,0.00001159188,0.006527276,0.2143643,0.0002904863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003723886,0.0008415671,0.9151082,0.001149741,0.0003977649,0.0008843709,0.00007747307,0.0001182712,0.08105024],"genre_scores_gemma":[0.08953829,0.01277091,0.8939351,0.001878779,0.0001219271,0.0001444734,0.000407095,0.00002278132,0.001180621],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7762804,"threshold_uncertainty_score":0.768441,"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."}}