<?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/39441?offset=410</link>
	<atom:link href="https://bioinformaticsonline.com/related/39441?offset=410" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/29280/nemo-%E2%80%93-a-stochastic-individual-base-genetically-explicit-simulation-platform</guid>
	<pubDate>Sat, 01 Oct 2016 14:45:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29280/nemo-%E2%80%93-a-stochastic-individual-base-genetically-explicit-simulation-platform</link>
	<title><![CDATA[Nemo – A stochastic, individual-base, genetically explicit simulation platform]]></title>
	<description><![CDATA[<ul>
<li>
<p>A&nbsp;<strong>recombination map</strong>&nbsp;has been added for all multi-locus traits. The map positions (chromosomal) for neutral markers (e.g. SNPs) and loci under selection (QTLs, deleterious mutations, DMIs) can now be specified explicitly, or set at random. The map can hold an unlimited number of loci of different types jointly, at any recombination scale (cM or lower). The effects of linkage can thus be finely explored.</p>
</li>
<li>
<p>A new trait coding for (Bateson-)<strong>Dobzhansky-Muller incompatibility loci</strong>. Multiple haploid or diploid pairs of incompatible loci can be spread throughout the genome and affect individual fitness.</p>
</li>
<li>
<p><strong>Multi-type selection</strong>:&nbsp;<a href="http://nemo2.sourceforge.net/classIndividual.html" title="This class contains traits along with other individual information (sex, pedigree, etc. ).">Individual</a>&nbsp;fitness can be jointly determined by different types of loci under selectinon, such as QTLs coding for quantitative traits under spatially variable selection, universally deleterious mutations, and Dobzhansky-Muller incompatibility loci.</p>
</li>
<li>
<p><strong>An unlimited number of quantitative traits</strong>&nbsp;under different forms of selection can be modelled, based on universally pleiotropic loci with several bi- or multi-allelic models.</p>
</li>
<li>
<p><strong>Spatial and temporal variation of selection</strong>&nbsp;on quantitative traits is possible, modelling shifts of environmental conditions over time.</p>
</li>
<li>
<p>The dispersal matrix describing the movement of individuals among sub-populations can be replaced by a connectivity matrix and a reduced dispersal matrix describing migration only among the connected sub-populations. This offers a substantial gain in computing time and system memory when simulating very large grids.</p>
</li>
<li>
<p>Input parameters' arguments may be specified in separate files. This is particularly convenient when specifying large matrices.</p>
</li>
<li>
<p>Many adjustments have been made for refined control of the input of parameters and data output. See updates in the manual.</p>
</li>
</ul><p>Address of the bookmark: <a href="http://nemo2.sourceforge.net/index.html" rel="nofollow">http://nemo2.sourceforge.net/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29574/beagle</guid>
	<pubDate>Thu, 27 Oct 2016 11:19:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29574/beagle</link>
	<title><![CDATA[Beagle]]></title>
	<description><![CDATA[<p>Beagle is a software package that performs genotype calling, genotype phasing, imputation of ungenotyped markers, and identity-by-descent segment detection.</p>
<p>Beagle version 4.1 has a more accurate genotype phasing algorithm and a very fast and accurate genotype imputation algorithm. Version 4.1 also has several changes to the command line arguments which are described in the&nbsp;<a href="http://faculty.washington.edu/browning/beagle/release_notes" target="_blank">release notes</a>. The "ped" argument has no effect in version 4.1. If your data contains nuclear families and you want to model the parent-offspring relationships when phasing genotypes, please use&nbsp;<a href="https://faculty.washington.edu/browning/beagle/b4_0.html">version 4.0</a>.</p>
<p>If you use Beagle 4.1 in a published analysis, please report the program version and cite the appropriate article.</p>
<p>The citation for Beagle's phasing algorithm is:</p>
<p>S R Browning and B L Browning (2007) Rapid and accurate haplotype phasing and missing data inference for whole genome association studies by use of localized haplotype clustering. Am J Hum Genet 81:1084-1097.<a href="http://dx.doi.org/doi:10.1086/521987" target="_blank">doi:10.1086/521987</a></p>
<p>The citation for Beagle's genotype imputation algorithm is:</p>
<p>B L Browning and S R Browning (2016). Genotype imputation with millions of reference samples. Am J Hum Genet 98:116-126.<a href="http://dx.doi.org/doi:10.1016/j.ajhg.2015.11.020" target="_blank">doi:10.1016/j.ajhg.2015.11.020</a></p>
<p>The citation for Beagle's IBD detection algorithm is:</p>
<p>B L Browning and S R Browning (2013). Improving the accuracy and efficiency of identity-by-descent detection in population data. Genetics 194(2):459-71.<a href="http://dx.doi.org/doi:10.1534/genetics.113.150029" target="_blank">doi:10.1534/genetics.113.150029</a></p><p>Address of the bookmark: <a href="http://faculty.washington.edu/browning/beagle/beagle.html" rel="nofollow">http://faculty.washington.edu/browning/beagle/beagle.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29915/professor-all-levels-in-bioinformatics-and-computational-biology</guid>
  <pubDate>Tue, 22 Nov 2016 05:43:38 -0600</pubDate>
  <link></link>
  <title><![CDATA[Professor (all levels) in Bioinformatics and Computational Biology]]></title>
  <description><![CDATA[
<p>King Abdullah University of Science and Technology (KAUST) (kaust.edu.sa) is seeking a highly motivated and skilled faculty member for the Bioinformatics track whose research focuses on development of methods and tools for Bioinformatics and Computational Biology.<br />KAUST is an international, graduate-level research university dedicated to advancing science and technology through interdisciplinary research, education, and innovation. Located on the shores of the Red Sea in Saudi Arabia, KAUST offers superb research facilities, generous assured research funding, and internationally competitive salaries, attracting top international faculty, scientists, engineers, and students to conduct fundamental and goal-oriented research to address the world’s pressing scientific and technological challenges in the areas of food, water, energy, and the environment.<br />The successful applicant is expected to develop world-leading research in domain of bioinformatics/computational biology with focus on development of novel computational approaches for efficient and accurate methods of analyzing biological phenomena at molecular level. The faculty member will be part of the Computational Bioscience Research Center (CBRC) within the Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division. The position will remain open until filled.<br /> <br />Requirements:<br /> <br />PhD or equivalent in a Computer Science, Mathematics or Engineering discipline. Candidates should be well-established within the research field relevant to the position grade. They should demonstrate original research and experience at the highest international level.<br /> <br />Responsibilities and tasks:<br /> <br />Research competence in the following areas is preferred:<br />Analysis of next generation sequencing (NGS) and other ‘omics’ data (e.g. CAGE, ChIP-Seq, DHS, RNA-Seq, Ribo-Seq, proteomic, metabolic and NMR spectra, etc.).<br />Signaling, regulatory and metabolic pathways analysis.<br />Development of tools (web-based and standalone) suited for efficient computational biology/bioinformatics.<br /> <br /> <br />Visit cemse.kaust.edu.sa to apply.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30102/prism</guid>
	<pubDate>Sat, 10 Dec 2016 15:19:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30102/prism</link>
	<title><![CDATA[PRISM]]></title>
	<description><![CDATA[<p><span>PRISM is a software for split read (reads which span across a structrual variant -- SV ) mapping and SV calling from the mapping result. PRISM is able to detect small insertions and abitrary size deletions, inversions and tandom duplications with the direction of discordant read pairs. PRISM_CTX is a tool for detecting inter-chromosome trans-location events.&nbsp;</span><br><br><span>PRISM and PRISM_CTX were originally designed and written by&nbsp;</span><a href="http://www.cs.toronto.edu/~brudno">Michael Brudno</a><span>&nbsp;and Yue Jiang, The original PRISM publication can be found&nbsp;</span><a href="http://bioinformatics.oxfordjournals.org/content/early/2012/07/31/bioinformatics.bts484.abstract">here</a><span>.&nbsp;</span><br><br><span>The authors may be contacted via e-mail at:&nbsp;</span><em>prism at cs.toronto.edu</em><span>.&nbsp;</span><br><br><span>Additional information is available in the&nbsp;</span><a href="http://compbio.cs.toronto.edu/prism/PRISM_README">PRISM README</a><span>&nbsp;file and&nbsp;</span><a href="http://compbio.cs.toronto.edu/prism/PRISM_CTX_README">PRISM_CTX README</a><span>&nbsp;file.&nbsp;</span></p>
<p>http://compbio.cs.toronto.edu/prism/</p><p>Address of the bookmark: <a href="http://compbio.cs.toronto.edu/prism/" rel="nofollow">http://compbio.cs.toronto.edu/prism/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30234/last</guid>
	<pubDate>Mon, 19 Dec 2016 14:07:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30234/last</link>
	<title><![CDATA[LAST]]></title>
	<description><![CDATA[<p>LAST can:</p>
<ul>
<li>Handle&nbsp;<strong>big</strong>&nbsp;sequence data, e.g:
<ul>
<li>Compare two vertebrate genomes</li>
<li>Align billions of DNA reads to a genome</li>
</ul>
</li>
<li>Indicate the&nbsp;<a href="http://lastweb.cbrc.jp/about.html">reliability</a>&nbsp;of each aligned column.</li>
<li>Use sequence quality data&nbsp;<a href="http://nar.oxfordjournals.org/content/38/7/e100.abstract">properly</a>.</li>
<li>Compare DNA to proteins, with frameshifts.</li>
<li>Compare PSSMs to sequences</li>
<li>Calculate the likelihood of chance similarities between random sequences.</li>
<li>Do split and spliced alignment.</li>
<li><a href="http://last.cbrc.jp/doc/last-train.html">Train</a>&nbsp;alignment parameters for unusual kinds of sequence (e.g. nanopore).</li>
</ul><p>Address of the bookmark: <a href="http://last.cbrc.jp/" rel="nofollow">http://last.cbrc.jp/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30555/yaha</guid>
	<pubDate>Fri, 20 Jan 2017 05:38:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30555/yaha</link>
	<title><![CDATA[YAHA]]></title>
	<description><![CDATA[<p>YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints.</p>
<p><strong>Availability:</strong> YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from <a href="http://faculty.virginia.edu/irahall/YAHA" target="pmc_ext">http://faculty.virginia.edu/irahall/YAHA</a>.</p>
<p><strong>Contact:</strong></p>
<p>http://genome.wustl.edu/people/groups/detail/hall-lab/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31014/sockeye</guid>
	<pubDate>Fri, 17 Feb 2017 08:51:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31014/sockeye</link>
	<title><![CDATA[sockeye]]></title>
	<description><![CDATA[<p>This sockeye&nbsp;software uses the Ensembl database project to import sequence and annotation information from several eukaryotic species. A user can additionally import their own custom sequence and annotation data. Individual annotation objects are displayed in Sockeye by using custom 3D models. Ensembl-derived and imported sequences can be analyzed by using a suite of multiple and pair-wise alignment algorithms. The results of these comparative analyses are also displayed in the 3D environment of Sockeye. By using the Java3D API to visualize genomic data in a 3D environment, we are able to compactly display cross-sequence comparisons. This provides the user with a novel platform for visualizing and comparing genomic feature organization.</p><p>Address of the bookmark: <a href="http://www.bcgsc.ca/platform/bioinfo/software/sockeye/releases/1.3" rel="nofollow">http://www.bcgsc.ca/platform/bioinfo/software/sockeye/releases/1.3</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/31566/software-and-tools-to-detect-structure-variation-with-long-reads</guid>
	<pubDate>Wed, 15 Mar 2017 14:31:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/31566/software-and-tools-to-detect-structure-variation-with-long-reads</link>
	<title><![CDATA[Software and Tools to detect structure variation with long reads !!]]></title>
	<description><![CDATA[<p>Uncovering the connection between genetics and heritable diseases requires an approach that looks at all the variant bases and types in a genome. While a PacBio&nbsp;<em>de novo</em>&nbsp;assembly resolves the most novel SV variants. 8-10X PacBio coverage of single genomes or trios reveals triple the SVs detectable by short-read data.</p><p>With&nbsp;<span style="text-decoration: underline;"><a href="http://www.pacb.com/smrt-science/">Single Molecule, Real-Time (SMRT) Sequencing</a></span>, you can access structural variations having a broad range of sizes, types, and GC content with the ability to:</p><ul>
<li>Uncover missing heritability linked to structural variation</li>
<li>Unambiguously identify genomic context and variant breakpoints at the sequence level to unravel the genetic etiology of disease</li>
<li>Resolve structural variation across the complete size spectrum with basepair resolution</li>
</ul><p>Following are the SV tools, which can assist you to achieve your goal.</p><p><strong>Sniffles:</strong>&nbsp;Structural variation caller using third generation sequencing</p><p>Sniffles is a structural variation caller using third generation sequencing (PacBio or Oxford Nanopore). It detects all types of SVs using evidence from split-read alignments, high-mismatch regions, and coverage analysis. Please note the current version of Sniffles requires sorted output from BWA-MEM (use -M and -x parameter) or NGM-LR with the optional SAM attributes enabled!&nbsp;</p><p>More at&nbsp;https://github.com/fritzsedlazeck/Sniffles</p><p><strong style="font-size: 12.8px;"><br />MultiBreak-SV:</strong> It identifies structural variants from next-generation paired end data, third-generation long read data, or data from a combination of sequencing platforms.</p><p>There are two pieces of software in this release: (1) a pre-processor that takes machineformat (.m5) BLASR files, and (2) MultiBreak-SV. For installation and usage instructions, see doc/MultiBreakSV-Manual.txt.</p><p>More at&nbsp;https://github.com/raphael-group/multibreak-sv</p><p><strong style="font-size: 12.8px;"><br />Parliament:</strong>&nbsp;A Structural Variation Tool. Why ask a single sv-detection approach to find every variant when you can have a parliament of tools deciding?</p><p>Publication about the algorithm and &ldquo;&hellip;the first long-read characterization of structural variation in a diploid human personal genome&hellip;&rdquo; (HS1011) -&nbsp;<a href="http://www.biomedcentral.com/1471-2164/16/286">&ldquo;Assessing structural variation in a personal genome&mdash;towards a human reference diploid genome&rdquo;</a></p><p>More at&nbsp;https://sourceforge.net/projects/parliamentsv/</p><p>https://www.dnanexus.com/papers/Parliament_Info_Sheet.pdf</p><p><br /><strong>PBHoney:</strong>&nbsp;the structural variation discovery tool&nbsp;<br /><br />PBHoney is an implementation of two variant-identification approaches designed to exploit the high mappability of long reads (i.e., greater than 10,000 bp). PBHoney considers both intra-read discordance and soft-clipped tails of long reads to identify structural variants.</p><p>Read The Paper&nbsp;<a href="http://www.biomedcentral.com/1471-2105/15/180/abstract" target="_blank">http://www.biomedcentral.com/1471-2105/15/180/abstract</a></p><p>More at&nbsp;https://sourceforge.net/projects/pb-jelly/</p><p><strong><br />SMRT-SV:</strong> Structural variant and indel caller for PacBio reads</p><p>Structural variant (SV) and indel caller for PacBio reads based on methods from&nbsp;<a href="http://www.nature.com/nature/journal/vaop/ncurrent/full/nature13907.html">Chaisson et al. 2014</a>.</p><p>SMRT-SV provides an official software package for tools described in&nbsp;<a href="http://www.nature.com/nature/journal/vaop/ncurrent/full/nature13907.html">Chaisson et al. 2014</a>&nbsp;and adds several key features including the following.</p><ul>
<li>Unified variant calling user interface with built-in cluster compute support</li>
<li>Small indel calling (2-49 bp)</li>
<li>Improved inversion calling (<code>screenInversions</code>)</li>
<li>Quality metric for SV calls based on number of local assemblies supporting each call</li>
<li>Higher sensitivity for SV calls using tiled local assemblies across the entire genome instead of "signature" regions</li>
<li>Genotyping of SVs with Illumina paired-end reads from WGS samples</li>
</ul><p>More at&nbsp;https://github.com/EichlerLab/pacbio_variant_caller</p>]]></description>
	<dc:creator>Archana Malhotra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32420/fastq-format</guid>
	<pubDate>Wed, 03 May 2017 04:23:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32420/fastq-format</link>
	<title><![CDATA[Fastq format]]></title>
	<description><![CDATA[<p><strong>FASTQ format</strong>&nbsp;is a text-based&nbsp;<a href="https://en.wikipedia.org/wiki/File_format" title="File format">format</a>&nbsp;for storing both a biological sequence (usually&nbsp;<a href="https://en.wikipedia.org/wiki/Nucleotide_sequence" title="Nucleotide sequence">nucleotide sequence</a>) and its corresponding quality scores. Both the sequence letter and quality score are each encoded with a single&nbsp;<a href="https://en.wikipedia.org/wiki/ASCII" title="ASCII">ASCII</a>&nbsp;character for brevity.</p>
<p>It was originally developed at the&nbsp;<a href="https://en.wikipedia.org/wiki/Wellcome_Trust_Sanger_Institute" title="Wellcome Trust Sanger Institute">Wellcome Trust Sanger Institute</a>&nbsp;to bundle a&nbsp;<a href="https://en.wikipedia.org/wiki/FASTA_format" title="FASTA format">FASTA</a>&nbsp;sequence and its quality data, but has recently become the&nbsp;<em>de facto</em>&nbsp;standard for storing the output of high-throughput sequencing instruments such as the&nbsp;<a href="https://en.wikipedia.org/wiki/Illumina_(company)" title="Illumina (company)">Illumina</a>&nbsp;Genome Analyzer.<sup id="cite_ref-Cock2009_1-0"><a href="https://en.wikipedia.org/wiki/FASTQ_format#cite_note-Cock2009-1">[1]</a></sup></p><p>Address of the bookmark: <a href="https://en.wikipedia.org/wiki/FASTQ_format" rel="nofollow">https://en.wikipedia.org/wiki/FASTQ_format</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>