<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/28884?offset=280</link>
	<atom:link href="https://bioinformaticsonline.com/related/28884?offset=280" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</guid>
	<pubDate>Thu, 28 Apr 2016 11:16:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27104/gatb-genome-analysis-toolbox-with-de-bruijn-graph</link>
	<title><![CDATA[GATB : Genome Analysis Toolbox with de-Bruijn graph]]></title>
	<description><![CDATA[<p>The&nbsp;<strong><strong>Genome Analysis Toolbox with de-Bruijn graph</strong> (GATB)</strong> provides a set of <a href="https://gatb.inria.fr/gatb-global-architecture/">highly efficient algorithms to analyse NGS data sets</a>. These methods enable the analysis of data sets of any size on multi-core desktop computers, including very huge amount of reads data coming from any kind of organisms such as bacteria, plants, animals and even complex samples (<em>e.g.</em> metagenomes).</p>
<p>More at https://gatb.inria.fr/</p><p>Address of the bookmark: <a href="https://gatb.inria.fr/" rel="nofollow">https://gatb.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27333/satsuma-highly-sensitive-whole-genome-synteny-alignments</guid>
	<pubDate>Fri, 13 May 2016 05:25:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27333/satsuma-highly-sensitive-whole-genome-synteny-alignments</link>
	<title><![CDATA[SATSUMA : Highly sensitive whole-genome synteny alignments.]]></title>
	<description><![CDATA[<p>Satsuma is a whole-genome synteny alignment program. It takes two genomes, computes alignments, and then keeps only the parts that are orthologous, i.e. following the conserved order and orientation of features, such as protein coding genes, non-coding genes, or neutral sequences. Satsuma does not require any pre-processing, such as repeat masking, since it will automatically detect ambiguous mappings.<br> <br> Satsuma has parallelization built-in and is designed to run on multi-core architectures. The run-time for aligning two bird-size genomes (~1.2 Gb) is around two days on 24 CPUs. <br> <br> You can find the manual <a href="http://satsuma.sourceforge.net/manual.html">here</a>.<br> Download the latest source code from <a href="https://sourceforge.net/projects/satsuma/">here.</a><br> Stable versions can also be downloaded from the <a href="https://www.broadinstitute.org/science/programs/genome-biology/spines">Broad Institute's</a> web site.<br> <br> An incomplete list of questions and answers (yes, these have really been asked by our users! Please feel free to add your own by e-mailing us) is <a href="http://satsuma.sourceforge.net/faq.html">here</a>.<br> <br> If you use Satsuma in your research, please cite:<br> <a href="http://bioinformatics.oxfordjournals.org/content/26/9/1145.long">Grabherr, M. G., Russell, P., Meyer, M., Mauceli, E., Alf&ouml;ldi, J., Di Palma, F., &amp; Lindblad-Toh, K. (2010). Genome-wide synteny through highly sensitive sequence alignment: Satsuma. Bioinformatics, 26(9), 1145-51</a>.</p>
<p><strong>Tutorial at http://evomics.org/learning/genomics/satsuma/</strong></p><p>Address of the bookmark: <a href="http://satsuma.sourceforge.net/" rel="nofollow">http://satsuma.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27440/stampy</guid>
	<pubDate>Fri, 20 May 2016 19:13:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27440/stampy</link>
	<title><![CDATA[Stampy]]></title>
	<description><![CDATA[<p><strong>Stampy&nbsp;</strong><span>is a package for the mapping of short reads from illumina sequencing machines onto a reference genome. It's recommended for most workflows, including those for genomic resequencing, RNA-Seq and Chip-seq. Stampy excels in the mapping of reads containing that contain sequence variation relative to the reference, in particular for those containing insertions or deletions.</span></p><p>Address of the bookmark: <a href="http://www.well.ox.ac.uk/project-stampy" rel="nofollow">http://www.well.ox.ac.uk/project-stampy</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/28112/ngs-glossary</guid>
	<pubDate>Mon, 27 Jun 2016 08:56:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/28112/ngs-glossary</link>
	<title><![CDATA[NGS Glossary !!]]></title>
	<description><![CDATA[<p><strong>alignment</strong>: the mapping of a raw sequence read to a location within a reference genome. The mapping occurs because the sequences within the raw read match or align to sequences within the reference genome. Alignment information is stored in the <strong>SAM</strong> or <strong>BAM</strong> file formats.</p><p><strong>bcftools</strong>: a set of companion tools, currently bundled with SAMtools, for identifying and filtering genomics variants.</p><p><strong>bowtie</strong>: widely used, open source alignment software for aligning raw sequence reads to a reference genome.</p><p><strong>BAM Format</strong>: binary, compressed format for storing <strong>SAM</strong> data.</p><p><strong>BCF Format</strong>: Binary call format. Binary, compressed format for storing <strong>VCF</strong> data.</p><p><strong>CIGAR String</strong>: Compact Idiosyncratic Gapped Alignment Report. A compact string that (partially) summarizes the alignment of a raw sequence read to the reference genome. Three core abbreviations are used: M for alignment match; I for insertion; and D for Deletion. For example, a CIGAR string of 5M2I63M indicates that the first 5 base pairs of the read align to the reference, followed by 2 base pairs, which are unique to the read, and not in the reference genome, followed by an additional 63 base pairs of alignment.</p><p><strong>FASTA Format</strong>: text format for storing raw sequence data. For example, the FASTA file at: <a href="http://www.ncbi.nlm.nih.gov/nuccore/NC_008253">http://www.ncbi.nlm.nih.gov/nuccore/NC_008253</a> contains entire genome for Escherichia coli 536.</p><p><strong>FASTQ Format</strong>: text format for storing raw sequence data along with quality scores for each base; usually generated by sequencing machines.</p><p><strong>genotype likelihood</strong>: the probability that a specific genotype is present in the sample of interest. Genotype likelihoods are usually expressed as a <strong>Phred-scaled probability</strong>, where P = 10 ^ (-Q/10). For example, if the genotype TT (both alleles are T) at position 1,299,132 in human chromosome 12 (reference G) is 37, this translates to a probability of 10<sup>-37/10</sup> = 0.0001995, meaning that there is very low probability that the reads in your sample support a TT genotype. On the other hand, a genotype of AA at the same position with a score of 0 translates into a probability of 10<sup>-0</sup> = 1, indicating extremely high probability that your sample contains a homozygous mutation of G to A.</p><p><strong>mate-pair</strong>: in paired-end sequencing, both ends of a single DNA or RNA fragment are sequenced, but the intermediate region is not. The two ends which are sequenced form a pair, and are frequently referred to as mate-pairs.</p><p><strong>QNAME</strong>: unique identifier of a raw sequence read (also known as the Query Name). Used in <strong>FASTQ</strong> and <strong>SAM</strong> files.</p><p><strong>paired-end sequencing</strong>: sequencing process where both ends of a single DNA or RNA fragment are sequenced, but the intermediate region is not. Particularly useful for identifying structural rearrangements, including gene fusions.</p><p><strong>Phred-scaled probability</strong>: a scaled value (Q) used to compactly summarize a probability, where P = 10<sup>-Q/10</sup>. For example, a Phred Q score of 10 translates to probability (P) = 10<sup>-10/10</sup> = 0.1. Phred-scaled probabilities are common in next-generation sequencing, and are used to represent multiple types of quality metrics, including quality of base calls, quality of mappings, and probabilities associated with specific genotypes. The name Phred refers to the original Phred base-calling software, which first used and developed the scale.</p><p><strong>Phred quality score</strong>: a score assigned to each base within a sequence, quantifying the probability that the base was called incorrectly. Scores use a <strong>Phred-scaled probability</strong> metric. For example, a Phred Q score of 10 translates to P=10<sup>-10/10</sup> = 0.1, indicating that the base has a 0.1 probability of being incorrect. Higher Phred score correspond to higher accuracy. In the <strong>FASTQ format</strong>, Phred scores are represented as single ASCII letters. For details on translating between Phred scores and ASCII values, refer to <a href="http://www.somewhereville.com/?p=1508">Table 1 of this useful blog post from Damian Gregory Allis</a>.</p><p><strong>read-length</strong>: the number of base pairs that are sequenced in an individual sequence read.</p><p><strong>read-depth</strong>: the number of sequence reads that pile up at the same genomic location. For example, 30X read-depth coverage indicates that the genomic location is covered by 30 independent sequencing reads. Increased read-depth translates into higher confidence for calling genomic variants.</p><p><strong>RNAME</strong>: reference genome identifier (also known as the Reference Name). Within a SAM formatted file, the RNAME identifies the reference genome where the raw read aligns.</p><p><strong>SAM Flag</strong>: a single integer value (e.g. 16), which encodes multiple elements of meta-data regarding a read and its alignment. Elements include: whether the read is one part of a paired-end read, whether the read aligns to the genome, and whether the read aligns to the forward or reverse strand of the genome. A <a href="http://picard.sourceforge.net/explain-flags.html">useful online utility</a> decodes a single SAM flag value into plain English.</p><p><strong>SAM Format</strong>: Text file format for storing sequence alignments against a reference genome. See also <strong>BAM</strong> Format.</p><p><strong>SAMtools</strong>: widely used, open source command line tool for manipulating SAM/BAM files. Includes options for converting, sorting, indexing and viewing SAM/BAM files. The SAMtools distribution also includes bcftools, a set of command line tools for identifying and filtering genomics variants. Created by <a href="http://lh3lh3.users.sourceforge.net/">Heng Li</a>, currently of the Broad Institute.</p><p><strong>single-read sequencing</strong>: sequencing process where only one end of a DNA or RNA fragment is sequenced. Contrast with <strong>paired-end</strong> sequencing.</p><p><strong>VCF Format</strong>: Variant call format. Text file format for storing genomic variants, including single nucleotide polymorphisms, insertions, deletions and structural rearrangements. See also <strong>BCF</strong> format.</p><p><strong>Next</strong><strong>Generation</strong><strong>Sequencing</strong><br /> A high-throughput sequencing method which parallelizes the sequencing process, producing thousands or millions of sequences at once.</p><p><strong>Deep</strong><strong>Sequencing</strong><br /> Techniques of nucleotide sequence analysis that increase the range, complexity, sensitivity, and accuracy of results by greatly increasing the scale of operations and thus the number of nucleotides, and the number of copies of each nucleotide sequenced.</p><p><strong>Paired-End</strong><strong>Sequencing</strong><br /> Sequence both ends of the same fragment and keep track of the paired data.</p><p><strong>Adapter</strong><br /> Short oligonucleotides which are attached to the DNA to be sequenced. An adapter can provide a priming site for both amplification and sequencing of the adjoining, unknown nucleic acid.</p><p><strong>Library</strong><br /> A collection of DNA fragments with adapters ligated to each end.</p><p><strong>Bridge</strong><strong>Amplification</strong><br /> Generation of in situ copies of a specific DNA molecule on an oligo-decorated solid support.</p><p><strong>Emulsion</strong><strong>PCR</strong><br /> A method for bead-based amplification of a library. A single adapter-bound fragment is attached to the surface of a bead, and an oil emulsion containing necessary amplification reagents is formed around the bead/fragment component. Parallel amplification of millions of beads with millions of single strand fragments produces a sequencer-ready library.</p><p><strong>Alignment</strong><br /> Mapping of sequence reads to a known reference sequence</p><p><strong>Reference</strong><strong>sequence</strong><strong>/</strong><strong>genome</strong><strong>&nbsp; </strong><br /> A fully assembled version of a genome that can be used for mapping short DNA sequence reads for comparisons of genomes from various individuals</p><p><strong>Coverage</strong><strong>Depth</strong><br /> The number of nucleotides from reads that are mapped to a given position of reference genome.</p><p><strong>Specificity</strong><strong>&nbsp; </strong><br /> The percentage of sequences that map to the intended targets out of total bases per run.</p><p><strong>Uniformity</strong><strong>&nbsp; </strong><br /> The variability in sequence coverage across target regions.</p><p><strong>Homopolymer</strong><br /> Uninterrupted stretch of a single nucleotide type (e.g., TTT or GGGGGG)</p><p><strong>InDel</strong><br /> InDel stands for Insertion or deletion. A form of structural variation in which a DNA segment is either deleted or inserted.</p><p><strong>SNP</strong><strong>&nbsp; </strong></p><p>SNP stands for Single Nucleotide Polymorphism. A single base difference found when comparing the same DNA sequence from two different individuals.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31278/metapred2cs</guid>
	<pubDate>Fri, 03 Mar 2017 05:15:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31278/metapred2cs</link>
	<title><![CDATA[MetaPred2CS]]></title>
	<description><![CDATA[<p style="text-align: justify;"><strong>MetaPred2CS Web server&nbsp;</strong>is a meta-predictor based on&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/17160063">Support Vector Machine (SVM)</a>&nbsp;that combines 6 individual sequence based protein-protein interaction prediction methods to predict&nbsp;<strong>prokaryotic two-component system&nbsp;</strong>protein-protein interactions (PPIs). The methods implemented in MetaPred2CS are 2 co-evolutionary methods:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/11933068">in-silico two hybrid (i2h)</a>&nbsp;and&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/11707606">mirror tree (MT)</a>&nbsp;methods and 4 genomics context based methods:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/15947018">phylogenetic profiling (PP)</a>,&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/10573422">gene fusion (GF)</a>,&nbsp;<a href="http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.0030043">gene neighbourhood (GN)</a>&nbsp;and and&nbsp;<a href="http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.0030043">gene operon methods (GO)</a>.</p>
<p>&nbsp;http://metapred2cs.ibers.aber.ac.uk/</p><p>Address of the bookmark: <a href="https://github.com/martinjvickers/MetaPred2CS" rel="nofollow">https://github.com/martinjvickers/MetaPred2CS</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29274/strudel</guid>
	<pubDate>Fri, 30 Sep 2016 09:47:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29274/strudel</link>
	<title><![CDATA[Strudel]]></title>
	<description><![CDATA[<p>Strudel is our graphical tool for visualizing genetic and physical maps of genomes for comparative purposes. The application aims to let the user examine their data at a variety of different levels of resolution, from entire maps to individual markers, and explore syntenic relationships between genomes. All browsing and interaction with Strudel happens in real-time &ndash; there is no need to wait while the maps are generated. It is built using Java 1.6 and ships with its own JRE, so there is no need for users to install or update Java.</p><p>Address of the bookmark: <a href="https://ics.hutton.ac.uk/strudel/" rel="nofollow">https://ics.hutton.ac.uk/strudel/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30012/swalo</guid>
	<pubDate>Wed, 30 Nov 2016 05:06:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30012/swalo</link>
	<title><![CDATA[SWALO]]></title>
	<description><![CDATA[<p>SWALO (scaffolding with assembly likelihood optimization) is a method for scaffolding based on likelihood of genome assemblies computed using generative models for sequencing.</p>
<p><a href="https://atifrahman.github.io/SWALO/swalo-0.9.7-beta.tar.gz"><strong>Download</strong></a></p>
<p><strong>Git repository of SWALO is at <a href="https://github.com/atifrahman/SWALO">https://github.com/atifrahman/SWALO</a>.</strong></p><p>Address of the bookmark: <a href="https://atifrahman.github.io/SWALO/" rel="nofollow">https://atifrahman.github.io/SWALO/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29658/bookmarks-biostatistics-materials-and-books</guid>
	<pubDate>Tue, 08 Nov 2016 07:42:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29658/bookmarks-biostatistics-materials-and-books</link>
	<title><![CDATA[Bookmarks Biostatistics materials and books]]></title>
	<description><![CDATA[<p>Biostatistics did not spring fully formed from the brow of R. A. Fisher, but evolved over many years. This process is continuing, although it may not be obvious from the outside. It has been ten years since the first edition of this book appeared (and rather longer since it was begun). Over this time, new areas of biostatistics have been developed and emphases and interpretations have changed</p>
<p>Please bookmarks your favourate biostatistics&nbsp;books in commend sectons ...</p><p>Address of the bookmark: <a href="http://www.cos.ufrj.br/~bioestatistica/livros/Introduction%20to%20Biostatistics.pdf" rel="nofollow">http://www.cos.ufrj.br/~bioestatistica/livros/Introduction%20to%20Biostatistics.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</guid>
	<pubDate>Sun, 02 Apr 2017 14:31:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</link>
	<title><![CDATA[Fools guide]]></title>
	<description><![CDATA[<p><span>This website and accompaning documents are intended as a tool to help researchers dealing with non-model organisms acquire and process transcriptomic high-throughput sequencing data without having to learn extensive bioinformatics skills. It covers all steps from tissue collection, sample preparation and computer setup, through addressing biological questions with gene expression and SNP data.</span></p>
<p>http://sfg.stanford.edu/denovo.html</p>
<p>http://sfg.stanford.edu/sequencing.html</p>
<p>http://sfg.stanford.edu/BLAST.html</p>
<p>http://sfg.stanford.edu/denovo.html&nbsp;</p><p>Address of the bookmark: <a href="http://sfg.stanford.edu/guide.html" rel="nofollow">http://sfg.stanford.edu/guide.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32399/mapping-ngs</guid>
	<pubDate>Tue, 02 May 2017 07:58:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32399/mapping-ngs</link>
	<title><![CDATA[Mapping NGS]]></title>
	<description><![CDATA[<p>NGS data are just a bunch of sequences, you have no idea which region in the genome each sequences comes from, which gene it represents...<br>To know that you have to align the sequences to the reference sequence. The reference sequence is in most cases the full genome sequence but sometimes, a library of EST sequences is used.<br>In either way, aligning your sequence reads to the reference sequence is called mapping.</p>
<p>The most used mappers of DNA-seq data are&nbsp;<a href="http://bio-bwa.sourceforge.net/" target="_blank">BWA</a>&nbsp;and&nbsp;<a href="http://bowtie-bio.sourceforge.net/bowtie2/index.shtml" target="_blank">Bowtie</a>&nbsp;for DNA-Seq data and&nbsp;<a href="http://tophat.cbcb.umd.edu/" target="_blank">Tophat</a>,&nbsp;<a href="https://github.com/alexdobin/STAR" target="_blank">STAR</a>&nbsp;or&nbsp;<a href="http://www.ccb.jhu.edu/software/hisat/index.shtml" target="_blank">HISAT</a>&nbsp;for RNA-Seq data. Mappers differ in which options they can take in, how fast and how accurate they are. Bowtie is faster than BWA, but looses some sensitivity (does not map an equal amount of reads to the correct position in the genome).</p><p>Address of the bookmark: <a href="http://wiki.bits.vib.be/index.php/Mapping_of_NGS_data" rel="nofollow">http://wiki.bits.vib.be/index.php/Mapping_of_NGS_data</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>