Velvet

swMATH17026MaRDI QIDQ28887FDOQ28887

Author name not available (Why is that?)

Cited In (25)

• Disentangled Long-Read De Bruijn Graphs via Optical Maps
• Estimating sequence similarity from read sets for clustering next-generation sequencing data
• MULKSG: \textit{MUL}tiple \textit{K} \textit{S}imultaneous \textit{G}raph assembly
• Title not available (Why is that?)
• Fast approximation of frequent \(k\)-mers and applications to metagenomics
• A tale of optimizing the space taken by de Bruijn graphs
• Approximate all-pairs suffix/prefix overlaps
• The Contig Assembly Problem and Its Algorithmic Solutions
• Describing the local structure of sequence graphs
• CUSHAW Suite: Parallel and Efficient Algorithms for NGS Read Alignment
• Safe and Complete Contig Assembly Via Omnitigs
• Next generation sequencing under de novo genome assembly
• DNA sequence assembly involving an acyclic graph model
• Graph algorithms for DNA sequencing -- origins, current models and the future
• Analysis method and algorithm design of biological sequence problem based on generalized k-mer vector
• Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds
• Popping Superbubbles and Discovering Clumps: Recent Developments in Biological Sequence Analysis
• The exact multiple pattern matching problem solved by a reference tree approach
• On bubble generators in directed graphs
• Linear-time superbubble identification algorithm for genome assembly
• The complexity of approximate pattern matching on de Bruijn graphs
• Bioinformatics. Volume I. Data, sequence analysis, and evolution
• Bioinformatics for High Throughput Sequencing
• Coverage theories for metagenomic DNA sequencing based on a generalization of Stevens' theorem
• DNA paired fragment assembly using graph theory

This page was built for software: Velvet