<?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/27035?offset=310</link>
	<atom:link href="https://bioinformaticsonline.com/related/27035?offset=310" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30971/hiveplot</guid>
	<pubDate>Thu, 16 Feb 2017 11:39:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30971/hiveplot</link>
	<title><![CDATA[HivePlot]]></title>
	<description><![CDATA[<p>The&nbsp;<em>hive plot</em>&nbsp;is a rational visualization method for drawing networks. Nodes are mapped to and positioned on radially distributed linear axes &mdash; this mapping is based on network structural properties. Edges are drawn as curved links. Simple and interpretable.</p>
<p>The purpose of the hive plot is to establish a new baseline for visualization of large networks &mdash; a method that is both general and tunable and useful as a starting point in visually exploring network structure.</p>
<p>More at&nbsp;http://www.hiveplot.com/</p><p>Address of the bookmark: <a href="http://www.hiveplot.com/" rel="nofollow">http://www.hiveplot.com/</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/31089/conpade-genome-assembly-ploidy-estimation-from-next-generation-sequencing-data</guid>
	<pubDate>Fri, 24 Feb 2017 04:55:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31089/conpade-genome-assembly-ploidy-estimation-from-next-generation-sequencing-data</link>
	<title><![CDATA[ConPADE: Genome Assembly Ploidy Estimation from Next-Generation Sequencing Data]]></title>
	<description><![CDATA[<p><span>ConPADE (Contig Ploidy and Allele Dosage Estimation), a probabilistic method that estimates the ploidy of any given contig/scaffold based on its allele proportions. In the process, they report findings regarding errors in sequencing. The method can be used for whole genome shotgun (WGS) sequencing data. They also show applicability of the method for variant calling and allele dosage estimation. Results for simulated and real datasets are discussed and provide evidence that ConPADE performs well as long as enough sequencing coverage is available, or the true contig ploidy is low.&nbsp;</span></p>
<p><span>https://github.com/microsoftgenomics</span></p><p>Address of the bookmark: <a href="https://github.com/microsoftgenomics" rel="nofollow">https://github.com/microsoftgenomics</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31295/mycc-accurate-binning-of-metagenomic-contigs-via-automated-clustering-sequences-using-information-of-genomic-signatures-and-marker-genes</guid>
	<pubDate>Fri, 03 Mar 2017 08:34:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31295/mycc-accurate-binning-of-metagenomic-contigs-via-automated-clustering-sequences-using-information-of-genomic-signatures-and-marker-genes</link>
	<title><![CDATA[MyCC: Accurate binning of metagenomic contigs via automated clustering sequences using information of genomic signatures and marker genes]]></title>
	<description><![CDATA[<p><span>MyCC, an automated binning tool that combines genomic signatures, marker genes and optional contig coverages within one or multiple samples, in order to visualize the metagenomes and to identify the reconstructed genomic fragments.</span></p>
<p><span>More at&nbsp;http://www.nature.com/articles/srep24175</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/sb2nhri/files/MyCC/" rel="nofollow">https://sourceforge.net/projects/sb2nhri/files/MyCC/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31382/seqmule-automated-human-exomegenome-variants-detection</guid>
	<pubDate>Tue, 07 Mar 2017 10:12:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31382/seqmule-automated-human-exomegenome-variants-detection</link>
	<title><![CDATA[SeqMule: Automated human exome/genome variants detection]]></title>
	<description><![CDATA[<p><span>SeqMule takes single-end or paird-end FASTQ or BAM files, generates a script consisting of more than 10 popular alignment, analysis tools and runs the script line by line. Users can change the pipeline or fine-tune the parameters by modifying its configuration file. SeqMule also has some built-in functions, such as pooling consensus calls from various callers, plotting a Venn diagram showing intersection among different callers, and downloading databases. SeqMule can be used for both Mendelian disease study and cancer genome study.</span></p><p>Address of the bookmark: <a href="http://seqmule.openbioinformatics.org/en/latest/" rel="nofollow">http://seqmule.openbioinformatics.org/en/latest/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32485/bacterial-genome-assembly</guid>
	<pubDate>Fri, 05 May 2017 06:11:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32485/bacterial-genome-assembly</link>
	<title><![CDATA[Bacterial genome assembly !!]]></title>
	<description><![CDATA[<p>This tutorial will serve as an example of how to use free and open-source genome assembly and secondary scaffolding tools to generate high quality assemblies of&nbsp;bacterial sequence data. The bacterial sample used in this tutorial will be referred&nbsp;to simply&nbsp;as &ldquo;Species&rdquo; since it is&nbsp;live data. This data is paired-end data, meaning that there are forward and reverse reads, which we will designate as Sample_R1.fastq and Sample_R2.fastq, respectively.</p>
<p>https://github.com/jennomics/WorkflowPaper/blob/master/Genome%20Assembly%20and%20Annotation.md</p><p>Address of the bookmark: <a href="http://bioinformatics.uconn.edu/bacterial-genome-assembly-tutorial/" rel="nofollow">http://bioinformatics.uconn.edu/bacterial-genome-assembly-tutorial/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32730/ncbi-prokaryotic-genome-annotation-pipeline</guid>
	<pubDate>Tue, 16 May 2017 08:56:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32730/ncbi-prokaryotic-genome-annotation-pipeline</link>
	<title><![CDATA[NCBI Prokaryotic Genome Annotation Pipeline]]></title>
	<description><![CDATA[<p>NCBI Prokaryotic Genome Annotation Pipeline is designed to annotate bacterial and archaeal genomes (chromosomes and plasmids).</p>
<p>Genome annotation is a multi-level process that includes prediction of protein-coding genes, as well as other functional genome units such as structural RNAs, tRNAs, small RNAs, pseudogenes, control regions, direct and inverted repeats, insertion sequences, transposons and other mobile elements.</p>
<p>NCBI has developed an automatic prokaryotic genome annotation pipeline that combines&nbsp;<em>ab initio</em>&nbsp;gene prediction algorithms with homology based methods. The first version of NCBI Prokaryotic Genome Automatic Annotation Pipeline (PGAAP;&nbsp;<a href="https://www.ncbi.nlm.nih.gov/entrez/query.fcgi?cmd=Retrieve&amp;db=pubmed&amp;dopt=Abstract&amp;list_uids=18416670">see Pubmed Article</a>) developed in 2005 has been replaced with an upgraded version that is capable of processing a larger data volume. You can find a more detailed description of the new version of&nbsp;the pipeline in&nbsp;<a href="https://www.ncbi.nlm.nih.gov/books/NBK174280/">NCBI Handbook chapter</a>. NCBI's annotation pipeline depends on several internal databases and is not currently available for download or use outside of the NCBI environment.</p>
<p>https://www.ncbi.nlm.nih.gov/genome/annotation_prok/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/genome/annotation_prok/" rel="nofollow">https://www.ncbi.nlm.nih.gov/genome/annotation_prok/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34216/meraculous-de-novo-genome-assembly-with-short-paired-end-reads</guid>
	<pubDate>Tue, 07 Nov 2017 04:36:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34216/meraculous-de-novo-genome-assembly-with-short-paired-end-reads</link>
	<title><![CDATA[Meraculous: De Novo Genome Assembly with Short Paired-End Reads]]></title>
	<description><![CDATA[<p><span>We describe a new algorithm, meraculous, for whole genome assembly of deep paired-end short reads, and apply it to the assembly of a dataset of paired 75-bp Illumina reads derived from the 15.4 megabase genome of the haploid yeast&nbsp;</span><em>Pichia stipitis</em><span>. More than 95% of the genome is recovered, with no errors; half the assembled sequence is in contigs longer than 101 kilobases and in scaffolds longer than 269 kilobases. Incorporating fosmid ends recovers entire chromosomes. Meraculous relies on an efficient and conservative traversal of the subgraph of the&nbsp;</span><em>k</em><span>-mer (deBruijn) graph of oligonucleotides with unique high quality extensions in the dataset, avoiding an explicit error correction step as used in other short-read assemblers. A novel memory-efficient hashing scheme is introduced. The resulting contigs are ordered and oriented using paired reads separated by &sim;280 bp or &sim;3.2 kbp, and many gaps between contigs can be closed using paired-end placements. Practical issues with the dataset are described, and prospects for assembling larger genomes are discussed.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3158087/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3158087/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36592/lachesis-genome-assembly-with-hi-c-based-contact-probability-maps-lachesis</guid>
	<pubDate>Mon, 14 May 2018 04:26:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36592/lachesis-genome-assembly-with-hi-c-based-contact-probability-maps-lachesis</link>
	<title><![CDATA[LACHESIS: Genome Assembly with Hi-C-based Contact Probability Maps (LACHESIS)]]></title>
	<description><![CDATA[<p>LACHESIS is method that exploits contact probability map data (e.g. from Hi-C) for chromosome-scale&nbsp;<em>de novo</em>&nbsp;genome assembly.</p>
<p>Further information about LACHESIS, including source code, documentation and a user's guide are available at:&nbsp;<a href="http://shendurelab.github.io/LACHESIS/">http://shendurelab.github.io/LACHESIS</a>.</p>
<p>Manuscript describing LACHESIS was published as: Burton JN#, Adey A, Patwardhan RP, Qiu R, Kitzman JO, Shendure J#.&nbsp;<em>Chromosome-scale scaffolding of de novo genome assemblies based on chromatin interactions.</em>&nbsp;Nature Biotechnology 2013 Dec;31(12):1119-25. doi:&nbsp;<a href="http://dx.doi.org/10.1038/nbt.2727">10.1038/nbt.272</a>. PubMed PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/24185095">24185095</a>.</p>
<p>&nbsp;</p>
<p>http://shendurelab.github.io/LACHESIS/</p><p>Address of the bookmark: <a href="http://shendurelab.github.io/LACHESIS/" rel="nofollow">http://shendurelab.github.io/LACHESIS/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40573/de-novo-genome-assembly-for-illumina-data</guid>
	<pubDate>Mon, 20 Jan 2020 05:13:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40573/de-novo-genome-assembly-for-illumina-data</link>
	<title><![CDATA[De novo Genome Assembly for Illumina Data]]></title>
	<description><![CDATA[<p>Written and maintained by <a href="mailto:simon.gladman@unimelb.edu.au">Simon Gladman</a> - Melbourne Bioinformatics (formerly VLSCI)</p>
<p>Protocol Overview / Introduction</p>
<p>In this protocol we discuss and outline the process of de novo assembly for small to medium sized genomes.</p>
<p>https://www.melbournebioinformatics.org.au/tutorials/tutorials/assembly/assembly-protocol/</p><p>Address of the bookmark: <a href="https://www.melbournebioinformatics.org.au/tutorials/tutorials/assembly/assembly-protocol/" rel="nofollow">https://www.melbournebioinformatics.org.au/tutorials/tutorials/assembly/assembly-protocol/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>