Velvet
From MaRDI portal
Software:28887
No author found.
Related Items (25)
Describing the local structure of sequence graphs ⋮ Next generation sequencing under de novo genome assembly ⋮ Bioinformatics for High Throughput Sequencing ⋮ DNA paired fragment assembly using graph theory ⋮ The complexity of approximate pattern matching on de Bruijn graphs ⋮ Coverage theories for metagenomic DNA sequencing based on a generalization of Stevens' theorem ⋮ Graph algorithms for DNA sequencing -- origins, current models and the future ⋮ Fast approximation of frequent \(k\)-mers and applications to metagenomics ⋮ Linear-time superbubble identification algorithm for genome assembly ⋮ Approximate all-pairs suffix/prefix overlaps ⋮ DNA sequence assembly involving an acyclic graph model ⋮ Estimating sequence similarity from read sets for clustering next-generation sequencing data ⋮ CUSHAW Suite: Parallel and Efficient Algorithms for NGS Read Alignment ⋮ The Contig Assembly Problem and Its Algorithmic Solutions ⋮ Bioinformatics. Volume I. Data, sequence analysis, and evolution ⋮ On bubble generators in directed graphs ⋮ 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 ⋮ Safe and Complete Contig Assembly Via Omnitigs ⋮ MULKSG: \textit{MUL}tiple \textit{K} \textit{S}imultaneous \textit{G}raph assembly ⋮ Disentangled Long-Read De Bruijn Graphs via Optical Maps ⋮ Unnamed Item ⋮ A tale of optimizing the space taken by de Bruijn graphs
This page was built for software: Velvet
