Searching journal content for articles similar to Cracco and Tomescu 33 (7): 1198.

Displaying results 1-10 of 5598
For checked items
  1. ...and querying of compacted and colored de Bruijn graphs with GGCAT. Genome Res 33: 1198–1207. doi:10.1101/gr.277615.122 ↵Croucher NJ, Walker D, Romero P, Lennard N, Paterson GK, Bason NC, Mitchell AM, Quail MA, Andrew PW, Parkhill J, et al. 2009. Role of conjugative elements in the evolution of the multidrug...
  2. ...to the particular advantages of variation graphs in the analysis of metas. The implementation of PanTax is fundamentally enabled by the topology of variation graphs. As a specific form of graph, variation graphs collapse homologous regions and represent them as alternative paths within the graph. When constructed...
  3. ...). Counting de Bruijn graphs index k-mer abundances from 2652 human RNA-seq samples in over eightfold smaller representations compared with state-of-the-art bioinformatics tools and is faster to construct and query. Furthermore, counting de Bruijn graphs with positional annotations losslessly represent entire...
  4. ....MethodsThe original Verkko pipeline consisted of six main steps, with module dependencies given in parentheses: homopolymer compression and correction of LA reads (HiCanu) (Nurk et al. 2020), LA multiplex De Bruijn graph construction (MBG) (Rautiainen and Marschall 2021), alignment of UL reads to the LA graph (Graph...
  5. ...all pairs of individuals across the can be utilized to construct graphs of genetic similarity, in which individuals are represented as nodes, and shared IBD haplotypes are represented as edges (Belbin et al. 2021). Previous studies have shown the advantages of utilizing IBD data to represent recent...
  6. ...component gadgets, we define our vector gadgets: The query sequence is defined as . For 1 ≤ i ≤ n, we construct haplotype sequence Hi from vector ai: To create the vertices of graph G, we start with the following: a vertex denoted vleft with label 0nd; 2d vertices denoted vx,0, vx,1 for 1 ≤ x ≤ d, where...
  7. ...at the per-base level. As an improvement, Minigraph-Cactus was proposed as an extended solution that combines the compactness and efficiency of Minigraph as well as the base-level sensitivity and accuracy of Cactus. Pan graphs constructed by Minigraph-Cactus can effectively represent both small and large...
  8. ...of finding accurate alignments. Methods that use de Bruijn graphs (DBGs) as a graph model (Bowe et al. 2012) or use an auxiliary index (Sirén 2017) are restricted to finding seeds of minimum length k. To find seeds when the query has a high edit distance relative to the reference sequences, sequence-to-graph...
  9. ...these signatures. They confirmed some fusions and reported some novel ones. Fusion transcripts provide interesting targets for cancer immunotherapies because they are prone to exhibit tumor-specific markers.One of the data structures covered in this survey, the colored de Bruijn graph, has also been used for rapid...
  10. ..., RDG-Viewer (available at https://colab.research.google.com/drive/1f5iSgy5DAXeq27Lx1fCyngm4IjinkgC5?usp=sharing). This Google Collaboratory notebook uses graph construction functionality from the RDG Python package (https://pypi.org/project/RDG/), which is currently under development (https...
For checked items

Preprint Server