github.com - new de novo assembler called BASE. It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE...
github.com - chromeister: An ultra fast, heuristic approach to detect conserved signals in extremely large pairwise genome comparisons.
USAGE:
-query: sequence A in fasta format
-db: sequence B in fasta format
-out: output matrix
-kmer Integer: k>1...
PIT Bioinformatics Group solves problems in bioinformatics and computational biology. Recent developed online tools:
- Budapest Reference Connectome: View a parametrizable connectome (brain graph).
- AmphoraNet: The webserver implementation of...
github.com - SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes...
github.com - SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes...
ab.inf.uni-tuebingen.de - Our software can be used to generate collections of synthetic reads that reflect the diverse taxonomical composition of typical metagenome data sets. Based on a database of given genomes, the program allows the user to design a...
Question at http://rosalind.info/problems/1b/
#Find the reverse complement of a DNA string.#Given: A DNA string Pattern.#Return: Pattern, the reverse complement of Pattern.use strict;use warnings;my $string="AAAACCCGGT";my $finalString="";my %hash...
code.google.com - You are requested to please bookmark collection of bioinformatics tools, scripts, codes that can be pieced together in a very easy and flexible manner to perform both simple and complex bioinformatics tasks.
The next-generation sequencing included...
github.com - URMAP, a new read mapping algorithm. URMAP is an order of magnitude faster than BWA with comparable accuracy on several validation tests. On a Genome in a Bottle (GIAB) variant calling test with 30× coverage 2×150 reads, URMAP achieves...