{"id":"W2395902960","doi":"","title":"Minimum many-to-many matchings for computing the distance between two sequences","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Combinatorics; Theoretical computer science; Mathematics","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.002253741,0.001440513,0.003181443,0.005347287,0.001994052,0.003032581,0.004160318,0.003381627,0.006842471],"category_scores_gemma":[0.02009834,0.0009556659,0.001754215,0.005852415,0.001870818,0.007867646,0.003845701,0.002736454,0.002096721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002128785,"about_ca_system_score_gemma":0.001897817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002754346,"about_ca_topic_score_gemma":0.00463371,"domain_scores_codex":[0.9967825,0.0006367867,0.000345065,0.001015842,0.0009052376,0.0003145596],"domain_scores_gemma":[0.9931355,0.004036583,0.0005709297,0.001263321,0.0006400552,0.0003537464],"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.00248414,0.0007710834,0.006151683,0.001074253,0.0003332758,0.0002306858,0.0008184842,0.2848493,0.01408323,0.1856137,0.01488828,0.4887018],"study_design_scores_gemma":[0.0001224388,0.0002420253,0.0008191969,0.00006885273,0.00006874643,0.0002175837,0.0002062695,0.7097119,0.004112429,0.2818485,0.002527773,0.0000542128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1092655,0.0009782006,0.8812673,0.0007155575,0.0001484755,0.0002614043,0.001701906,0.001949049,0.003712618],"genre_scores_gemma":[0.4107177,0.0004695832,0.5800552,0.0002412597,0.0001485736,0.0003978847,0.003825201,0.0003628568,0.003781691],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006842471,"threshold_uncertainty_score":0.02289033,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03947693002219832,"score_gpt":0.2458477516972585,"score_spread":0.2063708216750602,"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."}}