<?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/31377?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/31377?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31139/pbsuite-software-for-long-read-sequencing-data-from-pacbio</guid>
	<pubDate>Mon, 27 Feb 2017 09:54:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31139/pbsuite-software-for-long-read-sequencing-data-from-pacbio</link>
	<title><![CDATA[PBSuite: Software for Long-Read Sequencing Data from PacBio]]></title>
	<description><![CDATA[<p><span>PBJelly - the genome upgrading tool.&nbsp;</span><br><span>PBHoney - the structural variation discovery tool&nbsp;</span><br><br><span>Both are contained within the PBSuite code found in downloads.</span><br><br><span>----- PBJelly -----</span><br><span>Read The Paper&nbsp;</span><br><a href="http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0047768" target="_blank">http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0047768</a><br><br><span>PBJelly is a highly automated pipeline that aligns long sequencing reads (such as PacBio RS reads or long 454 reads in fasta format) to high-confidence draft assembles. PBJelly fills or reduces as many captured gaps as possible to produce upgraded draft genomes.&nbsp;</span><br><br><span>----- PBHoney -----</span><br><span>Read The Paper</span><br><a href="http://www.biomedcentral.com/1471-2105/15/180/abstract" target="_blank">http://www.biomedcentral.com/1471-2105/15/180/abstract</a><br><br><span>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.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/pb-jelly/" rel="nofollow">https://sourceforge.net/projects/pb-jelly/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31302/multi-metagenome-assembly</guid>
	<pubDate>Fri, 03 Mar 2017 10:14:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31302/multi-metagenome-assembly</link>
	<title><![CDATA[Multi-metagenome assembly]]></title>
	<description><![CDATA[<p>This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in:</p>
<p>Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes<br><br>Mads Albertsen, Philip Hugenholtz, Adam Skarshewski, Gene W. Tyson, K&aring;re L. Nielsen and Per .H. Nielsen</p>
<p>Nature Biotechnology 2013, doi:&nbsp;<a href="http://www.nature.com/nbt/journal/vaop/ncurrent/abs/nbt.2579.html">10.1038/nbt.2579</a></p><p>Address of the bookmark: <a href="https://github.com/MadsAlbertsen/multi-metagenome" rel="nofollow">https://github.com/MadsAlbertsen/multi-metagenome</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31371/phenogram</guid>
	<pubDate>Tue, 07 Mar 2017 08:35:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31371/phenogram</link>
	<title><![CDATA[PhenoGram]]></title>
	<description><![CDATA[<p><span>With PhenoGram researchers can create chomosomal ideograms annotated with lines in color at specific base-pair locations, or colored base-pair to base-pair regions, with or without other annotation. PhenoGram allows for annotation of chromosomal locations and/or regions with shapes in different colors, gene identifiers, or other text. PhenoGram also allows for creation of plots showing expanded chromosomal locations, providing a way to show results for specific chromosomal regions in greater detail.</span></p><p>Address of the bookmark: <a href="http://ritchielab.psu.edu/software/phenogram-downloads" rel="nofollow">http://ritchielab.psu.edu/software/phenogram-downloads</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/32719/download-assemblies-from-ncbi</guid>
	<pubDate>Mon, 15 May 2017 06:02:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/32719/download-assemblies-from-ncbi</link>
	<title><![CDATA[Download assemblies from NCBI]]></title>
	<description><![CDATA[<p>A new &ldquo;Download assemblies&rdquo; button is now available in the&nbsp;<a href="https://www.ncbi.nlm.nih.gov/assembly" target="_blank">Assembly</a>&nbsp;database. This makes it easy to download data for multiple genomes without having to write scripts.</p><p>For example, you can run a search in Assembly and use check boxes (see left side of screenshot below) to refine the set of genome assemblies of interest. Then, just open the &ldquo;Download assemblies&rdquo; menu, choose the source database (<a href="https://www.ncbi.nlm.nih.gov/genbank/" target="_blank">GenBank</a>&nbsp;or&nbsp;<a href="https://www.ncbi.nlm.nih.gov/refseq/" target="_blank">RefSeq</a>), choose the file type, and start the download. An archive file will be saved to your computer that can be expanded into a folder containing your selected genome data files.</p><p><img src="https://ncbiinsights.files.wordpress.com/2017/05/download_button.jpg?w=584" alt="image" width="584" height="444" style="border: 0px; border: 0px;"></p><p>&nbsp;</p><p>More at&nbsp;https://ncbiinsights.ncbi.nlm.nih.gov/2017/05/08/genome-data-download-made-easy/</p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26303/maker</guid>
	<pubDate>Sun, 07 Feb 2016 15:59:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26303/maker</link>
	<title><![CDATA[MAKER]]></title>
	<description><![CDATA[<p>MAKER is a portable and easily configurable genome annotation pipeline.Its purpose is to allow smaller eukaryotic and prokaryotic genome projects to independently annotate their genomes and to create genome databases. MAKER identifies repeats, aligns ESTs and proteins to a genome, produces ab-initio gene predictions and automatically synthesizes these data into gene annotations having evidence-based quality values.</p>
<p>More at http://www.yandell-lab.org/software/maker.html</p><p>Address of the bookmark: <a href="http://www.yandell-lab.org/software/maker.html" rel="nofollow">http://www.yandell-lab.org/software/maker.html</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30124/understanding-greedy-algorithms</guid>
	<pubDate>Mon, 12 Dec 2016 04:37:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30124/understanding-greedy-algorithms</link>
	<title><![CDATA[Understanding Greedy Algorithms]]></title>
	<description><![CDATA[<p>Learning greedy algo for biologist.&nbsp;</p>
<p>https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/</p>
<p>This webpage is also useful for the same:</p>
<p>http://learninglover.com/examples.php?id=59</p>
<p>http://www.cs.rpi.edu/~magdon/ps/conference/super_biokdd.pdf</p>
<p>https://ocw.mit.edu/courses/biology/7-91j-foundations-of-computational-and-systems-biology-spring-2014/lecture-slides/MIT7_91JS14_Lecture6.pdf</p>
<p>http://schatzlab.cshl.edu/teaching/AssemblyClass/01.%20Assembly%20Intro.pdf</p>
<p>http://lsl.sinica.edu.tw/Services/Class/files/20150612449.pdf</p>
<p>http://www.cs.jhu.edu/~langmea/resources/lecture_notes/assembly_scs.pdf</p>
<p>https://www2.eecs.berkeley.edu/Pubs/TechRpts/2016/EECS-2016-43.pdf</p><p>Address of the bookmark: <a href="https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/" rel="nofollow">https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30625/pandaseq</guid>
	<pubDate>Mon, 23 Jan 2017 04:54:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30625/pandaseq</link>
	<title><![CDATA[PANDASEQ]]></title>
	<description><![CDATA[<p>PANDASEQ assembles paired-end Illumina reads into sequences, trying to correct for errors and uncalled bases. The assembler reads two files in FASTQ format with quality information. If amplification primers were used (e.g., to isolate a variable region of the 16S gene, or the constant regions around zinc finger binding residues), they can be removed from the sequence during assembly. The final sequence will correct any uncalled bases in the overlapping region using the complementary strand. When mismatches occur in the overlapping region, the base with the better quality score is chosen.<br>The algorithm is as follows:<br><br>1.Find the positions where the forward and reverse primers match best above the threshold and discard the ends of the sequence, including the primer.<br>2.Pick and overlap to maximise the probability of the forward and reverse reads having come from a single piece of DNA.<br>3.Identify the masking of the end of the read with the quality score B or # as done by CASAVA and adjust the probabilities in this region.<br>4.Construct an assembled sequence between the primers and calculate the quality.<br>5.Check for various constraints, including quality, length, uncalled bases, and user-supplied modules.</p>
<p>http://neufeldserver.uwaterloo.ca/~apmasell/pandaseq_man1.html</p><p>Address of the bookmark: <a href="http://neufeldserver.uwaterloo.ca/~apmasell/pandaseq_man1.html" rel="nofollow">http://neufeldserver.uwaterloo.ca/~apmasell/pandaseq_man1.html</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/32713/salzberg-lab</guid>
  <pubDate>Mon, 15 May 2017 05:14:01 -0500</pubDate>
  <link></link>
  <title><![CDATA[Salzberg lab]]></title>
  <description><![CDATA[
<p>We are a computational biology lab that develops novel methods for analysis of DNA and RNA sequences. Our research includes software for aligning and assembling RNA-seq data, whole-genome assembly, and microbiome analysis. We work closely with biomedical scientists to apply these methods to current problems arising in a broad spectrum of biological and medical research areas. We’re also part of the Center for Computational Biology, a group of 20+ faculty members and their labs at Johns Hopkins working on computational, statistical, and mathematical methods that can turn massive genomic data sets into biologically and clinically useful information.</p>

<p>https://salzberg-lab.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29343/accnet</guid>
	<pubDate>Fri, 07 Oct 2016 05:22:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29343/accnet</link>
	<title><![CDATA[AccNET]]></title>
	<description><![CDATA[<p><span>AccNET is a Perl application that presents a new way to study the accessory genome of a given set of organisms. Using the proteomes of these organisms, AccNET create a bipartite network compatible with common network analysis platforms. AccNET collects phylogenetic and functional information in a network improving the analysis capability. Networks offer a new perspective of organism organization through elements acquired by horizontal gene transfers and not constricted by hierarchical structures.</span></p>
<p><span>More at&nbsp;https://www.youtube.com/watch?v=vdGuy1GAJrQ</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/accnet/" rel="nofollow">https://sourceforge.net/projects/accnet/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28835/a5-miseq</guid>
	<pubDate>Thu, 18 Aug 2016 04:05:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28835/a5-miseq</link>
	<title><![CDATA[A5-miseq]]></title>
	<description><![CDATA[<p><span><span>_A5-miseq_ is a pipeline for assembling DNA sequence data generated on the Illumina sequencing platform. This README will take you through the steps necessary for running _A5-miseq_. </span></span></p>
<p><span>Point to note:</span></p>
<p><span>There are many situations where A5-miseq is not the right tool for the job. In order to produce accurate results, A5-miseq requires Illumina data with certain characteristics. A5-miseq will likely not work well with Illumina reads shorter than around 80nt, or reads where the base qualities are low in all or most reads before 60nt. A5-miseq assumes it is assembling homozygous haploid genomes. Use a different assembler for metagenomes and heterozygous diploid or polyploid organisms. Use a different assembler if a tool like FastQC reports your data quality is dubious. You have been warned! Datasets consisting solely of unpaired reads are not currently supported.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/ngopt/" rel="nofollow">https://sourceforge.net/projects/ngopt/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>