{"id":"W2119670115","doi":"10.1109/bibe.2003.1188947","title":"An algorithm to reconstruct a target DNA sequence from its spectrum connected at a given level","year":2003,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Substring; Sequence (biology); Algorithm; DNA; Sequencing by hybridization; DNA sequencing; Sequence logo; Set (abstract data type); Combinatorics; Computer science; Mathematics; Biology; Genetics; Consensus sequence; Base sequence","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.0008041024,0.001025184,0.0008900668,0.001827678,0.0008270721,0.001224392,0.001726747,0.00192669,0.005406597],"category_scores_gemma":[0.002389503,0.0005546485,0.001155504,0.001714129,0.0009752176,0.002248646,0.001405065,0.001479087,0.00266213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008193518,"about_ca_system_score_gemma":0.001593402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001382869,"about_ca_topic_score_gemma":0.002062964,"domain_scores_codex":[0.9994867,0.00007729268,0.00004998202,0.000197355,0.0001291677,0.00005954551],"domain_scores_gemma":[0.9989924,0.0004718687,0.000102775,0.0002608843,0.0001321312,0.00003984721],"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.0005390472,0.000339787,0.002268067,0.0005498368,0.0001656948,0.0002776777,0.0003632702,0.06280421,0.03636265,0.0281925,0.0153425,0.8527947],"study_design_scores_gemma":[0.0002938958,0.0003467573,0.001711427,0.0001058372,0.0001391008,0.001444431,0.0004254178,0.8438467,0.04646261,0.08043594,0.02471094,0.00007696555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0158815,0.0002932551,0.9781546,0.0003026619,0.00006375422,0.0002295812,0.0003626531,0.00251167,0.002200395],"genre_scores_gemma":[0.04515205,0.0001766166,0.9495323,0.0001553772,0.00003086986,0.0003670038,0.00162671,0.0001364872,0.002822628],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005406597,"threshold_uncertainty_score":0.01808685,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04397927270893588,"score_gpt":0.2689294272750023,"score_spread":0.2249501545660664,"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."}}