Velvet

swMATH17026MaRDI QIDQ28887FDOQ28887

Author name not available (Why is that?)

Cited In (25)

• 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
• Safe and complete contig assembly via omnitigs
• 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
• Describing the local structure of sequence graphs
• Popping superbubbles and discovering clumps: recent developments in biological sequence analysis
• Next generation sequencing under de novo genome assembly
• DNA sequence assembly involving an acyclic graph model
• Disentangled long-read de Bruijn graphs via optical maps
• 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
• The exact multiple pattern matching problem solved by a reference tree approach
• Bioinformatics for high throughput sequencing
• 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
• Coverage theories for metagenomic DNA sequencing based on a generalization of Stevens' theorem
• The contig assembly problem and its algorithmic solutions
• DNA paired fragment assembly using graph theory
• CUSHAW suite: parallel and efficient algorithms for NGS read alignment

This page was built for software: Velvet