{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002019307,0.0002412077,0.0002589693,0.0001068876,0.0002352454,0.0002265918,0.001149065,0.00009140786,0.00117905],"category_scores_gemma":[0.00006586291,0.000206755,0.00005244039,0.0004548581,0.00003391171,0.0009967561,0.000380805,0.0001334421,0.0005219537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001135359,"about_ca_system_score_gemma":0.0001316128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003601401,"about_ca_topic_score_gemma":0.00008664591,"domain_scores_codex":[0.9978673,0.0001559136,0.0002849841,0.0008859454,0.0003324652,0.0004733515],"domain_scores_gemma":[0.9982696,0.00009802432,0.00008391064,0.001050945,0.00008754682,0.0004099814],"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.0000874902,0.0008523958,0.003064718,0.0000276545,0.0002326589,0.0009524385,0.004453716,0.0006153864,0.2562771,0.1372139,0.05349835,0.5427243],"study_design_scores_gemma":[0.00137378,0.0005116411,0.004690836,0.0000747061,0.00001142269,0.0002597813,0.0001169161,0.6006886,0.2995744,0.02784703,0.06351633,0.001334555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03681122,0.00006361779,0.9588457,0.0006202518,0.0006234163,0.0002662285,0.0003687411,0.0003184321,0.002082423],"genre_scores_gemma":[0.08991993,0.000007640304,0.9082795,0.0008216948,0.00009261989,0.00001688311,0.00006769147,0.00001628602,0.0007777368],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6000732,"threshold_uncertainty_score":0.999734,"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."}}