<?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/35621?offset=140</link>
	<atom:link href="https://bioinformaticsonline.com/related/35621?offset=140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27696/methylkit</guid>
	<pubDate>Fri, 03 Jun 2016 10:09:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27696/methylkit</link>
	<title><![CDATA[methylKit]]></title>
	<description><![CDATA[<p><em>methylKit</em> is an <a href="http://en.wikipedia.org/wiki/R_%28programming_language%29">R</a> package for DNA methylation analysis and annotation from high-throughput bisulfite sequencing. The package is designed to deal with sequencing data from <a href="http://www.nature.com/nprot/journal/v6/n4/abs/nprot.2010.190.html">RRBS</a> and its variants, but also target-capture methods such as <a href="http://www.halogenomics.com/sureselect/methyl-seq">Agilent SureSelect methyl-seq</a>. In addition, methylKit can deal with base-pair resolution data for 5hmC obtained from Tab-seq or oxBS-seq. It can also handle whole-genome bisulfite sequencing data if proper input format is provided.</p><p>Address of the bookmark: <a href="https://github.com/al2na/methylKit" rel="nofollow">https://github.com/al2na/methylKit</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27845/cnidaria-fast-reference-free-phylogenomic-clustering</guid>
	<pubDate>Thu, 16 Jun 2016 17:55:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27845/cnidaria-fast-reference-free-phylogenomic-clustering</link>
	<title><![CDATA[CNIDARIA: fast, reference-free phylogenomic clustering]]></title>
	<description><![CDATA[<p>Motivation: Identification of biological specimens is a major requirement for a range of applications. Reference-free methods analyse unprocessed sequencing data without relying on prior knowledge, but these do not scale to arbitrarily large genomes and arbitrarily large phylogenetic distances.</p>
<p>Results: We present Cnidaria, a practical tool for clustering genomic and transcriptomic data with no limitation on ge-nome size or phylogenetic distances. We successfully simultaneously clustered 169 genomic and transcriptomic datasets from 4 kingdoms, achieving 100% accuracy at supra-species level and 78% accuracy for species level.</p>
<p>Availability and Implementation: Cnidaria is written in C++ and Python and is available at http://www.ab.wur.nl/cnidaria.</p>
<p>Contact: Saulo Aflitos - sauloal@gmail.com</p>
<p>Supplementary information: Supplementary data are available at Bioinformatics online.</p><p>Address of the bookmark: <a href="https://github.com/sauloal/cnidaria/wiki" rel="nofollow">https://github.com/sauloal/cnidaria/wiki</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28117/quin%E2%80%99s-web-server</guid>
	<pubDate>Mon, 27 Jun 2016 10:44:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28117/quin%E2%80%99s-web-server</link>
	<title><![CDATA[QuIN’s web server]]></title>
	<description><![CDATA[<p><span>Recent studies of the human genome have indicated that regulatory elements (e.g. promoters and enhancers) at distal genomic locations can interact with each other via chromatin folding and affect gene expression levels. Genomic technologies for mapping interactions between DNA regions, e.g., ChIA-PET and HiC, can generate genome-wide maps of interactions between regulatory elements. These interaction datasets are important resources to infer distal gene targets of non-coding regulatory elements and to facilitate prioritization of critical loci for important cellular functions. With the increasing diversity and complexity of genomic information and public ontologies, making sense of these datasets demands integrative and easy-to-use software tools. Moreover, network representation of chromatin interaction maps enables effective data visualization, integration, and mining. Currently, there is no software that can take full advantage of network theory approaches for the analysis of chromatin interaction datasets. To fill this gap, we developed a web-based application, QuIN, which enables: 1) building and visualizing chromatin interaction networks, 2) annotating networks with user-provided private and publicly available functional genomics and interaction datasets, 3) querying network components based on gene name or chromosome location, and 4) utilizing network based measures to identify and prioritize critical regulatory targets and their direct and indirect interactions.&nbsp;</span></p>
<p><strong>AVAILABILITY:</strong><span>&nbsp;QuIN&rsquo;s web server is available at&nbsp;</span><a href="http://quin.jax.org/">http://quin.jax.org</a><span>&nbsp;QuIN is developed in Java and JavaScript, utilizing an Apache Tomcat web server and MySQL database and the source code is available under the GPLV3 license available on GitHub:</span><a href="https://github.com/UcarLab/QuIN/">https://github.com/UcarLab/QuIN/</a><span>.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004809" rel="nofollow">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1004809</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28290/bioinformatics-tools-and-software</guid>
	<pubDate>Tue, 05 Jul 2016 10:02:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28290/bioinformatics-tools-and-software</link>
	<title><![CDATA[Bioinformatics tools and software]]></title>
	<description><![CDATA[<p><a href="http://drive5.com/usearch">USEARCH &gt;</a><br><span>Extreme high-throughput sequence analysis. Orders of magnitude faster than BLAST.</span>&nbsp;<a href="http://drive5.com/muscle">MUSCLE &gt;</a><br><span>Multiple sequence alignment. Faster and more accurate than CLUSTALW.</span></p>
<p>&nbsp;<a href="http://drive5.com/uparse">UPARSE &gt;</a><br><span>OTU clustering for 16S and other marker genes. Highly accurate OTU sequences and improved diversity measures.</span>&nbsp;<a href="http://drive5.com/uchime">UCHIME &gt;</a><br><span>Chimeric sequence detection.</span>&nbsp;<a href="http://drive5.com/piler">PILER &gt;</a><br><span>De novo genome repeat finder.</span>&nbsp;<a href="http://drive5.com/pilercr">PILER-CR &gt;</a><br><span>Detection of CRISPR repeats in bacterial genomes.</span>&nbsp;<a href="http://drive5.com/qscore">QSCORE &gt;</a><br><span>Compare two multiple alignments for benchmarking.</span>&nbsp;<a href="http://drive5.com/pals">PALS &gt;</a><br><span>Whole-genome alignment.</span>&nbsp;<a href="http://drive5.com/muscle/prefab.htm">PREFAB &gt;</a><br><span>Protein Reference Alignment Database.</span>&nbsp;<a href="http://drive5.com/bench">MSA benchmark collection &gt;</a><br><span>Selected multiple alignment benchmarks in a standardized FASTA format.</span></p><p>Address of the bookmark: <a href="http://drive5.com/software.html" rel="nofollow">http://drive5.com/software.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29103/genome-strip</guid>
	<pubDate>Tue, 06 Sep 2016 03:58:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29103/genome-strip</link>
	<title><![CDATA[Genome STRiP]]></title>
	<description><![CDATA[<p><strong>Genome STRiP</strong><span>&nbsp;(Genome STRucture In Populations) is a suite of tools for discovering and genotyping structural variations using sequencing data. The methods are designed to detect shared variation using data from multiple individuals.</span><br><br><span>Genome STRiP looks both across and within a set of sequenced genomes to detect variation. The methods are adaptive and support heterogeneous data sets, including variations in sequencing depth, read lengths and mixtures of paired and single-end reads. A minimum of 20 to 30 genomes are required to get acceptable results, but the method gains power across genomes and processing more genomes provide better results.</span><br><br><span>To run discovery or genotyping on a single sequenced genome or a small set of genomes, you need to call your data against a background population, such as a set of genomes from the 1000 Genomes Project.&nbsp; The background population does not need to be matched to the target individuals.</span></p><p>Address of the bookmark: <a href="http://software.broadinstitute.org/software/genomestrip/" rel="nofollow">http://software.broadinstitute.org/software/genomestrip/</a></p>]]></description>
	<dc:creator>Neel</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28915/useful-bioinformatics-tools</guid>
	<pubDate>Mon, 29 Aug 2016 04:08:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28915/useful-bioinformatics-tools</link>
	<title><![CDATA[Useful Bioinformatics Tools]]></title>
	<description><![CDATA[<p>Collections of few handy tools for bioinformatician</p>
<p>http://molbiol-tools.ca/Convert.htm</p><p>Address of the bookmark: <a href="http://molbiol-tools.ca/Convert.htm" rel="nofollow">http://molbiol-tools.ca/Convert.htm</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28997/braker-pipeline-for-fully-automated-prediction-of-protein-coding-genes-with-genemark-eset-and-augustus-in-novel-eukaryotic-genomes</guid>
	<pubDate>Thu, 01 Sep 2016 08:02:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28997/braker-pipeline-for-fully-automated-prediction-of-protein-coding-genes-with-genemark-eset-and-augustus-in-novel-eukaryotic-genomes</link>
	<title><![CDATA[BRAKER: pipeline for fully automated prediction of protein coding genes with GeneMark-ES/ET and AUGUSTUS in novel eukaryotic genomes]]></title>
	<description><![CDATA[<p><span>Gene finding in eukaryotic genomes is notoriously difficult to automate. The task is to design a work flow with a minimal set of tools that would reach state-of-the-art performance across a wide range of species. GeneMark-ET is a gene prediction tool that incorporates RNA-Seq data into unsupervised training and subsequently generates ab initio gene predictions. AUGUSTUS is a gene finder that usually requires supervised training and uses information from RNA-Seq reads in the prediction step. Complementary strengths of GeneMark-ET and AUGUSTUS provided motivation for designing a new combined tool for automatic gene prediction.</span></p>
<p>http://www.ncbi.nlm.nih.gov/pubmed/26559507</p><p>Address of the bookmark: <a href="http://bioinf.uni-greifswald.de/bioinf/braker/" rel="nofollow">http://bioinf.uni-greifswald.de/bioinf/braker/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29029/ngs-tutorial</guid>
	<pubDate>Mon, 05 Sep 2016 09:50:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29029/ngs-tutorial</link>
	<title><![CDATA[NGS Tutorial]]></title>
	<description><![CDATA[<p><span>These tutorials are written for hundreds of bioinformaticians trying to cope with large volume of next-generation sequencing (NGS) data. NGS technologies brought a dramatic shift in the world of sequencing. Merely five years back, genome sequencing of higher eukaryotes used to be very expensive endeavor. To get a genome of interest sequenced, hundreds of scientists had to raise funds together by writing a joint white-paper and petitioning to various government agencies. The tasks of sequencing and assembly were handled by dedicated sequencing facilities, of which only a few existed around the globe. Naturally, the capacities at those sequencing facilities were significantly constrained from high volume of requests</span></p><p>Address of the bookmark: <a href="http://www.homolog.us/Tutorials/index.php" rel="nofollow">http://www.homolog.us/Tutorials/index.php</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>