{"id":"W2039408705","doi":"10.1109/bibm.2014.6999126","title":"Konnector: Connecting paired-end reads using a bloom filter de Bruijn graph","year":2014,"lang":"en","type":"article","venue":"","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"BC Cancer Agency","funders":"BC Cancer Agency; National Institutes of Health","keywords":"Bloom filter; De Bruijn graph; Computer science; De Bruijn sequence; Byte; Hash function; Hash table; Software; MIT License; Graph; Theoretical computer science; Parallel computing; Algorithm; Operating system; Programming language; 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.002361315,0.001598891,0.00108366,0.002911307,0.001460711,0.002586447,0.003043493,0.001553668,0.0158657],"category_scores_gemma":[0.01058935,0.001687926,0.001580904,0.002697867,0.0007731661,0.002863826,0.002525334,0.001912376,0.008910908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009600524,"about_ca_system_score_gemma":0.002093339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004816767,"about_ca_topic_score_gemma":0.006910226,"domain_scores_codex":[0.9978333,0.000389428,0.0002319558,0.0006739271,0.0007182555,0.0001531734],"domain_scores_gemma":[0.9961009,0.002113119,0.0003727919,0.0006497226,0.0006181896,0.0001453504],"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.002078929,0.0003536048,0.01045128,0.003088528,0.0006779867,0.0009636363,0.001897501,0.05624526,0.09326224,0.04732908,0.1585593,0.6250927],"study_design_scores_gemma":[0.0003494858,0.0004069581,0.00446035,0.000406994,0.000198859,0.001134261,0.0006272901,0.4212742,0.1889942,0.1057154,0.275939,0.0004930911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01021371,0.0002715005,0.8640592,0.0001707054,0.0001757913,0.0002954058,0.01083645,0.1111321,0.002845177],"genre_scores_gemma":[0.06113673,0.0002641868,0.9044631,0.0002528598,0.00003726656,0.0006116946,0.0175221,0.01068258,0.005029569],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0158657,"threshold_uncertainty_score":0.05307609,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01854539944969404,"score_gpt":0.2400187080962808,"score_spread":0.2214733086465868,"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."}}