<?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/28269?offset=220</link>
	<atom:link href="https://bioinformaticsonline.com/related/28269?offset=220" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</guid>
	<pubDate>Fri, 20 May 2016 18:53:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</link>
	<title><![CDATA[MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping]]></title>
	<description><![CDATA[<p><span>MOSAIK is a stable, sensitive and open-source program for mapping second and third-generation sequencing reads to a reference genome. Uniquely among current mapping tools, MOSAIK can align reads generated by all the major sequencing technologies, including Illumina, Applied Biosystems SOLiD, Roche 454, Ion Torrent and Pacific BioSciences SMRT. Indeed, MOSAIK was the only aligner to provide consistent mappings for all the generated data (sequencing technologies, low-coverage and exome) in the 1000 Genomes Project. To provide highly accurate alignments, MOSAIK employs a hash clustering strategy coupled with the Smith-Waterman algorithm. This method is well-suited to capture mismatches as well as short insertions and deletions. To support the growing interest in larger structural variant (SV) discovery, MOSAIK provides explicit support for handling known-sequence SVs, e.g. mobile element insertions (MEIs) as well as generating outputs tailored to aid in SV discovery.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27685/biodbnet</guid>
	<pubDate>Thu, 02 Jun 2016 11:11:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27685/biodbnet</link>
	<title><![CDATA[BioDBnet]]></title>
	<description><![CDATA[<p><span>Database to Database Conversions</span> </p>
<p>db2db allows for conversions of identifiers from one database to other database identifiers or annotations. To use db2db select the input type of your data, changing the input type automatically changes the output options to the ones specific for the input selected. Then select one or more output types and add your identifiers in the ID list box. Set the remove duplicate values to 'No' if you do not want duplicates to be removed. Clicking on submit then returns a table of your inputs matched against all the outputs selected in the exact order as entered. Results can be limited to a particular taxon by entering it's <a href="https://biodbnet-abcc.ncifcrf.gov/tools/orgTaxon.php">Taxon ID</a>. The performance will vary widely depending on the number of outputs and the options selected. Conversions to a single output with the default options should complete in a few seconds</p><p>Address of the bookmark: <a href="https://biodbnet-abcc.ncifcrf.gov/db/db2db.php" rel="nofollow">https://biodbnet-abcc.ncifcrf.gov/db/db2db.php</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</guid>
	<pubDate>Tue, 14 Jun 2016 06:18:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27818/gaemr</link>
	<title><![CDATA[GAEMR]]></title>
	<description><![CDATA[<p>The&nbsp;<span>G</span>enome&nbsp;<span>A</span>ssembly&nbsp;<span>E</span>valuation&nbsp;<span>M</span>etrics and&nbsp;<span>R</span>eporting (GAEMR) package is an assembly analysis framework composed a number of integrated modules. These modules can be executed as a single program to generate a complete analysis report, or executed individually to generate specific charts and tables. GAEMR standardizes input by converting a variety of read types to Binary Alignment Map (BAM) format, allowing a single input format to be entered into GAEMR&rsquo;s analysis pipeline, hence enabling the generation of standard reports.</p>
<p>GAEMR&rsquo;s analysis philosophy is centered on contiguity, correctness, and completeness -- how many pieces in an assembly composed of, how well those pieces accurately represent the genome sequenced, and how much of that genome is represented by those pieces. By performing over twenty different analyses based on these principles, GAEMR gives a clear picture of the condition of a genome assembly.&nbsp;</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/software/gaemr/" rel="nofollow">https://www.broadinstitute.org/software/gaemr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28168/sam-flags</guid>
	<pubDate>Wed, 29 Jun 2016 15:38:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28168/sam-flags</link>
	<title><![CDATA[SAM flags]]></title>
	<description><![CDATA[<p>Decoding SAM flags</p>
<p>This utility makes it easy to identify what are the properties of a read based on its SAM flag value, or conversely, to find what the SAM Flag value would be for a given combination of properties.</p>
<p>To decode a given SAM flag value, just enter the number in the field below. The encoded properties will be listed under Summary below, to the right.</p><p>Address of the bookmark: <a href="https://broadinstitute.github.io/picard/explain-flags.html" rel="nofollow">https://broadinstitute.github.io/picard/explain-flags.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28121/kaiju</guid>
	<pubDate>Mon, 27 Jun 2016 11:23:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28121/kaiju</link>
	<title><![CDATA[Kaiju]]></title>
	<description><![CDATA[<p>Kaiju is a program for the taxonomic classification of metagenomic high-throughput sequencing reads. Each read is directly assigned to a taxon within the NCBI taxonomy by comparing it to a reference database containing microbial and viral protein sequences.</p>
<p>By default, Kaiju uses either the available complete genomes from NCBI RefSeq or the microbial subset of the non-redundant protein database <em>nr</em> used by NCBI BLAST, optionally also including fungi and microbial eukaryotes.</p>
<p>Kaiju translates reads into amino acid sequences, which are then searched in the database using a modified backward search on a memory-efficient implementation of the Burrows-Wheeler transform, which finds maximum exact matches (MEMs), optionally allowing mismatches in the protein alignment. The search can process up to millions of reads per minute using, for example, only 10 GB RAM with a protein database comprising 4821 microbial genomes. Kaiju can also be used for querying any other protein database without taxonomic classification, using either protein or nucleotide queries.</p>
<p>Kaiju is described in <a href="http://www.nature.com/ncomms/2016/160413/ncomms11257/full/ncomms11257.html">Menzel, P. et al. (2016) Fast and sensitive taxonomic classification for metagenomics with Kaiju. <em>Nat. Commun.</em> 7:11257</a> (open access).</p><p>Address of the bookmark: <a href="http://kaiju.binf.ku.dk/" rel="nofollow">http://kaiju.binf.ku.dk/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28415/scarpa</guid>
	<pubDate>Wed, 13 Jul 2016 07:59:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28415/scarpa</link>
	<title><![CDATA[Scarpa]]></title>
	<description><![CDATA[<p><strong>Scarpa</strong>&nbsp;is a stand-alone scaffolding tool for NGS data. It can be used together with virtually any genome assembler and any NGS read mapper that supports SAM format. Other features include support for multiple libraries and an option to estimate insert size distributions from data. Scarpa is available free of charge for academic and commercial use under the GNU General Public License (GPL).</p>
<p>See the&nbsp;<a href="http://compbio.cs.toronto.edu/hapsembler/hapsembler-2.21_manual.pdf">user manual</a>&nbsp;or the&nbsp;<a href="http://compbio.cs.toronto.edu/hapsembler/scarpa_paper.pdf">paper</a>&nbsp;for more information about Scarpa. Click&nbsp;<a href="http://compbio.cs.toronto.edu/hapsembler/ScarpaSupplementary.pdf">here</a>&nbsp;for the supplementary material.</p><p>Address of the bookmark: <a href="http://compbio.cs.toronto.edu/hapsembler/scarpa.html" rel="nofollow">http://compbio.cs.toronto.edu/hapsembler/scarpa.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29272/decipher</guid>
	<pubDate>Fri, 30 Sep 2016 09:33:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29272/decipher</link>
	<title><![CDATA[DECIPHER]]></title>
	<description><![CDATA[<p>DECIPHER is a software toolset that can be used to maintain, analyze, and decipher large amounts of DNA sequence data. To install DECIPHER, see the <a href="http://DECIPHER.cee.wisc.edu/Download.html">Downloads</a> page.<br><br> To begin using DECIPHER read the "Getting Started DECIPHERing" tutorial. Refer to the PDF documents below for instructions on how to use DECIPHER for various tasks.</p><p>Address of the bookmark: <a href="http://decipher.cee.wisc.edu/Documentation.html" rel="nofollow">http://decipher.cee.wisc.edu/Documentation.html</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29282/cosmic</guid>
	<pubDate>Sat, 01 Oct 2016 15:04:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29282/cosmic</link>
	<title><![CDATA[COSMIC]]></title>
	<description><![CDATA[<p>The accurate description and annotation of structural variants can be complex. &nbsp;This is due to the different resolution that variants are reported from traditional&nbsp;cytogenetic coordinates down to the actual base pair positions. Furthermore, multiple&nbsp;rearrangements in a single area of the genome can make cataloguing and interpreting&nbsp;their effects challenging.&nbsp;</p>
<p>The Rearrangement Overview page describes the one or more breakpoints which make up a structural&nbsp;variant. A breakpoint is defined as a region or point where the sample sequence has altered&nbsp;from the reference sequence. Minimum interpretation is made of this data. One variant event&nbsp;can consist of one or multiple breakpoints. The Syntax (shown above the table) gives a detailed description of the variant and its location &nbsp;(e.g. chr11:g.36585230_76606619del, a deletion of&nbsp;roughly 40Mb on chromosome 11). Syntax is based on HGVS mutation nomenclature recommendations&nbsp;[http://www.hgvs.org/rec.html].&nbsp;</p>
<p>http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview</p><p>Address of the bookmark: <a href="http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview" rel="nofollow">http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29638/r-graphical-cookbook-by-winston-chang</guid>
	<pubDate>Fri, 04 Nov 2016 12:50:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29638/r-graphical-cookbook-by-winston-chang</link>
	<title><![CDATA[R Graphical Cookbook by Winston Chang]]></title>
	<description><![CDATA[<p>R Graphical Cookbook by Winston Chang</p><p>A very nice book by Winston Chang for R ethusiast. The R code presented in these pages is the R code actually used to produce the Figures in the book. There will be differences compared to the code chunks shown in the text of the book, but in most cases the differences will be that these pages contain additional code to lay out multiple plots on a single "page".</p><p>The code presented for each figure is self-contained, i.e., all code required to produce the figure is included. This means that there is sometimes considerable overlap of code between several figures  In some cases, it may be necessary to install an add-on package from CRAN to get the code to run.</p><p>More books at http://www.e-reading.club/bookreader.php/137370/C486x_APPb.pdf</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29638" length="37521" type="image/png" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29683/method-in-comparative-genomics</guid>
	<pubDate>Wed, 09 Nov 2016 16:29:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29683/method-in-comparative-genomics</link>
	<title><![CDATA[Method in Comparative genomics !!]]></title>
	<description><![CDATA[<p>We present methods for the automatic determination of genome correspondence. The algorithms enabled the automatic identification of orthologs for more than 90% of genes and intergenic regions across the four species despite the large number of duplicated genes in the yeast genome. The remaining ambiguities in the gene correspondence revealed recent gene family expansions in regions of rapid genomic change.</p>
<p>We present methods for the identification of protein-coding genes based on their patterns of nucleotide conservation across related species. We observed the pressure to conserve the reading frame of functional proteins and developed a test for gene identification with high sensitivity and specificity. We used this test to revisit the genome of S. cerevisiae, reducing the overall gene count by 500 genes (10% of previously annotated genes) and refining the gene structure of hundreds of genes. We present novel methods for the systematic de novo identification of regulatory motifs. The methods do not rely on previous knowledge of gene function and in that way differ from the current literature on computational motif discovery. Based on the genome-wide conservation patterns of known motifs, we developed three conservation criteria that we used to discover novel motifs. We used an enumeration approach to select strongly conserved motif cores, which we extended and collapsed into a small number of candidate regulatory motifs. These include most previously known regulatory motifs as well as several noteworthy novel motifs. The majority of discovered motifs are enriched in functionally related genes, allowing us to infer a candidate function for novel motifs.</p>
<p>Our results demonstrate the power of comparative genomics to further our understanding of any species. Our methods are validated by the extensive experimental knowledge in yeast, and will be invaluable in the study of complex genomes like that of human.</p><p>Address of the bookmark: <a href="http://web.mit.edu/manoli/www/publications/Kellis_JCB_04.pdf" rel="nofollow">http://web.mit.edu/manoli/www/publications/Kellis_JCB_04.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>