Search Results for "mers"

UniversalMer is a k-mer counting tool for multiple size of k at once. It is available for DNA, RNA, and protein sequences. The program counts and summarizes the exact frequency of all k-mers from 1-mer to a user-defined maximum length (kmax). Analyzing the k-mer spectrum across multiple values of k can be done in seconds. This program is designed for bioinformatics researchers and scientists.

KAnalyze is a Java toolkit designed to convert DNA and RNA sequences into k-mers. It is both a command line application and an API.

TAG is a tool for metatranscriptome assembly using de Bruijn graph of matched metagenome as the reference. TAG is an application of a reads mapping algorithm that we developed for mapping of short reads onto a de Bruijn graph of assemblies. A hash table of junction k-mers (k-mers spanning branching structures in the de Bruijn graph) is used to facilitate fast mapping of reads to the graph. We have shown that TAG helps to assemble substantially more transcripts from metatranscriptomic datasets that otherwise would have been missed or truncated because of the fragmented nature of the reference metagenome. ...

Trowel is an error correction module for Illumina sequencing reads, which is based on the k-mer spectrum approach. This tool is the first tool that uses a quality threshold instead of a coverage cutoff in order to extract trusted k-mers. This tool guarantees high accuracy and speed. This tool has been developed since 21. Jan. 2013 by Euncheon Lim in Prof. Dr. Detlef Weigel's Lab in Max-Planck Institute for Developmental Biology. First of all, you have to install the exact version of boost(>=1.53.0), google sparse hash(>=2.0.2), GCC(>=4.6), autoconf(=2.69), and automake(=1.13).

Ferox is a DNA sequence alignment application that uses fuzzy k-mers to quickly and accurately align sets of sequence reads against a reference genome. Ferox can also be used to align whole genomes. The seeding mechanism used by Ferox is highly configurable, allowing custom fuzzy seeds to be created declaratively in an XML configuration file.

A general purpose distributed hash table adapted for sequence analysis. This program searches for all maximal, exact unique n-mers from a given set of genomes. Originally, this program's primary use was to design resequencing microarrays.

This tool is designed to solve generalized pattern matching problem, by which we only find a set of sub-patterns, ignoring the gaps in between the sub-patterns. This tool is extremely fast and also has good tolerance to errors.