Searching journal content for articles similar to Kuronen et al. 34 (7): 1081.

Displaying results 1-10 of 1859
For checked items
  1. ...Verkko2 integrates proximity-ligation data with long-read De Bruijn graphs for efficient telomere-to-telomere assembly, phasing, and scaffolding Dmitry Antipov1,4, Mikko Rautiainen2,4, Sergey Nurk3, Brian P. Walenz1, Steven J. Solar1, Adam M. Phillippy1 and Sergey Koren1 1Genome Informatics Section...
  2. ...for interactive analysis at scale requires efficient approaches for its storage and indexing. There have recently been remarkable advances in building compressed representations of annotated (or colored) de Bruijn graphs for efficiently indexing k-mer sets. However, approaches for representing quantitative...
  3. ...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...
  4. ...Haplotype-aware sequence alignment to pan graphs Ghanshyam Chandra1, Daniel Gibney2 and Chirag Jain1 1Department of Computational and Data Sciences, Indian Institute of Science, Bangalore Karnataka 560012, India; 2Department of Computer Science, The University of Texas at Dallas, Richardson, Texas...
  5. ...Strain-level metagenomic profiling using pan graphs with PanTax Wenhai Zhang1,2,5, Yuansheng Liu3,5, Guangyi Li2,5, Jialu Xu2, Enlian Chen2, Alexander Schönhuth4 and Xiao Luo1,2 1Hunan Research Center of the Basic Discipline for Cell Signaling, Hunan University, Changsha, Hunan 410082, China; 2...
  6. ...that arise from recent demographic events, patterns that are crucial for understanding rare variant effects. To address this challenge, we propose a novel method called spectral components (SPCs), which leverages identity-by-descent (IBD) graphs to capture and transform local, nonlinear fine-scale population...
  7. ...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...
  8. ...High resolution s of multiple Xiphophorus species provide new insights into microevolution, hybrid incompatibility, and epistasis Yuan Lu1,9, Edward Rice2,9, Kang Du1, Susanne Kneitz3, Magali Naville4, Corentin Dechaud4, Jean-Nicolas Volff4, Mikki Boswell1, William Boswell1, LaDeana Hillier5, Chad...
  9. ...Interactive visualization and interpretation of pan graphs by linear reference–based coordinate projection and annotation integration Zepu Miao and Jia-Xing Yue State Key Laboratory of Oncology in South China, Guangdong Key Laboratory of Nasopharyngeal Carcinoma Diagnosis and Therapy, Guangdong...
  10. ...graph are different from those of a doubled de Bruijn graph and, contrary to our expectations, result in underassembly. Using experimental simulations, we then confirm that these two artifacts exist not only in theory but also in the output of widely used assemblers. In particular, when coverage is low...
For checked items

Preprint Server