<?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/27113?offset=1390</link>
	<atom:link href="https://bioinformaticsonline.com/related/27113?offset=1390" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/32184/metagenomics-assembly-workshop</guid>
	<pubDate>Tue, 18 Apr 2017 04:28:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32184/metagenomics-assembly-workshop</link>
	<title><![CDATA[Metagenomics assembly workshop !!]]></title>
	<description><![CDATA[<div>
<div>
<div id="welcome-to-metagenomics-workshop">
<p>Welcome to the one-day metagenomics assembly workshop. This tutorial will guide you through the typical steps of metagenome assembly and binning.</p>
<div>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/data.html">The Tutorial Data Set</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/qc/index.html">FastQC Quality Control</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/index.html">Assembly</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/velvet.html">Velvet Assembly</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/megahit.html">MEGAHIT Assembly</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/idba_ud.html">IDBA-UD Assembly</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/assembly/ray.html">Ray Assembly</a></li>
</ul>
</li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/geneprediction/index.html">Gene Prediction</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/evaluation/index.html">Assembly Evaluation</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/evaluation/mapping.html">Read Mapping</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/evaluation/metaquast.html">MetaQUAST</a></li>
</ul>
</li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/binning/index.html">Binning</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/binning/maxbin.html">MaxBin Binning</a></li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/binning/metabat.html">MetaBAT Binning</a></li>
</ul>
</li>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/classification/index.html">Classification</a>
<ul>
<li><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/classification/kraken.html">Kraken Taxonomic Sequence Classification System</a></li>
</ul>
</li>
</ul>
</div>
</div>
</div>
</div>
<div><a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/data.html" title="The Tutorial Data Set">Next&nbsp;<span></span></a>
<p>&nbsp;</p>
</div><p>Address of the bookmark: <a href="http://denbi-metagenomics-workshop.readthedocs.io/en/latest/index.html" rel="nofollow">http://denbi-metagenomics-workshop.readthedocs.io/en/latest/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35540/hinge-long-read-assembly-achieves-optimal-repeat-resolution</guid>
	<pubDate>Wed, 07 Feb 2018 09:40:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35540/hinge-long-read-assembly-achieves-optimal-repeat-resolution</link>
	<title><![CDATA[HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution]]></title>
	<description><![CDATA[<p>Software accompanying "HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution"</p>
<ul>
<li>
<p>Preprint:&nbsp;<a href="http://biorxiv.org/content/early/2016/08/01/062117">http://biorxiv.org/content/early/2016/08/01/062117</a></p>
</li>
<li>
<p>Paper:&nbsp;<a href="http://genome.cshlp.org/content/27/5/747.full">http://genome.cshlp.org/content/27/5/747.full</a></p>
</li>
<li>
<p>An ipython notebook to reproduce results in the paper can be found in this&nbsp;<a href="https://github.com/govinda-kamath/HINGE-analyses">repository</a>.</p>
</li>
</ul>
<p>HINGE is an OLC(Overlap-Layout-Consensus) assembler. The idea of the pipeline is shown below.</p>
<p><a href="https://github.com/HingeAssembler/HINGE/blob/master/misc/High_level_overview.png" target="_blank"><img src="https://github.com/HingeAssembler/HINGE/raw/master/misc/High_level_overview.png" alt="image" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/HingeAssembler/HINGE" rel="nofollow">https://github.com/HingeAssembler/HINGE</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32376/diamond</guid>
	<pubDate>Thu, 27 Apr 2017 04:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32376/diamond</link>
	<title><![CDATA[DIAMOND]]></title>
	<description><![CDATA[<p><span>DIAMOND is a sequence aligner for protein and translated DNA searches and functions as a drop-in replacement for the NCBI BLAST software tools. It is suitable for protein-protein search as well as DNA-protein search on short reads and longer sequences including contigs and assemblies, providing a speedup of BLAST ranging up to x20,000.</span></p>
<p><span>More at&nbsp;file:///home/urbe/Downloads/diamond_manual.pdf</span></p>
<p><span>http://www.nature.com/nmeth/journal/v12/n1/full/nmeth.3176.html</span></p><p>Address of the bookmark: <a href="https://github.com/bbuchfink/diamond" rel="nofollow">https://github.com/bbuchfink/diamond</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32465/tetra-nucleotide-analysis</guid>
	<pubDate>Thu, 04 May 2017 05:07:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32465/tetra-nucleotide-analysis</link>
	<title><![CDATA[Tetra-Nucleotide Analysis]]></title>
	<description><![CDATA[<p>A tetra-nucleotide is a fragment of DNA sequence with 4 bases (e.g. AGTC or TTGG). Pride&nbsp;<em>et al.</em>&nbsp;(2003) showed that the frequency of tetra-nucleotides in bacterial genomes contain useful, albeit weak, phylogenetic signals. Even though tetra-nucleotide analysis (TNA) utilizes the information of whole genome, it is evident that it cannot replace other alignment-based phylogenetic methods such as&nbsp;<a href="https://chunlab.wordpress.com/orthoani/">OrthoANI</a>&nbsp;or&nbsp;16S rRNA phylogeny. However, TNA can be useful for&nbsp;phylogenetic characterization when whole genome or 16S rRNA gene information is not available. For example, a partial genomic fragment obtained from a metagenome can be identified by TNA (Teeling&nbsp;<em>et al.</em>, 2004). TNA is also fast enough that it can be&nbsp;used&nbsp;as a search engine against a large genome database.</p><p>Address of the bookmark: <a href="https://chunlab.wordpress.com/tetra-nucleotide-analysis/" rel="nofollow">https://chunlab.wordpress.com/tetra-nucleotide-analysis/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</guid>
	<pubDate>Mon, 14 May 2018 05:25:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</link>
	<title><![CDATA[GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads]]></title>
	<description><![CDATA[<p><span>This software is provided ``as is&rdquo; without warranty of any kind. In no event shall the author be held responsible for any damage resulting from the use of this software. The program package, including source codes, executables, and this documentation, is distributed free of charge. If you use this program in a publication, please cite the following reference:</span><br><span>Chong Chu, Xin Li, and Yufeng Wu. "GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads." bioRxiv (2017): 125534.</span></p><p>Address of the bookmark: <a href="https://github.com/Reedwarbler/GAPPadder" rel="nofollow">https://github.com/Reedwarbler/GAPPadder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/32587/ten-international-scholarships-for-indian-biotechnology-and-bioinformatics-students</guid>
	<pubDate>Wed, 10 May 2017 04:51:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/32587/ten-international-scholarships-for-indian-biotechnology-and-bioinformatics-students</link>
	<title><![CDATA[Ten International Scholarships for Indian Biotechnology and Bioinformatics Students]]></title>
	<description><![CDATA[<p>Wherever you go around the world, Indian students are in demand. With countries such as Canada and Australia providing huge incentives to Indian students to lure them to their shores, there are many institutions around the world that offer scholarships exclusively to Indian students. Historically these scholarships tend to be aimed towards Masters and PhD programmes however on the rise are scholarships for undergraduate students. Student World Online takes a look at ten international scholarships for Indian undergraduate students abroad.</p><p><br /><span><strong>1.&nbsp;</strong></span><strong><a href="http://admissions.cornell.edu/apply/international-students/tata-scholarship"><span>TATA SCHOLARSHIP</span></a></strong>&nbsp;- Cornell University, New York State, USA<br />Tata, the Indian multinational conglomerate company, have a foundation known as the Tata Education &amp; Development Trust which has&nbsp;<span style="text-decoration: underline;"><a href="http://www.news.cornell.edu/stories/2008/10/tata-trust-gives-50-million-endowment-cornell" target="_blank">endowed a multi million dollar sum to Cornell University</a></span>&nbsp;to provide undergraduate scholarships to 20 Indian students every year. &nbsp;In another example of supporting American universities, the Tata group also pledged US$50 million to Harvard University in recent years, whose executive management programme&nbsp;<span style="text-decoration: underline;"><a href="http://en.wikipedia.org/wiki/Ratan_Tata" target="_blank">Ratan Tata</a></span>&nbsp;attended in the 1970s. &nbsp;<a href="http://admissions.cornell.edu/apply/international-students/tata-scholarship" target="_blank"><span><span style="text-decoration: underline;">Read more...&nbsp;</span></span></a>&nbsp;<br /><br /><strong><span>2.</span></strong>&nbsp;<a href="http://www.uow.edu.au/future/international/apply/scholarships/UOW135799.html" target="_blank"><strong><span>BRADMAN FOUNDATION SCHOLARSHIP</span></strong></a>&nbsp;- University of Wollongong, Australia.<br />Named after Australia's cricket legend&nbsp;<span style="text-decoration: underline;"><a href="http://en.wikipedia.org/wiki/Donald_Bradman" target="_blank">Donald Bradman</a></span>, the&nbsp;<span style="text-decoration: underline;"><a href="https://www.uow.edu.au/content/groups/public/@web/@unia/documents/doc/uow145334.pdf" target="_blank">UOW Bradman Foundation Scholarship</a></span>&nbsp;was launched in 2012, with the help of Adam Gilchrist no less, to offer one successful Indian student each year a 50% reduction in tuition fees. &nbsp;<a href="http://www.uow.edu.au/future/international/apply/scholarships/UOW135799.html" target="_blank"><span><span style="text-decoration: underline;">Read more...</span></span></a>&nbsp;&nbsp;</p><p><span><strong>3.&nbsp;</strong></span><strong><a href="http://www.huaweischolarships.org/about_scholar.aspx" target="_blank"><span>HUAWEI MAITREE SCHOLARSHIPS</span></a></strong>&nbsp;- Various Universities, China<br />Along with Tata, Huawei are the other huge corporation to be featured. &nbsp;China's massive telecoms equipment vendor are involved in these scholarships offered to Indian students studying in China. &nbsp;In 2013 there are 10 generous scholarships available which provide full tuition fees and living expenses. &nbsp;The courses on which the scholarships are offered include Science and Technology courses, Social Sciences and Culture and Development courses. &nbsp;<a href="http://www.huaweischolarships.org/about_scholar.aspx" target="_blank"><span><span style="text-decoration: underline;">Read more...</span></span></a></p><p><span><strong>4.&nbsp;</strong></span><strong><a href="http://www.britishcouncil.in/study-uk/dr-manmohan-singh-scholarships-2013" target="_blank"><span>DR. MANMOHAN SINGH SCHOLARSHIPS</span></a></strong>&nbsp;- Cambridge University, England, UK<br />These scholarships have been designed to help budding Indian minds follow in the footsteps of&nbsp;<span style="text-decoration: underline;"><a href="http://pmindia.nic.in/" target="_blank">Indian prime minister Manmohan Singh</a></span>&nbsp;by studying at the prestigious Cambridge University. &nbsp;The scholarships can be applied to any undergarduate course (with the two exceptions of medicine and veterinary science) and cover everything, i.e. tuition and college fees, living expenses and an additional grant to go towards travel expenses. &nbsp;<a href="http://www.britishcouncil.in/study-uk/dr-manmohan-singh-scholarships-2013" target="_blank"><span><span style="text-decoration: underline;">Read more...</span></span></a><br /><br /><span><strong>5.&nbsp;</strong></span><strong><a href="http://www.oxbridgeindia.com/scholarship.php"><span>OXFORD AND CAMBRIDGE SOCIETY OF INDIA</span></a></strong>&nbsp;- Oxford &amp; Cambridge Universities, England, UK<br />As the name might suggest, these are scholarships available for students wishing to study at Oxford or Cambridge (cleverly known together as&nbsp;<span style="text-decoration: underline;"><a href="http://en.wikipedia.org/wiki/Oxbridge" target="_blank">Oxbridge</a></span>). &nbsp;It is only available for applicants who are completing or have completed a degree at an Indian university, however these scholarships are for both undergraduate and graduate students.&nbsp;&nbsp;<a href="http://www.oxbridgeindia.com/scholarship.php" target="_blank"><span><span style="text-decoration: underline;">Read more...</span></span></a></p><p><span><strong>6.&nbsp;</strong></span><strong><a href="http://www.napier.ac.uk/study/international/funding/Pages/india-scholarships.aspx" target="_blank"><span>EDINBURGH NAPIER UNIVERSITY</span></a></strong>&nbsp;- Scotland, UK<br />This one applies to all countries in the Indian subcontinent and is for both undergraduate and graduate courses. Edinburgh Napier University offers a merit based discount of &pound;2,000 Pounds. &nbsp;<a href="http://www.napier.ac.uk/study/international/funding/Pages/india-scholarships.aspx" target="_blank"><span><span style="text-decoration: underline;">Read more...</span></span></a></p><p><span><strong>7.&nbsp;</strong></span><strong><a href="http://www.sheffield.ac.uk/international/countries/asia/south-asia/india/scholarships" target="_blank"><span>SHEFFIELD UNIVERSITY</span></a></strong>&nbsp;- Sheffield, UK<br />Provides merit-based scholarships for undergraduate and graduate programmes across all subjects<span>.</span>&nbsp;<a href="http://www.sheffield.ac.uk/international/countries/asia/south-asia/india/scholarships" target="_blank"><span><span style="text-decoration: underline;">Read more...</span></span></a><br /><br /><span><strong>8.&nbsp;</strong></span><strong><a href="http://www.india4eu.eu/scholarships" target="_blank"><span>INDIA 4EU II</span></a></strong>&nbsp;- Several Universities across Europe<br />Pioneered by the European Union and involving partner universities in France, Finland, Germany, Italy, Portugal, Spain and Sweden,&nbsp;<span style="text-decoration: underline;"><a href="http://www.india4eu.eu/" target="_blank">the India 4EU II initiative</a></span>&nbsp;is aimed at encouraging Indian students to study, work and live in Europe. &nbsp;The initiative is well funded and allows the successful students tuition fees, expenses for living and travel costs as well as insurance during their time at one of the partner universities. &nbsp;<a href="http://www.india4eu.eu/scholarships" target="_blank"><span><span style="text-decoration: underline;">Read more...</span></span></a><br /><br /><span><strong>9.&nbsp;</strong></span><strong><a href="http://www.tcd.ie/international/Indian%20Scholarship.php" target="_blank"><span>TRINITY COLLEGE DUBLIN</span></a></strong>&nbsp;- Ireland<br />Valid for undergraduate courses in the faculties of Arts, Humanities, Social Sciences, Science, Computer Science or Engineering, the Trinity College Dublin offers Indian students scholarships to the tune of&nbsp;&euro;9,000 per annum over a year degree course. &nbsp;<a href="http://www.tcd.ie/international/Indian%20Scholarship.php" target="_blank"><span><span style="text-decoration: underline;">Read more...</span></span></a><br /><br /><span><strong>10.&nbsp;</strong></span><strong><a href="http://www.indianexpress.com/news/university-college-dublin-announces--euro-250000-scholarship-for-indian-students/1094390/" target="_blank"><span>UNIVERSITY COLLEGE DUBLIN</span></a></strong>&nbsp;- Ireland<br />Another of Ireland and Dublin's finest, the UCD awards one Global Excellence Undergraduate Scholarship which provides the worthy student a substantial 50% towards their tuition fees and is valid for all courses save medicine, radiography and veterinary medicine. &nbsp;UCD also offers a Global Undergraduate Scholarship scheme for undergrads accepted on science, social sciences, arts and business courses. &nbsp;This is all thanks to a &euro;250,000 fund that will allow for 57 Indian students to benefit from scholarships at UCD. &nbsp;<a href="http://www.indianexpress.com/news/university-college-dublin-announces--euro-250000-scholarship-for-indian-students/1094390/"><span><span style="text-decoration: underline;">Read more...</span></span></a></p>]]></description>
	<dc:creator>Priya Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36897/gmcloser-closing-gaps-in-assemblies-accurately-with-a-likelihood-based-selection-of-contig-or-long-read-alignments</guid>
	<pubDate>Mon, 11 Jun 2018 05:43:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36897/gmcloser-closing-gaps-in-assemblies-accurately-with-a-likelihood-based-selection-of-contig-or-long-read-alignments</link>
	<title><![CDATA[GMcloser: closing gaps in assemblies accurately with a likelihood-based selection of contig or long-read alignments]]></title>
	<description><![CDATA[GMcloser uses likelihood-based classifiers calculated from the alignment statistics between scaffolds, contigs and paired-end reads to correctly assign contigs or long reads to gap regions of scaffolds, thereby achieving accurate and efficient gap closure. We demonstrate with sequencing data from various organisms that the gap-closing accuracy of GMcloser is 3–100-fold higher than those of other available tools, with similar efficiency.

https://academic.oup.com/bioinformatics/article/31/23/3733/209212<p>Address of the bookmark: <a href="https://academic.oup.com/bioinformatics/article/31/23/3733/209212" rel="nofollow">https://academic.oup.com/bioinformatics/article/31/23/3733/209212</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38316/simba-a-genome-assembly-project-management-system</guid>
	<pubDate>Thu, 29 Nov 2018 08:52:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38316/simba-a-genome-assembly-project-management-system</link>
	<title><![CDATA[SIMBA: a Genome Assembly Project Management System]]></title>
	<description><![CDATA[<p><span>SIMBA</span><span>, SImple Manager for Bacterial Assemblies, is a Web interface for managing assembly projects of bacterial genomes. SIMBA was created to assist bioinformaticians to assemble bacterial genomes sequenced with NextGeneration Sequencing (NGS) platforms quickly, easily and effectively. SIMBA also is open source tool, i.e., can be freely downloaded, shared and modified.</span></p><p>Address of the bookmark: <a href="http://ufmg-simba.sourceforge.net/" rel="nofollow">http://ufmg-simba.sourceforge.net/</a></p>]]></description>
	<dc:creator>Neel</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>