{"id":"W1554777263","doi":"10.3233/fi-2009-203","title":"Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences","year":2009,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Algorithm","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.0003693033,0.000196642,0.0002409902,0.0001616616,0.0002025831,0.0003663216,0.0008625237,0.00006730699,0.00001315717],"category_scores_gemma":[0.00005101355,0.0001657431,0.0000716581,0.000248187,0.00003876038,0.002003703,0.0002801082,0.0001402704,0.00005828126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008155261,"about_ca_system_score_gemma":0.00004354745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003525386,"about_ca_topic_score_gemma":0.000005910141,"domain_scores_codex":[0.9983318,0.00002500462,0.00058149,0.0002739945,0.000300683,0.0004870538],"domain_scores_gemma":[0.9990416,0.0001673638,0.000163474,0.0004611448,0.00005186458,0.0001145768],"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.00002753494,0.0001796938,0.001891144,0.00005435103,0.00001230936,0.00001182247,0.004700815,0.0008093731,0.0002865593,0.004319338,0.001456017,0.9862511],"study_design_scores_gemma":[0.001295363,0.0002297035,0.007494742,0.00009784119,0.000002505343,0.00001762364,0.0002959864,0.9815614,0.0005950687,0.001179316,0.006972005,0.0002584802],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04449467,0.00004493361,0.9525392,0.0005468833,0.0003740089,0.0006253374,0.00002868605,0.0001677064,0.001178586],"genre_scores_gemma":[0.5428582,0.000004669669,0.4557664,0.001184825,0.00006954039,0.00001729321,0.00004292334,0.000005148751,0.0000509793],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9859926,"threshold_uncertainty_score":0.6758808,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04411499827165773,"score_gpt":0.2931381936751837,"score_spread":0.249023195403526,"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."}}