{"id":"W1981541922","doi":"10.1016/s0022-0000(02)00006-5","title":"Methods for reconstructing the history of tandem repeats and their application to the human genome","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University; University of Alberta; University of Waterloo","funders":"University of Waterloo; McMaster University","keywords":"Tandem repeat; Steiner tree problem; Combinatorics; Computer science; Heuristic; Gene duplication; Tandem exon duplication; Tree (set theory); Mathematics; Algorithm; Genome; Artificial intelligence; Biology; Genetics; Gene","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.002335445,0.0007707679,0.0008252957,0.003845509,0.0009467017,0.001458792,0.001929186,0.001558164,0.002505758],"category_scores_gemma":[0.01362563,0.0009471248,0.001138181,0.003518789,0.001410228,0.00178631,0.001629156,0.001892772,0.00096138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005693731,"about_ca_system_score_gemma":0.0009004399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003757516,"about_ca_topic_score_gemma":0.004811899,"domain_scores_codex":[0.9994802,0.0001537183,0.00004990282,0.0001427569,0.0001427574,0.00003067412],"domain_scores_gemma":[0.9946988,0.003861462,0.0003671868,0.0006362796,0.000305942,0.0001303058],"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.0002815882,0.0000958258,0.005628102,0.0003423998,0.0001913212,0.0002715861,0.0006187442,0.2943659,0.0138277,0.0521779,0.00241747,0.6297814],"study_design_scores_gemma":[0.0000600119,0.00004450737,0.001669209,0.00005450136,0.00006992649,0.0003752462,0.0001162242,0.9073428,0.004668333,0.081344,0.004187349,0.00006798716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01642366,0.001060705,0.9808945,0.0001783242,0.00004939363,0.00002507721,0.0001892367,0.0006416629,0.0005374184],"genre_scores_gemma":[0.1229052,0.001972804,0.8719652,0.00007690369,0.0001499228,0.0001511375,0.0006745331,0.000390409,0.001713898],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003845509,"threshold_uncertainty_score":0.01235116,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05563502447013171,"score_gpt":0.3049894265544741,"score_spread":0.2493544020843424,"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."}}