<?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/38804?offset=170</link>
	<atom:link href="https://bioinformaticsonline.com/related/38804?offset=170" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/42141/dbt-biotechnology-eligibility-test-bet-2020</guid>
	<pubDate>Fri, 21 Aug 2020 09:17:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/42141/dbt-biotechnology-eligibility-test-bet-2020</link>
	<title><![CDATA[DBT BIOTECHNOLOGY ELIGIBILITY TEST (BET) 2020]]></title>
	<description><![CDATA[<p><span>Ministry of Science &amp;Technology, Govt. of India</span></p><p><span>DBT-Junior Research Fellowship (DBT-JRF) in Biotechnology (2020)</span></p><p><span><span>BIOTECHNOLOGY ELIGIBILITY TEST (BET) 2020</span></span></p><p>Applications are invited from bonafide Indian citizens, residing in India for award of &ldquo;DBT-Junior Research Fellowship&rdquo; (DBT-JRF) for pursuing research in frontier areas of Biotechnology and Life Sciences. The candidates will be selected through &ldquo;Biotechnology Eligibility Test (BET)&rdquo;. Based on the performance in BET, two categories of merit list will be prepared (Category-I and Category-II). Government of India norms for reservation will be followed for selection. Candidates selected under category-I will be eligible to avail fellowship under the programme. These will be tenable at any University/Institute in India where the selected candidate registers for PhD Programme. Candidates selected under Category-II will be eligible to be appointed in any DBT sponsored project and avail fellowship from the project equivalent to NET/GATE, subject to selection through institutional selection process. There will be no binding on Principal Investigators of DBT sponsored projects to select JRF for their project from category-II list. Selection in category-II will not entitle student for any fellowship from DBT-JRF programme.</p><p><span>ELIGIBILITY</span></p><p><span>Qualification</span>: M.Sc./ M.Tech./ M.V.Sc. or equivalent degree/ Integrated BS-MS/ B.E./ B.Tech. in any discipline of&nbsp;<a href="https://www.biotecnika.org/category/jobs/biotech-jobs/">Biotechnology</a>, M.Sc./ M.Tech. Bioinformatics/ Computational Biology, students admitted under DBT supported Postgraduate Teaching Programs. M.Sc. Life Science/ Bioscience/ Zoology/ Botany/ Microbiology/ Biochemistry/ Biophysics and Masters in Allied areas of Biology/Life Sciences. Candidates appearing in the final year examination are also eligible to apply.</p><p><span>Marks</span>: Minimum 60% marks for General, EWS &amp; OBC category and 55% for SC/ ST/ Differently abled in aggregate (or equivalent grade).</p><p><span>Age Limit</span>: Upto 28 years as on the last date of application for General &amp; EWS category. Age relaxation of up to 5 years (33 years) for SC/ ST/ Differently Abled/ women candidates and upto 3 years (31 years) for OBC (Non-Creamy Layer) candidates.</p><p>For detailed procedure for filling the application form, payment of application fee and uploading of required documents/ certificates in the prescribed format, please visit:&nbsp;<span><a href="http://rcb.res.in/BET2020" target="_blank">http://rcb.res.in/BET2020</a></span>. A non-refundable and non-transferable application fee of Rs. 1000/-is payable online by General/ OBC/ EWS candidates and Rs 250/- by SC/ ST/ Differently abled candidates.</p><p><span>IMPORTANT DATES</span></p><table width="691">
<tbody>
<tr>
<td>Online Registration Start</td>
<td><span>April 20, 2020</span></td>
</tr>
<tr>
<td>Online Registration Close</td>
<td><span>May 18, 2020</span></td>
</tr>
<tr>
<td>BET 2020</td>
<td><span>June 30, 2020 (Tuesday)* Tentative</span></td>
</tr>
<tr>
<td>Display of question paper and answer key on website</td>
<td><span>June 30, 2020</span></td>
</tr>
<tr>
<td>Last date of accepting representation of any discrepancy in Question paper &amp; Answer key</td>
<td><span>July 03, 2020</span></td>
</tr>
<tr>
<td>Declaration of BET 2020 Result</td>
<td><span>July 20, 2020</span></td>
</tr>
</tbody>
</table>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/42903/katherine-belov-lab</guid>
  <pubDate>Sun, 21 Feb 2021 22:59:35 -0600</pubDate>
  <link></link>
  <title><![CDATA[Katherine Belov Lab]]></title>
  <description><![CDATA[
<p>Evolution of the adaptive immune system Marsupial and monotreme immune genes MHC Diversity and Conservation Marsupial and monotreme genomics Comparative Genomics Genetics of Tasmanian Devil facial tumour disease</p>

<p>More at https://www.sydney.edu.au/science/about/our-people/academic-staff/kathy-belov.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44718/mycology-research-resources-for-bioinformaticians-unlocking-the-fungal-kingdom</guid>
	<pubDate>Fri, 13 Dec 2024 11:21:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44718/mycology-research-resources-for-bioinformaticians-unlocking-the-fungal-kingdom</link>
	<title><![CDATA[Mycology Research Resources for Bioinformaticians: Unlocking the Fungal Kingdom]]></title>
	<description><![CDATA[<p>Mycology, the study of fungi, is a field that bridges ecology, medicine, and biotechnology. With advancements in bioinformatics, researchers now have unprecedented opportunities to explore the fungal kingdom at molecular, genetic, and ecological levels. From understanding pathogenic fungi to harnessing fungal enzymes for industrial applications, the potential is vast.</p><p>To fully leverage these opportunities, bioinformaticians require specialized tools and databases. This blog highlights essential resources for mycology research, focusing on databases, tools, and platforms tailored for fungal biology.</p><h4><strong>1. Fungal Databases</strong></h4><h5><strong>1.1. MycoCosm</strong></h5><p><strong>Website</strong>: <a target="_new">MycoCosm</a><br />Developed by the DOE Joint Genome Institute, MycoCosm is a comprehensive portal for fungal genomics. It offers genomic and transcriptomic data for a wide range of fungi, including saprobes, pathogens, and symbionts.</p><ul>
<li><strong>Key Features</strong>: Genome browsers, comparative genomics tools, and functional annotations.</li>
<li><strong>Best For</strong>: Large-scale studies on fungal evolution and ecology.</li>
</ul><h5><strong>1.2. FungiDB</strong></h5><p><strong>Website</strong>: <a href="https://fungidb.org/" target="_new">FungiDB</a><br />FungiDB is an integrated genomic resource for fungal pathogens and non-pathogens. It provides access to genome sequences, transcriptomic data, and functional annotations.</p><ul>
<li><strong>Key Features</strong>: Advanced search options, BLAST, and pathway analysis tools.</li>
<li><strong>Best For</strong>: Studying fungal pathogenesis and host-pathogen interactions.</li>
</ul><h5><strong>1.3. Index Fungorum</strong></h5><p><strong>Website</strong>: <a href="http://www.indexfungorum.org/" target="_new">Index Fungorum</a><br />This nomenclatural database provides information on the scientific names of fungi. It&rsquo;s an essential resource for taxonomists and researchers focused on fungal biodiversity.</p><ul>
<li><strong>Key Features</strong>: Taxonomic hierarchy and synonymy tracking.</li>
<li><strong>Best For</strong>: Identifying and classifying fungal species.</li>
</ul><h5><strong>1.4. UNITE</strong></h5><p><strong>Website</strong>: <a target="_new">UNITE</a><br />UNITE is a specialized database for fungal ITS (Internal Transcribed Spacer) sequences, often used in fungal identification and phylogenetics.</p><ul>
<li><strong>Key Features</strong>: Curated reference datasets and community annotations.</li>
<li><strong>Best For</strong>: Environmental mycology and microbial ecology studies.</li>
</ul><h4><strong>2. Analytical Tools</strong></h4><h5><strong>2.1. Funannotate</strong></h5><p><strong>Repository</strong>: <a href="https://github.com/nextgenusfs/funannotate" target="_new">GitHub - Funannotate</a><br />Funannotate is a genome annotation tool designed for fungi. It supports tasks like gene prediction, functional annotation, and orthology analysis.</p><ul>
<li><strong>Best For</strong>: Annotating newly sequenced fungal genomes.</li>
</ul><h5><strong>2.2. BUSCO (Benchmarking Universal Single-Copy Orthologs)</strong></h5><p><strong>Website</strong>: <a target="_new">BUSCO</a><br />BUSCO evaluates genome assembly and annotation completeness using orthologs. It includes a fungal-specific dataset.</p><ul>
<li><strong>Best For</strong>: Assessing the quality of fungal genome assemblies.</li>
</ul><h5><strong>2.3. Pathogen-Host Interactions Database (PHI-base)</strong></h5><p><strong>Website</strong>: <a href="http://www.phi-base.org/" target="_new">PHI-base</a><br />PHI-base is a manually curated resource containing information on pathogen-host interactions, including fungal pathogens.</p><ul>
<li><strong>Best For</strong>: Exploring virulence factors and host-pathogen relationships.</li>
</ul><h4><strong>3. Visualization Platforms</strong></h4><h5><strong>3.1. Cytoscape</strong></h5><p><strong>Website</strong>: <a href="https://cytoscape.org/" target="_new">Cytoscape</a><br />A powerful tool for visualizing molecular interaction networks, Cytoscape can be used to study protein-protein interactions, gene networks, and metabolic pathways in fungi.</p><ul>
<li><strong>Best For</strong>: Network biology and functional genomics.</li>
</ul><h5><strong>3.2. iTOL (Interactive Tree of Life)</strong></h5><p><strong>Website</strong>: <a target="_new">iTOL</a><br />iTOL is an interactive tool for visualizing phylogenetic trees.</p><ul>
<li><strong>Best For</strong>: Displaying fungal phylogenies and comparing evolutionary relationships.</li>
</ul><h4><strong>4. Community Resources</strong></h4><h5><strong>4.1. Mycological Society of America (MSA)</strong></h5><p><strong>Website</strong>: <a href="https://msafungi.org/" target="_new">MSA</a><br />The MSA promotes fungal research and provides access to resources, conferences, and publications.</p><ul>
<li><strong>Best For</strong>: Networking with fungal researchers and accessing recent studies.</li>
</ul><h5><strong>4.2. OpenFungi</strong></h5><p><strong>Website</strong>: <a href="https://openfungi.org/" target="_new">OpenFungi</a><br />OpenFungi is an open-source initiative providing fungal genomic and transcriptomic datasets for research and education.</p><ul>
<li><strong>Best For</strong>: Sharing and accessing public fungal datasets.</li>
</ul><h4><strong>5. Genomics Workflows</strong></h4><h5><strong>5.1. Galaxy</strong></h5><p><strong>Website</strong>: <a href="https://usegalaxy.org/" target="_new">Galaxy Project</a><br />Galaxy offers a web-based platform for reproducible bioinformatics workflows, including tools for fungal genome and transcriptome analysis.</p><ul>
<li><strong>Best For</strong>: User-friendly analysis pipelines without requiring coding skills.</li>
</ul><h5><strong>5.2. Snakemake</strong></h5><p><strong>Repository</strong>: <a target="_new">Snakemake</a><br />A flexible pipeline management tool that supports fungal data processing and analysis.</p><ul>
<li><strong>Best For</strong>: Custom workflows for large-scale fungal datasets.</li>
</ul><h4><strong>Conclusion</strong></h4><p>Fungal research is a rapidly growing field with vast implications for medicine, agriculture, and industry. For bioinformaticians, the availability of specialized resources&mdash;databases, tools, and community platforms&mdash;opens doors to innovative discoveries. Whether you are investigating fungal genomics, studying host-pathogen interactions, or exploring fungal biodiversity, the resources outlined above will empower your research journey.</p><p>Dive into these resources and help unravel the mysteries of the fungal kingdom!</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/45140/integration-of-speciation-research-workshop-announcement</guid>
  <pubDate>Tue, 28 Apr 2026 07:07:57 -0500</pubDate>
  <link></link>
  <title><![CDATA[Integration Of Speciation Research : Workshop Announcement]]></title>
  <description><![CDATA[
<p>We are excited to share that the ESEB- funded special topic network Integration Of Speciation Research (IOS - https://speciation-network.pages.ist.ac.at/) is hosting a second in-person workshop from 7â€“11 December 2026 at the Scottish Centre for Ecology &amp; the Natural Environment (Glasgow, UK - https://www.gla.ac.uk/research/az/scene/).</p>

<p>This workshop is aimed at bringing together ~40 diverse speciation researchers:</p>

<p>-  to collaborate on populating a database of published reproductive barriers based on a standardized RIO framework (https://ecoevorxiv.org/repository/view/10083/). This will involve working through papers during the workshop to extract RI measures and other metadata and entering them into a draft database (some preparatory work before the workshop may be requested to facilitate these steps during the workshop)</p>

<p>- to start working towards a manuscript using this database to answer an outstanding question in speciation</p>

<p>- to network, learn about reproductive isolation, and have fun!</p>

<p>If you are interested in applying to participate in the workshop, please fill out the form in the link below by ** May 20th **. Room &amp; board will be covered by the organizers; all other travel costs are the responsibility of the attendee.</p>

<p>Application link:</p>

<p>https://docs.google.com/forms/d/e/1FAIpQLSenAMqSdZjeRmKEDtBNa5tpjPn7IukPyT5BzfZ4JMpIk2YOEw/viewform</p>

<p>The previous IOS workshop was held in Finland in 2023 (see more details at https://speciation-network.pages.ist.ac.at/workshops) and resulted in new interactions between speciation researchers and the successful publication of an Integration of Speciation research manuscript  (https://academic.oup.com/evolinnean/article/3/1/kzae001/7609448).</p>

<p>We look forward to seeing you in Glasgow!</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40832/biocoder-newsletter-of-that-revolution-it%E2%80%99s-about-biology-as-it-moves-from-research-labs-into-startup-incubators-hacker-spaces-and-even-homes</guid>
	<pubDate>Sun, 02 Feb 2020 07:43:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40832/biocoder-newsletter-of-that-revolution-it%E2%80%99s-about-biology-as-it-moves-from-research-labs-into-startup-incubators-hacker-spaces-and-even-homes</link>
	<title><![CDATA[BioCoder : newsletter of that revolution. It’s about biology as it moves from research labs into startup incubators, hacker spaces, and even homes]]></title>
	<description><![CDATA[<div>
<h3>BioCoder features:</h3>
<ul>
<li>Novel therapeutic discovery strategies</li>
<li>Hardware such as low-cost lab equipment or diagnostics</li>
<li>Open or low&shy;-cost bioinformatics tools</li>
<li>Engineered organisms for the production of small molecules, biologics, or other products</li>
<li>Research projects at a community labspace or projects for science education or public engagement</li>
<li>Hardware or software for lab automation</li>
<li>Citizen science or DIY research projects</li>
<li>Science policy</li>
<li>Tools to increase reproducibility in research, or anything related</li>
</ul>
</div><p>Address of the bookmark: <a href="https://www.oreilly.com/biocoder/" rel="nofollow">https://www.oreilly.com/biocoder/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/42023/encode3-a-collection-of-research-articles-and-related-content-describing-the-encyclopedia-of-dna-elements-its-datasets-and-tools</guid>
	<pubDate>Sat, 08 Aug 2020 08:25:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/42023/encode3-a-collection-of-research-articles-and-related-content-describing-the-encyclopedia-of-dna-elements-its-datasets-and-tools</link>
	<title><![CDATA[ENCODE3: A collection of research articles and related content describing the Encyclopedia of DNA Elements, its datasets and tools.]]></title>
	<description><![CDATA[<p>How cells, tissues and organisms interpret the information encoded in the genome has vital implications for our understanding of development, health and disease. Launched in 2003, the ENCyclopedia Of DNA Elements (ENCODE) project has the aim of mapping the functional elements in the human genome (later expanded to include model organisms).</p><p>During the first phase of ENCODE, published in 2007, microarray-based technologies were used to detect regions associated with transcription factors, certain histone modifications and open chromatin within a pre-specified 1% of the human genome.</p><p>ENCODE&rsquo;s second phase saw a switch to sequencing-based technologies, the addition of new assay types and the analysis of functional elements genome-wide, described in a collection of research articles in 2012.</p><p><span>The&nbsp;</span><a href="https://www.nature.com/articles/s41586-020-2493-4">Encyclopedia paper of ENCODE 3</a><span>, published in&nbsp;</span><em>Nature</em><span>, gives an overview of the various assays that were performed in human and mouse cell lines and tissues and describes a Registry of human and mouse candidate&nbsp;</span><em>cis</em><span>-regulatory elements (cCREs).</span></p><p>More at&nbsp;<a href="https://www.nature.com/immersive/d42859-020-00027-2/index.html">https://www.nature.com/immersive/d42859-020-00027-2/index.html</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/44400/pevzner-lab</guid>
  <pubDate>Thu, 02 Nov 2023 05:39:26 -0500</pubDate>
  <link></link>
  <title><![CDATA[Pevzner Lab !]]></title>
  <description><![CDATA[
<p>The laboratory works on genome sequencing, immunoproteogenomics, antibiotics sequencing, and comparative genomics - computational technologies that enabled new applications and allowed scientists to attack biological problems that remained beyond the reach of previous techniques.</p>

<p>https://bioalgorithms.ucsd.edu/research4.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34246/unicycler-hybrid-assembly-pipeline-for-bacterial-genomes</guid>
	<pubDate>Fri, 10 Nov 2017 03:58:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34246/unicycler-hybrid-assembly-pipeline-for-bacterial-genomes</link>
	<title><![CDATA[Unicycler: Hybrid assembly pipeline for bacterial genomes]]></title>
	<description><![CDATA[<p><span>Unicycler is an assembly pipeline for bacterial genomes. It can assemble&nbsp;</span><a href="http://www.illumina.com/">Illumina</a><span>-only read sets where it functions as a&nbsp;</span><a href="http://cab.spbu.ru/software/spades/">SPAdes</a><span>-optimiser. It can also assembly long-read-only sets (</span><a href="http://www.pacb.com/">PacBio</a><span>&nbsp;or&nbsp;</span><a href="https://nanoporetech.com/">Nanopore</a><span>) where it runs a&nbsp;</span><a href="https://github.com/lh3/miniasm">miniasm</a><span>+</span><a href="https://github.com/isovic/racon">Racon</a><span>&nbsp;pipeline. For the best possible assemblies, give it both Illumina reads&nbsp;</span><em>and</em><span>&nbsp;long reads, and it will conduct a hybrid assembly.</span></p><p>Address of the bookmark: <a href="https://github.com/rrwick/Unicycler" rel="nofollow">https://github.com/rrwick/Unicycler</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34418/spades-hybrid-genome-assembly</guid>
	<pubDate>Mon, 27 Nov 2017 08:05:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34418/spades-hybrid-genome-assembly</link>
	<title><![CDATA[SPAdes hybrid genome assembly]]></title>
	<description><![CDATA[<p>When you have both Illumina and Nanopore data, then SPAdes remains a good option for hybrid assembly - SPAdes was used to produce the&nbsp;<a href="https://gigascience.biomedcentral.com/articles/10.1186/s13742-015-0101-6">B fragilis assembly</a>&nbsp;by Mick Watson&rsquo;s group.</p><p>Again, running spades.py will show you the options:</p><div><pre><code>spades.py
</code></pre></div><p>This produces:</p><div><pre><code>SPAdes genome assembler v3.10.1

Usage: /usr/local/SPAdes-3.10.1-Linux/bin/spades.py [options] -o &lt;output_dir&gt;

Basic options:
-o      &lt;output_dir&gt;    directory to store all the resulting files (required)
--sc                    this flag is required for MDA (single-cell) data
--meta                  this flag is required for metagenomic sample data
--rna                   this flag is required for RNA-Seq data
--plasmid               runs plasmidSPAdes pipeline for plasmid detection
--iontorrent            this flag is required for IonTorrent data
--test                  runs SPAdes on toy dataset
-h/--help               prints this usage message
-v/--version            prints version

Input data:
--12    &lt;filename&gt;      file with interlaced forward and reverse paired-end reads
-1      &lt;filename&gt;      file with forward paired-end reads
-2      &lt;filename&gt;      file with reverse paired-end reads
-s      &lt;filename&gt;      file with unpaired reads
--pe&lt;#&gt;-12      &lt;filename&gt;      file with interlaced reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-1       &lt;filename&gt;      file with forward reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-2       &lt;filename&gt;      file with reverse reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-s       &lt;filename&gt;      file with unpaired reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--pe&lt;#&gt;-&lt;or&gt;    orientation of reads for paired-end library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--s&lt;#&gt;          &lt;filename&gt;      file with unpaired reads for single reads library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-12      &lt;filename&gt;      file with interlaced reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-1       &lt;filename&gt;      file with forward reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-2       &lt;filename&gt;      file with reverse reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-s       &lt;filename&gt;      file with unpaired reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--mp&lt;#&gt;-&lt;or&gt;    orientation of reads for mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--hqmp&lt;#&gt;-12    &lt;filename&gt;      file with interlaced reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-1     &lt;filename&gt;      file with forward reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-2     &lt;filename&gt;      file with reverse reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-s     &lt;filename&gt;      file with unpaired reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--hqmp&lt;#&gt;-&lt;or&gt;  orientation of reads for high-quality mate-pair library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9; &lt;or&gt; = fr, rf, ff)
--nxmate&lt;#&gt;-1   &lt;filename&gt;      file with forward reads for Lucigen NxMate library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--nxmate&lt;#&gt;-2   &lt;filename&gt;      file with reverse reads for Lucigen NxMate library number &lt;#&gt; (&lt;#&gt; = 1,2,..,9)
--sanger        &lt;filename&gt;      file with Sanger reads
--pacbio        &lt;filename&gt;      file with PacBio reads
--nanopore      &lt;filename&gt;      file with Nanopore reads
--tslr  &lt;filename&gt;      file with TSLR-contigs
--trusted-contigs       &lt;filename&gt;      file with trusted contigs
--untrusted-contigs     &lt;filename&gt;      file with untrusted contigs

Pipeline options:
--only-error-correction runs only read error correction (without assembling)
--only-assembler        runs only assembling (without read error correction)
--careful               tries to reduce number of mismatches and short indels
--continue              continue run from the last available check-point
--restart-from  &lt;cp&gt;    restart run with updated options and from the specified check-point ('ec', 'as', 'k&lt;int&gt;', 'mc')
--disable-gzip-output   forces error correction not to compress the corrected reads
--disable-rr            disables repeat resolution stage of assembling

Advanced options:
--dataset       &lt;filename&gt;      file with dataset description in YAML format
-t/--threads    &lt;int&gt;           number of threads
                                [default: 16]
-m/--memory     &lt;int&gt;           RAM limit for SPAdes in Gb (terminates if exceeded)
                                [default: 250]
--tmp-dir       &lt;dirname&gt;       directory for temporary files
                                [default: &lt;output_dir&gt;/tmp]
-k              &lt;int,int,...&gt;   comma-separated list of k-mer sizes (must be odd and
                                less than 128) [default: 'auto']
--cov-cutoff    &lt;float&gt;         coverage cutoff value (a positive float number, or 'auto', or 'off') [default: 'off']
--phred-offset  &lt;33 or 64&gt;      PHRED quality offset in the input reads (33 or 64)
                                [default: auto-detect]
</code></pre></div><p>As you can see this is also a &ldquo;pipeline&rdquo; of tools that can be switched on or off. SPAdes takes quite a long time, so for the purposes of this practical, something like this may suffice:</p><div><pre><code>spades.py -t 4 <span>\</span>
          -m 32 <span>\</span>
          -k 31,51,71 <span>\</span>
          --only-assembler <span>\</span>
          -1 miseq.1.fastq -2 miseq.2.fastq <span>\</span>
          --nanopore minion.fastq <span>\</span>
          -o hybrid_assembly
</code></pre></div><p>In turn, these parameters mean</p><ul>
<li>use 4 threads</li>
<li>max memory is 32Gb</li>
<li>use 3 kmer values to build the de bruijn graph(s) - 31, 51 and 71</li>
<li>only run the assembler, not the correction algorithm (for speed)</li>
<li>read 1 and read 2 of the MiSeq data</li>
<li>the nanopore data</li>
<li>put the output in folder &ldquo;hybrid_assembly&rdquo;</li>
</ul>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/34707/string-graph-based-genome-assembly-software-and-tools</guid>
	<pubDate>Tue, 19 Dec 2017 17:17:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/34707/string-graph-based-genome-assembly-software-and-tools</link>
	<title><![CDATA[String graph based genome assembly software and tools !]]></title>
	<description><![CDATA[<p>In&nbsp;<a href="https://en.wikipedia.org/wiki/Graph_theory" title="Graph theory">graph theory</a>, a&nbsp;<strong>string graph</strong>&nbsp;is an&nbsp;<a href="https://en.wikipedia.org/wiki/Intersection_graph" title="Intersection graph">intersection graph</a>&nbsp;of&nbsp;<a href="https://en.wikipedia.org/wiki/Curve" title="Curve">curves</a>&nbsp;in the plane; each curve is called a "string".&nbsp; String graphs were first proposed by E. W. Myers in a&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/21/suppl_2/ii79.full.pdf+html">2005 publication</a>.&nbsp;In&nbsp;recent&nbsp;<a href="http://genome.cshlp.org/content/early/2012/01/22/gr.126953.111">Genome Research paper</a>&nbsp;describing an innovative approach for assembling large genomes from NGS data caught our attention for several reasons. i) it give different "string graph" prospective of long lasting genome assembly problem ii) the&nbsp;paper is coauthored by Jared Simpson, the developer of&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2694472/">ABySS assembler</a>&nbsp;and Richard Durbin. iii)&nbsp;Simpson-Durbin algorithm is that it does not rely on de Bruijn graphs, and instead employs a different graph construction approach called &lsquo;string graph&rsquo;.</p><p>Following are the genome assembly tools based on string graph:</p><p>1.SGA (String Graph Assembler)&nbsp;https://github.com/jts/sga</p><p>Assembles large genomes from high coverage short read data. SGA is designed as a modular set of programs, which are used to form an assembly pipeline. SGA implements a set of assembly algorithms based on the FM-index. As the FM-index is a compressed data structure, the algorithms are very memory efficient. The SGA assembly has three distinct phases. The first phase corrects base calling errors in the reads. The second phase assembles contigs from the corrected reads. The third phase uses paired end and/or mate pair data to build scaffolds from the contigs. The output of this software is a PDF report that allows the properties of the genome and data quality to be visually explored. By providing more information to the user at the start of an assembly project, this software will help increase awareness of the factors that make a given assembly easy or difficult, assist in the selection of software and parameters and help to troubleshoot an assembly if it runs into problems.</p><p>2.&nbsp;SAGE: String-overlap Assembly of GEnomes&nbsp;https://github.com/lucian-ilie/SAGE2</p><p>SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers.</p><p>3. FSG: Fast String Graph</p><p>The new integrated assembler has been assessed on a standard benchmark, showing that fast string graph (FSG) is significantly faster than SGA while maintaining a moderate use of main memory, and showing practical advantages in running FSG on multiple threads. Moreover, we have studied the effect of coverage rates on the running times.</p><p>4.&nbsp;&nbsp;BASE&nbsp;https://github.com/dhlbh/BASE</p><p>It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.&nbsp;BASE is a practically efficient tool for constructing contig, with significant improvement in quality for long NGS reads. It is relatively easy to extend BASE to include scaffolding.</p><p>5.&nbsp;Fermi&nbsp;https://github.com/lh3/fermi/</p><p>Fermi is a de novo assembler with a particular focus on assembling Illumina&nbsp;short sequence reads from a mammal-sized genome. In addition to the role of a&nbsp;typical assembler, fermi also aims to preserve heterozygotes which are often&nbsp;collapsed by other assemblers. Its ultimate goal is to find a minimal set of&nbsp;unitigs to represent all the information in raw reads.</p><p>If you want to learn about String Graph assembler, please read the following papers -</p><p>i)&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/21/suppl_2/ii79.full.pdf+html">The Fragment Assembly String Graph - E. W. Myers</a></p><p>This paper describes the String Graph concept.</p><p>ii)&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/26/12/i367.full#ref-20">Efficient construction of an assembly string graph using the FM-index - Jared T. Simpson and Richard Durbin</a></p><p>This earlier paper from Simpson and Durbin</p><p>iii)&nbsp;<a href="http://genome.cshlp.org/content/early/2012/01/22/gr.126953.111">Efficient de novo assembly of large genomes using compressed data structures - Jared T. Simpson and Richard Durbin</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>