<?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=90</link>
	<atom:link href="https://bioinformaticsonline.com/related/38804?offset=90" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/43788/fulbright-kalam-postdoctoral-research-scholarships-for-indians</guid>
  <pubDate>Tue, 15 Feb 2022 04:27:22 -0600</pubDate>
  <link></link>
  <title><![CDATA[Fulbright-Kalam Postdoctoral Research Scholarships for Indians]]></title>
  <description><![CDATA[
<p>These fellowships are designed for Indian faculty and researchers who are in the early stages of their research careers in India. Fulbright-Kalam Climate Fellowships will provide opportunities to talented faculty and researchers to strengthen their research capacities. Postdoctoral fellows will have access to some of the finest resources in their areas of interest and will help build long-term collaborative relationships with U.S. faculty and institutions. These fellowships are for eight to 24 months.</p>

<p>Affiliation<br />The selected candidate will be affiliated to one U.S. host institution.</p>

<p>USIEF strongly recommends all applicants to identify institutions with which they wish to be affiliated, and to correspond, in advance, with potential host institutions. If the applicant has secured a letter of invitation from a U.S. institution, it should be included as a part of the online application. The letter of invitation should indicate the duration of visit, preferably with dates.</p>

<p>Grant Benefits</p>

<p>These fellowships provide J-1 visa support, a monthly stipend, Accident and Sickness Program for Exchanges per U.S. Government guidelines, round-trip economy class air travel between India and the U.S., a modest settling-in allowance, and a professional allowance.</p>

<p>Subject to availability of funds, a dependent allowance and international travel may be provided for one accompanying eligible dependent provided the dependent is with the grantee in the U.S. for at least 80 per cent of the grant period. Flex grantees are not eligible for dependent benefits.</p>

<p>Eligibility Requirements</p>

<p>In addition to the General Prerequisites:</p>

<p>Applicants must have a Ph.D. degree within the past four years. S/he must have obtained a Ph.D. degree between September 15, 2018 and September 14, 2022. The applicants are required to upload his/her Ph.D. degree certificate/provisional Ph.D. certificate on the online application;<br />Applicants must have a publication in reputed journals and demonstrate evidence of superior academic and professional achievement. S/he must upload a recent significant publication (copy of paper/article) on the online application (not exceeding 30 pages); and<br />If applicant is employed, please follow the instructions carefully regarding employer’s endorsement. If applicable, obtain the endorsement from the appropriate administrative authority on the Letter of Support from Home Institution. The employer must indicate that leave will be granted for the fellowship period. The applicant can download the Letter of Support from Home Institution from the USIEF website. Candidates working under government-funded projects are also required to get endorsement from their affiliating institutions in India.</p>

<p>How to Apply</p>

<p>Applications must be submitted online at: https://apply.iie.org/fvsp2023/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44760/the-future-of-bioinformatics-innovations-and-opportunities</guid>
	<pubDate>Mon, 20 Jan 2025 12:44:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44760/the-future-of-bioinformatics-innovations-and-opportunities</link>
	<title><![CDATA[The Future of Bioinformatics: Innovations and Opportunities]]></title>
	<description><![CDATA[<p>Bioinformatics, the interdisciplinary field that merges biology, computer science, and statistics, has transformed the way we understand biological systems. As we stand at the cusp of a new era in scientific discovery, the future of bioinformatics promises even greater advancements, powered by cutting-edge technologies and a growing understanding of life&rsquo;s complexities.</p><h4>1. Big Data and Bioinformatics</h4><p>The exponential growth in biological data, driven by advancements in sequencing technologies and high-throughput experiments, has made bioinformatics an indispensable tool. By 2030, we anticipate:</p><ul>
<li>
<p><strong>Petabyte-Scale Data Management</strong>: Enhanced storage solutions and cloud computing platforms will allow researchers to handle the vast amounts of data generated from omics studies, including genomics, transcriptomics, and proteomics.</p>
</li>
<li>
<p><strong>AI and Machine Learning Integration</strong>: Sophisticated algorithms will uncover patterns and relationships in large datasets, enabling predictions about gene function, disease susceptibility, and therapeutic outcomes.</p>
</li>
</ul><h4>2. Personalized Medicine and Genomics</h4><p>Bioinformatics will play a pivotal role in tailoring healthcare to individual patients. Key developments include:</p><ul>
<li>
<p><strong>Whole-Genome Sequencing in Clinics</strong>: The decreasing cost of sequencing will make it routine in medical diagnostics, enabling personalized treatment plans based on an individual&rsquo;s genetic makeup.</p>
</li>
<li>
<p><strong>Drug Repurposing and Development</strong>: Computational tools will identify potential new uses for existing drugs, accelerating the development of targeted therapies.</p>
</li>
</ul><h4>3. Advancing Computational Tools</h4><p>The future will see the development of more user-friendly and powerful bioinformatics tools:</p><ul>
<li>
<p><strong>Graph-Based Approaches</strong>: Enhanced algorithms for analyzing complex biological networks, such as protein-protein interaction maps.</p>
</li>
<li>
<p><strong>Visualization Tools</strong>: Intuitive software for visualizing multi-dimensional data, enabling researchers to interpret findings more effectively.</p>
</li>
</ul><h4>4. Synthetic Biology and Systems Biology</h4><p>Bioinformatics will continue to drive progress in synthetic and systems biology by:</p><ul>
<li>
<p><strong>Gene Circuit Design</strong>: Leveraging computational models to design and simulate synthetic biological systems.</p>
</li>
<li>
<p><strong>Understanding Cellular Pathways</strong>: Integrating multi-omics data to model cellular processes with unprecedented accuracy.</p>
</li>
</ul><h4>5. Bioinformatics in Agriculture and Environmental Science</h4><p>Beyond healthcare, bioinformatics will revolutionize agriculture and environmental conservation:</p><ul>
<li>
<p><strong>Crop Improvement</strong>: Genomic studies will help develop high-yield, disease-resistant, and climate-resilient crops.</p>
</li>
<li>
<p><strong>Microbial Ecology</strong>: Metagenomics will enhance our understanding of microbial communities, aiding in bioremediation and ecosystem management.</p>
</li>
</ul><h4>6. Democratization of Bioinformatics</h4><p>Open-source software and accessible education will broaden participation in bioinformatics research:</p><ul>
<li>
<p><strong>Community-Driven Projects</strong>: Collaborative platforms like GitHub will continue to foster innovation in tool development.</p>
</li>
<li>
<p><strong>Education and Training</strong>: Online courses and workshops will bridge skill gaps, enabling researchers from diverse backgrounds to contribute.</p>
</li>
</ul><h4>Challenges and Ethical Considerations</h4><p>While the future is bright, challenges remain. Data privacy and ethical concerns surrounding genetic information require careful navigation. Furthermore, addressing the digital divide is critical to ensuring equitable access to bioinformatics resources globally.</p><h4>Conclusion</h4><p>The future of bioinformatics is boundless, with opportunities to revolutionize our understanding of life and improve human health. As technologies evolve and collaborations flourish, bioinformatics will undoubtedly remain at the forefront of scientific discovery, unlocking the secrets of life one dataset at a time.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/39472/louisiana-biomedical-research-network-summer-bioinformatics-training-program</guid>
	<pubDate>Wed, 05 Jun 2019 15:30:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/39472/louisiana-biomedical-research-network-summer-bioinformatics-training-program</link>
	<title><![CDATA[Louisiana Biomedical Research Network: Summer Bioinformatics Training Program]]></title>
	<description><![CDATA[<p><img src="https://edu.t-bio.info/wp-content/uploads/2019/06/LBRN-Summer-Program1-CCT.jpg" alt="2019 summer bioinformatics training program" width="600" height="337.5" style="border: 0px;"></p><p>Louisiana Biomedical Research Network (LBRN) announces registration for it's Summer 2019 Bioinformatics Training Program. The program will be focused on processing, analysis and interpretation of next generation sequecning data for biologists. Learn more:</p><p>https://edu.t-bio.info/louisiana-biomedical-research-network-summer-2019-lbrn-bioinformatics-training-program/</p>]]></description>
	<dc:creator>eliabrodsky</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40959/bioinformatics-related-group</guid>
	<pubDate>Sun, 09 Feb 2020 03:17:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40959/bioinformatics-related-group</link>
	<title><![CDATA[Bioinformatics related group]]></title>
	<description><![CDATA[<p>FaBI emerged from the respective groups of the four founding societies GI (German Informatics Society), DECHEMA (Society for Chemical Engineering and Biotechnology), GBM (Society for Biochemistry and Molecular Biology) and GDCh (German Chemical Society). In fall 2015, the GMDS (German Society for Medical Informatics, Biometry, and Epidemiology) joined FaBI. FaBI represents more than 750 members today and considers itself as a joint representation of interests of bioinformatics research in Germany and as an interlocutor for politics, economy, and society aiming at a strong informatics-based life science research.</p><p>Address of the bookmark: <a href="https://bioinformatik.de/en/bioinformatics-in-germany/research/research-groups.html" rel="nofollow">https://bioinformatik.de/en/bioinformatics-in-germany/research/research-groups.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44299/research-rabbit</guid>
	<pubDate>Fri, 07 Apr 2023 12:01:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44299/research-rabbit</link>
	<title><![CDATA[Research Rabbit]]></title>
	<description><![CDATA[<p>You&rsquo;re determined students, passionate teachers, and inspired creators of everything we know!<span> </span>Yet, all the researchers we spoke with over the past year uncovered the same reality:</p>
<p>Despite the degrees you&rsquo;ve earned, the effort and passion you put in every day, the sacrifices you make &ndash; academia burdens you with tons of stressors. Financial, psychological, physical, and more.</p>
<p>We&rsquo;re an unconventional team with backgrounds in various fields &ndash; both inside and outside of academia. And through our lens, it&rsquo;s clear that academia deeply undervalues and underserves its very own community!<span> </span></p>
<p>It&rsquo;s time to reimagine research.</p><p>Address of the bookmark: <a href="https://researchrabbitapp.com/" rel="nofollow">https://researchrabbitapp.com/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</guid>
	<pubDate>Mon, 10 Jul 2017 05:56:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</link>
	<title><![CDATA[Omega2: metagenome assembly pipeline]]></title>
	<description><![CDATA[<p><span>Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming short branches. Unitigs were generated based on minimum cost flow analysis of the overlap graph and then merged to contigs and scaffolds using mate-pair information. In comparison with three de Bruijn graph assemblers (SOAPdenovo, IDBA-UD and MetaVelvet), Omega provided comparable overall performance on a HiSeq 100-bp dataset and superior performance on a MiSeq 300-bp dataset. In comparison with Celera on the MiSeq dataset, Omega provided more continuous assemblies overall using a fraction of the computing time of existing overlap-layout-consensus assemblers. This indicates Omega can more efficiently assemble longer Illumina reads, and at deeper coverage, for metagenomic datasets.</span></p><p>Address of the bookmark: <a href="http://omega.omicsbio.org/" rel="nofollow">http://omega.omicsbio.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34416/miniasm-very-fast-olc-based-de-novo-assembler-for-noisy-long-reads</guid>
	<pubDate>Mon, 27 Nov 2017 07:58:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34416/miniasm-very-fast-olc-based-de-novo-assembler-for-noisy-long-reads</link>
	<title><![CDATA[miniasm: very fast OLC-based de novo assembler for noisy long reads]]></title>
	<description><![CDATA[<p>Miniasm is a very fast OLC-based&nbsp;<em>de novo</em>&nbsp;assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>) as input and outputs an assembly graph in the&nbsp;<a href="https://github.com/pmelsted/GFA-spec/blob/master/GFA-spec.md">GFA</a>&nbsp;format. Different from mainstream assemblers, miniasm does not have a consensus step. It simply concatenates pieces of read sequences to generate the final&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php/Celera_Assembler_Terminology">unitig</a>&nbsp;sequences. Thus the per-base error rate is similar to the raw input reads.</p>
<p>So far miniasm is in early development stage. It has only been tested on a dozen of PacBio and Oxford Nanopore (ONT) bacterial data sets. Including the mapping step, it takes about 3 minutes to assemble a bacterial genome. Under the default setting, miniasm assembles 9 out of 12 PacBio datasets and 3 out of 4 ONT datasets into a single contig. The 12 PacBio data sets are&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/E.-coli-Bacterial-Assembly">PacBio E. coli sample</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS473430">ERS473430</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS544009">ERS544009</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS554120">ERS554120</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS605484">ERS605484</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS617393">ERS617393</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS646601">ERS646601</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS659581">ERS659581</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS670327">ERS670327</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS685285">ERS685285</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS743109">ERS743109</a>&nbsp;and a&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/E.-coli-20kb-Size-Selected-Library-with-P6-C4/ce0533c1d2a957488594f0b29da61ffa3e4627e8">deprecated PacBio E. coli data set</a>. ONT data are acquired from the&nbsp;<a href="http://lab.loman.net/2015/09/24/first-sqk-map-006-experiment/">Loman Lab</a>.</p>
<p>For a&nbsp;<em>C. elegans</em>&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/C.-elegans-data-set">PacBio data set</a>&nbsp;(only 40X are used, not the whole dataset), miniasm finishes the assembly, including reads overlapping, in ~10 minutes with 16 CPUs. The total assembly size is 105Mb; the N50 is 1.94Mb. In comparison, the&nbsp;<a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/HGAP">HGAP3</a>produces a 104Mb assembly with N50 1.61Mb.&nbsp;<a href="http://lh3lh3.users.sourceforge.net/download/ce-miniasm.png">This dotter plot</a>&nbsp;gives a global view of the miniasm assembly (on the X axis) and the HGAP3 assembly (on Y). They are broadly comparable. Of course, the HGAP3 consensus sequences are much more accurate. In addition, on the whole data set (assembled in ~30 min), the miniasm N50 is reduced to 1.79Mb. Miniasm still needs improvements.</p>
<p>Miniasm confirms that at least for high-coverage bacterial genomes, it is possible to generate long contigs from raw PacBio or ONT reads without error correction. It also shows that&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>&nbsp;can be used as a read overlapper, even though it is probably not as sensitive as the more sophisticated overlapers such as&nbsp;<a href="https://github.com/marbl/MHAP">MHAP</a>&nbsp;and&nbsp;<a href="https://github.com/thegenemyers/DALIGNER">DALIGNER</a>. Coupled with long-read error correctors and consensus tools, miniasm may also be useful to produce high-quality assemblies.</p>
<p>Minimap and miniasm are ultrafast tools for (i) mapping and (ii) assembly. Designed for long, noisy reads, they do not have a correction or consensus step, and therefore the resulting assemblies are contiguous (i.e. long) but very noisy (i.e. full of errors)</p>
<p>We start with an all against all comparison:</p>
<div>
<pre><code>minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq | gzip -1 &gt; reads.paf.gz
</code></pre>
</div>
<p>Then we can assemble</p>
<div>
<pre><code>miniasm -f reads.fq reads.paf.gz &gt; reads.gfa
</code></pre>
</div>
<p>Convert GFA to FASTA:</p>
<div>
<pre><code>awk <span>'/^S/{print "&gt;"$2"\n"$3}'</span> reads.gfa | fold &gt; reads.fa
</code></pre>
</div>
<p>And then count how many contigs:</p>
<div>
<pre><code>grep <span>"&gt;"</span> reads.fa | wc -l</code></pre>
</div>
<p>&nbsp;</p>
<pre><span><span>#</span> Download sample PacBio from the PBcR website</span>
wget -O- http://www.cbcb.umd.edu/software/PBcR/data/selfSampleData.tar.gz <span>|</span> tar zxf -
ln -s selfSampleData/pacbio_filtered.fastq reads.fq
<span><span>#</span> Install minimap and miniasm (requiring gcc and zlib)</span>
git clone https://github.com/lh3/minimap <span>&amp;&amp;</span> (cd minimap <span>&amp;&amp;</span> make)
git clone https://github.com/lh3/miniasm <span>&amp;&amp;</span> (cd miniasm <span>&amp;&amp;</span> make)
<span><span>#</span> Overlap</span>
minimap/minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq <span>|</span> gzip -1 <span>&gt;</span> reads.paf.gz
<span><span>#</span> Layout</span>
miniasm/miniasm -f reads.fq reads.paf.gz <span>&gt;</span> reads.gfa</pre><p>Address of the bookmark: <a href="https://github.com/lh3/miniasm" rel="nofollow">https://github.com/lh3/miniasm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34618/mashmap-a-fast-and-approximate-software-for-mapping-long-reads-pacbioont-or-assembly-to-reference-genomes</guid>
	<pubDate>Tue, 12 Dec 2017 17:23:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34618/mashmap-a-fast-and-approximate-software-for-mapping-long-reads-pacbioont-or-assembly-to-reference-genomes</link>
	<title><![CDATA[MashMap: a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s)]]></title>
	<description><![CDATA[<p><span>MashMap is a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s). It maps a query sequence against a reference region if and only if its estimated alignment identity is above a specified threshold. It does not compute the alignments explicitly, but rather estimates a&nbsp;</span><em>k</em><span>-mer based&nbsp;</span><a href="https://en.wikipedia.org/wiki/Jaccard_index">Jaccard similarity</a><span>&nbsp;using a combination of&nbsp;</span><a href="http://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p76-schleimer.pdf">Winnowing</a><span>&nbsp;and&nbsp;</span><a href="https://en.wikipedia.org/wiki/MinHash">MinHash</a><span>. This is then converted to an estimate of sequence identity using the&nbsp;</span><a href="http://mash.readthedocs.org/">Mash</a><span>&nbsp;distance. An appropriate&nbsp;</span><em>k</em><span>-mer sampling rate is automatically determined given minimum local alignment length and identity thresholds. The efficiency of the algorithm improves as both of these thresholds are increased.</span></p><p>Address of the bookmark: <a href="https://github.com/marbl/MashMap" rel="nofollow">https://github.com/marbl/MashMap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</guid>
	<pubDate>Thu, 25 Jan 2018 05:47:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</link>
	<title><![CDATA[RGFA: powerful and convenient handling of assembly graphs]]></title>
	<description><![CDATA[<p><span>RGFA, an implementation of the proposed GFA specification in Ruby. It allows the user to conveniently parse, edit and write GFA files. Complex operations such as the separation of the implicit instances of repeats and the merging of linear paths can be performed. A typical application of RGFA is the editing of a graph, to finish the assembly of a sequence, using information not available to the assembler. We illustrate a use case, in which the assembly of a repetitive metagenomic fosmid insert was completed using a script based on RGFA.</span></p>
<p><span>https://github.com/ggonnella/rgfa</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36533/mecat-fast-mapping-error-correction-and-de-novo-assembly-for-single-molecule-sequencing-reads</guid>
	<pubDate>Fri, 11 May 2018 05:07:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36533/mecat-fast-mapping-error-correction-and-de-novo-assembly-for-single-molecule-sequencing-reads</link>
	<title><![CDATA[MECAT: fast mapping, error correction, and de novo assembly for single-molecule sequencing reads]]></title>
	<description><![CDATA[<p>MECAT is an ultra-fast Mapping, Error Correction and de novo Assembly Tools for single molecula sequencing (SMRT) reads. MECAT employs novel alignment and error correction algorithms that are much more efficient than the state of art of aligners and error correction tools. MECAT can be used for effectively de novo assemblying large genomes. For example, on a 32-thread computer with 2.0 GHz CPU , MECAT takes 9.5 days to assemble a human genome based on 54x SMRT data, which is 40 times faster than the current&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>. MECAT performance were compared with&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>,&nbsp;<a href="https://github.com/PacificBiosciences/falcon">FALCON</a>&nbsp;and&nbsp;<a href="http://canu.readthedocs.io/en/latest/">Canu(v1.3)</a>&nbsp;in five real datasets. The quality of assembled contigs produced by MECAT is the same or better than that of the&nbsp;<a href="http://cbcb.umd.edu/software/pbcr/mhap/">PBcR-Mhap pipeline</a>&nbsp;and&nbsp;<a href="https://github.com/PacificBiosciences/falcon">FALCON</a>.&nbsp;</p>
<p>https://www.nature.com/articles/nmeth.4432</p><p>Address of the bookmark: <a href="https://github.com/xiaochuanle/MECAT" rel="nofollow">https://github.com/xiaochuanle/MECAT</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>