<?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/29382?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/29382?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28906/gene-finding-and-predictions</guid>
	<pubDate>Fri, 26 Aug 2016 07:26:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28906/gene-finding-and-predictions</link>
	<title><![CDATA[Gene Finding and Predictions]]></title>
	<description><![CDATA[<p><span>In this exercise, a previously annotated gene will be used to measure the accuracy of different gene finding approaches. GRAIL, GENSCAN,&nbsp;</span><tt>geneid</tt><span>, FGENESH, GenomeScan, GrailEXP and GENEWISE will be used to annotate the sequence. Both search by signal, content and homology (protein and cDNA sequences) methods will be employed in order to improve the ab initio results. Weak conservation of Start codons will lead to wrong prediction of initial exons in most cases.</span></p>
<p>http://genome.crg.es/courses/Bioinformatics2003_genefinding/</p><p>Address of the bookmark: <a href="http://genome.crg.es/courses/Bioinformatics2003_genefinding/" rel="nofollow">http://genome.crg.es/courses/Bioinformatics2003_genefinding/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29123/artemis-comparison-tool-act</guid>
	<pubDate>Wed, 07 Sep 2016 03:54:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29123/artemis-comparison-tool-act</link>
	<title><![CDATA[Artemis Comparison Tool (ACT)]]></title>
	<description><![CDATA[<p><span>ACT is a Java application for displaying pairwise comparisons between two or more DNA sequences. It can be used to identify and analyse regions of similarity and difference between genomes and to explore conservation of synteny, in the context of the entire sequences and their annotation.&nbsp;It can read complete EMBL,&nbsp;GENBANK and GFF entries or sequences in FASTA or raw format.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.sanger.ac.uk/science/tools/artemis-comparison-tool-act" rel="nofollow">http://www.sanger.ac.uk/science/tools/artemis-comparison-tool-act</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29008/circos-visualize</guid>
	<pubDate>Fri, 02 Sep 2016 08:29:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29008/circos-visualize</link>
	<title><![CDATA[CIRCOS Visualize !!]]></title>
	<description><![CDATA[<p>Before uploading a data file, check the&nbsp;<a href="http://mkweb.bcgsc.ca/tableviewer/samples">samples gallery</a>&nbsp;to make sure that your data format is compatible.</p>
<ul>
<li>Your file must be&nbsp;<strong>plain text</strong>.</li>
<li>Your data values must be&nbsp;<strong>non-negative integers</strong>.</li>
<li>Data must be space-separated (<strong>one or more</strong>&nbsp;tab or space, which will be collapsed).</li>
<li>No two rows or columns may have the same name.</li>
<li>Column and row names must&nbsp;<strong>begin with a letter</strong>&nbsp;(e.g. 'A', 'A0', 'A-0') and can only contain letters, numbers and _. No punctuation!</li>
<li>Maximum row + column total is 150 &mdash; if exceeded, rows and columns are limited to 75.</li>
<li>If you are using order, size and color rows/columns in combination they must appear in that order.</li>
</ul>
<p>Need help? Post questions to the&nbsp;<a href="https://groups.google.com/forum/#!forum/circos-data-visualization">Circos Google Group</a>.</p>
<p>http://mkweb.bcgsc.ca/tableviewer/visualize/</p><p>Address of the bookmark: <a href="http://mkweb.bcgsc.ca/tableviewer/visualize/" rel="nofollow">http://mkweb.bcgsc.ca/tableviewer/visualize/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29112/sybil</guid>
	<pubDate>Wed, 07 Sep 2016 03:20:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29112/sybil</link>
	<title><![CDATA[Sybil]]></title>
	<description><![CDATA[<p><span>The Sybil software package provides a primarily web-based front-end to comparative genome datasets warehoused in a chado relational database. It was developed by the bioinformatics department at The Institute for Genomic Research (</span><a href="http://www.tigr.org/">TIGR</a><span>) and development continues at the J. Craig Venter Institute (</span><a href="http://jcvi.org/">JCVI</a><span>) and the Institute for Genome Sciences (</span><a href="http://igs.umaryland.edu/">IGS</a><span>) at the University of Maryland: Baltimore. Sybil has been used at TIGR/JCVI, IGS, NYU, New York Medical College, Novartis Vaccines and University of Maryland: College Park to support a number of research projects that involve comparative genome analysis. The following sections provide some high-level technical details about the overall architecture and external dependencies of the Sybil package.</span></p><p>Address of the bookmark: <a href="http://sybil.sourceforge.net/" rel="nofollow">http://sybil.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29957/record</guid>
	<pubDate>Fri, 25 Nov 2016 08:23:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29957/record</link>
	<title><![CDATA[RECORD]]></title>
	<description><![CDATA[<p>Background. Next-generation sequencing technologies are now producing multiple times the genome size in total reads from a single experiment. This is enough information to reconstruct at least some of the differences between the individual genome studied in the experiment and the reference genome of the species. However, in most typical protocols, this information is disregarded and the reference genome is used. Results. We provide a new approach that allows researchers to reconstruct genomes very closely related to the reference genome (e.g., mutants of the same species) directly from the reads used in the experiment. Our approach applies de novo assembly software to experimental reads and so-called pseudoreads and uses the resulting contigs to generate a modified reference sequence. In this way, it can very quickly, and at no additional sequencing cost, generate new, modified reference sequence that is closer to the actual sequenced genome and has a full coverage. In this paper, we describe our approach and test its implementation called RECORD. We evaluate RECORD on both simulated and real data. We made our software publicly available on sourceforge. Conclusion. Our tests show that on closely related sequences RECORD outperforms more general assisted-assembly software.</p>
<p>More at&nbsp;https://sourceforge.net/projects/record-genome-assembler/files/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pubmed/26558255" rel="nofollow">https://www.ncbi.nlm.nih.gov/pubmed/26558255</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30203/e-rga-enhanced-reference-guided-assembly-of-complex-genomes</guid>
	<pubDate>Mon, 19 Dec 2016 05:56:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30203/e-rga-enhanced-reference-guided-assembly-of-complex-genomes</link>
	<title><![CDATA[e-RGA: enhanced Reference Guided Assembly of Complex Genomes]]></title>
	<description><![CDATA[<p><span>Next Generation Sequencing has totally changed genomics: we are able to produce huge amounts of data at an incredibly low cost compared to Sanger sequencing. Despite this, some old problems have become even more difficult, de novo assembly being on top of this list. Despite efforts to design tools able to assemble, de novo, an organism sequenced with short reads, the results are still far from those achievable with long reads. In this paper, we propose a novel method that aims to improve de novo assembly in the presence of a closely related reference. The idea is to combine de novo and reference-guided assembly in order to obtain enhanced results.</span></p><p>Address of the bookmark: <a href="http://journal.embnet.org/index.php/embnetjournal/article/view/208" rel="nofollow">http://journal.embnet.org/index.php/embnetjournal/article/view/208</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30144/bima-v3-an-aligner-customized-for-mate-pair-library-sequencing</guid>
	<pubDate>Wed, 14 Dec 2016 15:20:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30144/bima-v3-an-aligner-customized-for-mate-pair-library-sequencing</link>
	<title><![CDATA[BIMA V3: an aligner customized for mate pair library sequencing]]></title>
	<description><![CDATA[<p>Summary: Mate pair library sequencing is an effective and economical method for detecting genomic structural variants and chromosomal abnormalities. Unfortunately, the mapping and alignment of mate pair read pairs to a reference genome is a challenging and <br>time consuming process for most NGS alignment programs. Large insert sizes, introduction of library preparation protocol artifacts (biotin junction reads, paired-end read contamination, chimeras, etc.), and presence of structural variant breakpoints within reads increases mapping and alignment complexity. We describe an algorithm that is up to 20 times faster and 25% more accurate than popular NGS alignment programs when processing mate pair sequencing. <br>Availability: http://bioinformaticstools.mayo.edu/research/bima/ <br>Contact: vasmatzis.george@mayo.edu</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/early/2014/02/12/bioinformatics.btu078.full.pdf" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/early/2014/02/12/bioinformatics.btu078.full.pdf</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31353/concoct-clustering-contigs-with-coverage-and-composition</guid>
	<pubDate>Mon, 06 Mar 2017 04:08:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31353/concoct-clustering-contigs-with-coverage-and-composition</link>
	<title><![CDATA[CONCOCT: Clustering cONtigs with COverage and ComposiTion]]></title>
	<description><![CDATA[<p>A program for unsupervised binning of metagenomic contigs by using nucleotide composition, coverage data in multiple samples and linkage data from paired end reads.</p>
<p>Warning! This software is to be considered under development. Functionality and the user interface may still change significantly from one version to another. If you want to use this software, please stay up to date with the list of known issues:<a href="https://github.com/BinPro/CONCOCT/issues">https://github.com/BinPro/CONCOCT/issues</a></p><p>Address of the bookmark: <a href="https://github.com/BinPro/CONCOCT" rel="nofollow">https://github.com/BinPro/CONCOCT</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28842/repeatmodeler</guid>
	<pubDate>Thu, 18 Aug 2016 09:57:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28842/repeatmodeler</link>
	<title><![CDATA[RepeatModeler]]></title>
	<description><![CDATA[<p><span>RepeatModeler is a de-novo repeat family identification and modeling package. At the heart of RepeatModeler are two de-novo repeat finding programs ( RECON and RepeatScout ) which employ complementary computational methods for identifying repeat element boundaries and family relationships from sequence data. RepeatModeler assists in automating the runs of RECON and RepeatScout given a genomic database and uses the output to build, refine and classify consensus models of putative interspersed repeats.</span></p><p>Address of the bookmark: <a href="http://www.repeatmasker.org/RepeatModeler.html" rel="nofollow">http://www.repeatmasker.org/RepeatModeler.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28884/tgnet</guid>
	<pubDate>Wed, 24 Aug 2016 05:36:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28884/tgnet</link>
	<title><![CDATA[TGNet]]></title>
	<description><![CDATA[<p><span>Recent technological progress has greatly facilitated&nbsp;</span><em>de novo</em><span>&nbsp;genome sequencing. However,&nbsp;</span><em>de novo</em><span>&nbsp;assemblies consist in many pieces of contiguous sequence (contigs) arranged in thousands of scaffolds instead of small numbers of chromosomes. Confirming and improving the quality of such assemblies is critical for subsequent analysis.&nbsp;</span></p>
<p>Visualization and quality assessment of de novo genome assemblies</p>
<p>Citation</p>
<p>This software is fully described in the paper:<br>Riba-Grognuz, Keller, Falquet, Xenarios &amp; Wurm (2011) Visualization and quality assessment of de novo genome assemblies.</p>
<p>In brief, our scripts create Cytoscape files to visualize transcript evidence that suggests adjacency between scaffolds and contigs.</p>
<p>Software requirements</p>
<p>BLAT (tested with Standalone BLAT v. 32&times;1). Source Binaries .<br>Cytoscape (tested with versions 2.7.0, 2.8.2)<br>a UNIX machine (tested on Mac OS X 10.6 and CentOS 4.6)</p><p>Address of the bookmark: <a href="https://github.com/ksanao/TGNet" rel="nofollow">https://github.com/ksanao/TGNet</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>

</channel>
</rss>