<?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/41493?offset=430</link>
	<atom:link href="https://bioinformaticsonline.com/related/41493?offset=430" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36476/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads</guid>
	<pubDate>Fri, 04 May 2018 19:16:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36476/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads</link>
	<title><![CDATA[Flye: Fast and accurate de novo assembler for single molecule sequencing reads]]></title>
	<description><![CDATA[<p><span>Flye is a de novo assembler for long and noisy reads, such as those produced by PacBio and Oxford Nanopore Technologies. The algorithm uses an A-Bruijn graph to find the overlaps between reads and does not require them to be error-corrected. After the initial assembly, Flye performs an extra repeat classification and analysis step to improve the structural accuracy of the resulting sequence. The package also includes a polisher module, which produces the final assembly of high nucleotide-level quality.</span></p><p>Address of the bookmark: <a href="https://github.com/fenderglass/Flye" rel="nofollow">https://github.com/fenderglass/Flye</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36837/ranbow-a-haplotype-assembler-for-polyploid-genomes</guid>
	<pubDate>Fri, 01 Jun 2018 07:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36837/ranbow-a-haplotype-assembler-for-polyploid-genomes</link>
	<title><![CDATA[Ranbow: a haplotype assembler for polyploid genomes]]></title>
	<description><![CDATA[Ranbow is a haplotype assembler for polyploid genomes. It has been developed for the haplotype assembly of the hexaploid sweet potato genome, which is highly heterozygous. Ranbow can also be applied to other polyploid genomes. After a first phasing, Ranbow utilizes the assembled haplotypes to improve the accuracy of variant calling results and to infer the evolutionary history of the organism´s genome. Ranbow has three main modes of function:

ranbow hap: for haplotyping
ranbow eval: for evaluating of the assemble haplotypes by gold standard (long) reads 
ranbow phylo: for the phylogenetic analysis<p>Address of the bookmark: <a href="https://www.molgen.mpg.de/ranbow" rel="nofollow">https://www.molgen.mpg.de/ranbow</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm</guid>
	<pubDate>Mon, 16 Mar 2020 10:09:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm</link>
	<title><![CDATA[Apollo: A Sequencing-Technology-Independent, Scalable, and Accurate Assembly Polishing Algorithm]]></title>
	<description><![CDATA[<p><span>Apollo is an assembly polishing algorithm that attempts to correct the errors in an assembly. It can take multiple set of reads in a single run and polish the assemblies of genomes of any size. Described by Firtina et al. (preliminary version at&nbsp;</span><a href="https://arxiv.org/pdf/1902.04341.pdf">https://arxiv.org/pdf/1902.04341.pdf</a></p>
<p>More at&nbsp;<a href="https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1">https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1</a></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/Apollo" rel="nofollow">https://github.com/CMU-SAFARI/Apollo</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44474/claw-chloroplast-long-read-assembly-workflow</guid>
	<pubDate>Wed, 21 Feb 2024 12:37:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44474/claw-chloroplast-long-read-assembly-workflow</link>
	<title><![CDATA[CLAW: Chloroplast Long-read Assembly Workflow]]></title>
	<description><![CDATA[<p dir="auto">CLAW (Chloroplast Long-read Assembly Workflow) is an mostly-automated Snakemake-based workflow for the assembly of chloroplast genomes. CLAW uses chloroplast long-reads, which are baited out of larger read libraries (e.g., an Oxford Nanopore Technologies MinION read library derived from photosynthetic tissue), for assembly with Flye and/or Unicycler. CLAW was designed with the novice bioinformatician in mind - it is easy to install and easy to use, requiring only minimal user input.</p><p>Address of the bookmark: <a href="https://github.com/aaronphillips7493/CLAW" rel="nofollow">https://github.com/aaronphillips7493/CLAW</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/11656/faculty-post-at-zhejiang-university</guid>
  <pubDate>Tue, 10 Jun 2014 03:40:40 -0500</pubDate>
  <link></link>
  <title><![CDATA[Faculty post at Zhejiang University]]></title>
  <description><![CDATA[
<p>Zhejiang University (ZJU) is seeking faculty candidates for its newly launched, highly competitive and well funded “Hundred Talents Program”. This search covers all colleges and departments at ZJU. Applicants, expected to be about 35 years old, should hold PhD degree, and postdoctoral experiences are preferred for applicants in most fields. Applicants should have demonstrated commitment to excellence in teaching and research at a level comparable to the academic achievement of assistant professor or associate professor in world-renowned universities. Successful candidates must work full-time and are expected to establish internationally competitive and independent research program in cutting-edge areas of the relevant field at ZJU.</p>

<p>As one of the leading research-intensive universities in China, ZJU is located in the beautiful city of Hangzhou. Successful candidates will be employed as Principal Investigators and are qualified to supervise doctoral students. ZJU will offer an internationally competitive salary and the opportunity to purchase university's apartment at a price much lower than the market price, and will provide office and laboratory spaces as well as internationally competitive research startup packages.</p>

<p>Qualified applicants are strongly encouraged to submit their applications electronically to tr@zju.edu.cn. Applicants should include the following materials in pdf format: a comprehensive CV, a statement of research and teaching plan, and a list of 3 to 5 references with detailed contact information.</p>

<p>Contact：Talents Office, ZJU</p>

<p>Tel：+86-571-88981345, +86-571-88981390</p>

<p>Fax：+86-571-88981976</p>

<p>E-mail:tr@zju.edu.cn</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42411/covid-moonshot-an-international-effort-to-discover-a-covid-antiviral</guid>
	<pubDate>Sun, 20 Dec 2020 01:33:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42411/covid-moonshot-an-international-effort-to-discover-a-covid-antiviral</link>
	<title><![CDATA[COVID Moonshot: An international effort to DISCOVER A COVID ANTIVIRAL]]></title>
	<description><![CDATA[<p><span>The COVID Moonshot is an ambitious crowdsourced initiative to accelerate the development of a COVID antiviral. We work in the open with no intellectual property constraints. This way, any scientist can view submitted drug designs and experimental data to inspire new design ideas. We use our cutting-edge machine learning tools and Folding@home's crowdsourced supercomputer to determine which drug designs to send to our partners to make and test in the lab. With each drug design tested, we get closer to our goal.</span></p>
<p><span>More at&nbsp;https://iubmb.onlinelibrary.wiley.com/doi/full/10.1002/bmb.21480</span></p><p>Address of the bookmark: <a href="https://covid.postera.ai/covid" rel="nofollow">https://covid.postera.ai/covid</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43972/covid-spectrum</guid>
	<pubDate>Sun, 25 Sep 2022 18:58:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43972/covid-spectrum</link>
	<title><![CDATA[Covid Spectrum !]]></title>
	<description><![CDATA[<p>https://cov-spectrum.org/explore/World/AllSamples/</p>
<p><span>CoV-Spectrum supports a wide range of search queries. The following sections presents search options of the basic search bar. For information on the&nbsp;</span><span>advanced search</span></p><p>Address of the bookmark: <a href="https://cov-spectrum.org/" rel="nofollow">https://cov-spectrum.org/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/1926</guid>
	<pubDate>Sun, 11 Aug 2013 11:42:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/1926</link>
	<title><![CDATA[Want to Know which genome assembler rule the world ?]]></title>
	<description><![CDATA[<p><span><strong>Assemblathon 2</strong>: evaluating de novo methods of genome assembly&nbsp;</span></p><p><span><a href="http://www.gigasciencejournal.com/content/2/1/10/abstract">http://www.gigasciencejournal.com/content/2/1/10/abstract</a></span></p><p><span><a href="http://blogs.nature.com/news/2013/07/genome-assembly-contest-prompts-soul-searching.html">http://blogs.nature.com/news/2013/07/genome-assembly-contest-prompts-soul-searching.html</a></span></p><p><a href="http://assemblathon.org/post/44431915644/feedback-and-analysis-of-the-assemblathon-2-p">http://assemblathon.org/post/44431915644/feedback-and-analysis-of-the-assemblathon-2-p</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/4761/dna-is-packaged-in-a-chromosome-experiment</guid>
	<pubDate>Mon, 23 Sep 2013 18:01:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4761/dna-is-packaged-in-a-chromosome-experiment</link>
	<title><![CDATA[DNA is packaged in a chromosome experiment]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/fecfROFrp_c" frameborder="0" allowfullscreen></iframe>For more information, log on to-
http://shomusbiology.weebly.com/
Download the study materials here-
http://shomusbiology.weebly.com/bio-materials.html
A nucleosome is the basic unit of DNA packaging in eukaryotes, consisting of a segment of DNA wound in sequence around four histone protein cores.[1] This structure is often compared to thread wrapped around a spool.[2]

Nucleosomes form the fundamental repeating units of eukaryotic chromatin,[3] which is used to pack the large eukaryotic genomes into the nucleus while still ensuring appropriate access to it (in mammalian cells approximately 2 m of linear DNA have to be packed into a nucleus of roughly 10 µm diameter). Nucleosomes are folded through a series of successively higher order structures to eventually form a chromosome; this both compacts DNA and creates an added layer of regulatory control, which ensures correct gene expression. Nucleosomes are thought to carry epigenetically inherited information in the form of covalent modifications of their core histones. Nucleosomes were observed as particles in the electron microscope by Don and Ada Olins [4] and their existence and structure (as histone octamers surrounded by approximately 200 base pairs of DNA) were proposed by Roger Kornberg.[5][6] The role of the nucleosome as a general gene repressor was demonstrated by Lorch et al. in vitro [7] and by Han and Grunstein in vivo.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/5761/how-i-discovered-dna-james-watson</guid>
	<pubDate>Fri, 18 Oct 2013 11:30:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/5761/how-i-discovered-dna-james-watson</link>
	<title><![CDATA[How I discovered DNA - James Watson]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/RvdxGDJogtA" frameborder="0" allowfullscreen></iframe><p>View full lesson: http://ed.ted.com/lessons/james-watson-on-how-he-discovered-dna Nobel laureate James Watson opens TED2005 with the frank and funny story of how he and his research partner, Francis Crick, discovered the structure of DNA. Talk by James Watson.</p>]]></description>
	
</item>

</channel>
</rss>