{"id":"W3177877512","doi":"10.1016/j.csbj.2021.06.047","title":"Buffering updates enables efficient dynamic de Bruijn graphs","year":2021,"lang":"en","type":"article","venue":"Computational and Structural Biotechnology Journal","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"National Institute of Allergy and Infectious Diseases; National Human Genome Research Institute; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; Academy of Finland","keywords":"De Bruijn graph; De Bruijn sequence; Computer science; Graph; Theoretical computer science; Parallel computing; Combinatorics; Mathematics","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.0007999867,0.001105525,0.0007453365,0.001244082,0.0009984171,0.001721017,0.002132233,0.001104714,0.005911817],"category_scores_gemma":[0.01101218,0.0005510471,0.0005540227,0.001930416,0.001246208,0.004476822,0.002026487,0.001505649,0.002063066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001025712,"about_ca_system_score_gemma":0.00156784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005661551,"about_ca_topic_score_gemma":0.007982359,"domain_scores_codex":[0.9984452,0.0002424772,0.0001183489,0.00039191,0.0006313822,0.0001706556],"domain_scores_gemma":[0.9936804,0.002748367,0.0004786819,0.001878567,0.000971754,0.0002422038],"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.001394419,0.0005031075,0.003926493,0.001039738,0.00009115302,0.0006547545,0.001043883,0.2000136,0.08813388,0.06406453,0.0446572,0.5944772],"study_design_scores_gemma":[0.0001979834,0.0003207757,0.0009537656,0.000127919,0.00006037074,0.0004801468,0.0004117646,0.7902048,0.09015702,0.06965811,0.04730671,0.0001206833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1727722,0.002156268,0.7648702,0.001702664,0.0006291035,0.0003732892,0.003453647,0.03663012,0.0174126],"genre_scores_gemma":[0.520344,0.0007111696,0.4625857,0.0006558702,0.0001673425,0.0002822602,0.005470696,0.002496952,0.007285964],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005911817,"threshold_uncertainty_score":0.01977706,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004029216151197792,"score_gpt":0.2189616837727411,"score_spread":0.2149324676215434,"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."}}