Searching journal content for articles similar to Cameron et al. 27 (12): 2050.

Displaying results 1-5 of 5
For checked items
  1. ...Bruijn graphs are one of the most fundamental data structures in computational genomics. Colored compacted de Bruijn graphs are a variant built on a collection of sequences and associate to each k-mer the sequences in which it appears. We present GGCAT, a tool for constructing both types of graphs, based...
  2. ...was unaffected by relaxing the restriction that events be identified on the correct haplotypic background.The other SV detection methods (GRIDSS and Manta), and SNV/small indel caller (HaplotypeCaller) underperformed considerably at DNM detection compared with Corticall and DELLY. Although poor sensitivity...
  3. ...techniques. Here, we present devider, an algorithm for haplotyping small sequences, such as viruses or genes, from long-read sequencing. devider uses a positional de Bruijn graph with sequence-to-graph alignment on an alphabet of informative alleles to provide a fast assembly-inspired approach compatible...
  4. ...Acids Res 45: e162. ↵Cameron DL, Schröder J, Penington JS, Do H, Molania R, Dobrovic A, Speed TP, Papenfuss AT. 2017. GRIDSS: sensitive and specific genomic rearrangement detection using positional de Bruijn graph assembly. Genome Res 27: 2050–2060. ↵Clarke J, Wu HC, Jayasinghe L, Patel A, Reid S...
  5. ...al. 2020). However, variant calling remains challenging for multiallelic VNTR regions as the position of calls varies (Li et al. 2020); an extra processing step is needed to reveal the multiallelic property of a locus.Another commonly used graph model is the de Bruijn graph (dBG). The main...
For checked items

Preprint Server