<?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=760</link>
	<atom:link href="https://bioinformaticsonline.com/related/41493?offset=760" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29995/hga</guid>
	<pubDate>Tue, 29 Nov 2016 07:25:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29995/hga</link>
	<title><![CDATA[HGA]]></title>
	<description><![CDATA[<p>HGA tool version 1.0 This tool helps to apply the Hierarchical Genome Assembly (HGA) method. The tool will apply: 1. Partitioning a given reads dataset into a given number of partitions. 2. Assembling each partitions using a pre-specified assembler (Velvet or SPAdes in this version) and using a given kmer size. 3. Merging all the assemblies of the partition. 4. Combining all the assemblies of the partition (using velvet with kmer value of 31). 5. Finaly, re-assembling the whole dataset with the merged contigs or the combined contigs, using a given kmer size.</p>
<p>https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA</p><p>Address of the bookmark: <a href="https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA" rel="nofollow">https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34720/meraculous-haplotype-sensitive-assembly-of-highly-heterozygous-genomes</guid>
	<pubDate>Wed, 20 Dec 2017 18:59:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34720/meraculous-haplotype-sensitive-assembly-of-highly-heterozygous-genomes</link>
	<title><![CDATA[Meraculous: Haplotype-sensitive Assembly of Highly Heterozygous genomes.]]></title>
	<description><![CDATA[<p><span>Meraculous is a whole genome assembler for Next Generation Sequencing data geared for large genomes. It is a hybrid k-mer/read-based assembler that capitalizes on the high accuracy of Illumina sequence by eschewing an explicit error correction step which we argue to be redundant with the assembly process. Meraculous achieves high performance with large datasets by utilizing lightweight data structures and multi-threaded parallelization, allowing to assemble human-sized genomes on commodity clusters in under a day. The process pipeline implements a highly transparent and portable model of job control and monitoring where different assembly stages can be executed and re-executed separately or in unison on a wide variety of architectures.</span></p>
<p><span>https://jgi.doe.gov/data-and-tools/meraculous/</span></p>
<p><span>https://arxiv.org/ftp/arxiv/papers/1703/1703.09852.pdf</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/meraculous20/" rel="nofollow">https://sourceforge.net/projects/meraculous20/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/researchlabs/view/43913/lsugenomics-lab</guid>
  <pubDate>Thu, 07 Jul 2022 05:26:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[lsugenomics Lab]]></title>
  <description><![CDATA[
<p>﻿In our lab, we seek to characterize and to compare genomes in order to better understand genetic and evolutionary processes linking genotypes to phenotypes.  <br /> <br />Sequencing and decoding plant genomes have been integral in our approaches.</p>

<p>The overarching goal of our research is to understand how to interpret complex and fascinating messages embedded in genomes.</p>

<p>https://www.lsugenomics.org/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19695/china-university-of-macau-phd-position-2015-in-bioinformatics-computer-science</guid>
  <pubDate>Mon, 22 Dec 2014 00:12:49 -0600</pubDate>
  <link></link>
  <title><![CDATA[China University of Macau PhD Position 2015 in Bioinformatics, Computer Science]]></title>
  <description><![CDATA[
<p>The Computational Biology and Bioinformatics Group at the University of Macau is inviting applications for PhD Position. Applicants will work on a research project focusing on the flexible receptor protein-ligand docking algorithms for computer-aided drug design.  The candidate will be working as part of a team in developing novel metaheuristic algorithms and scoring functions for large-scale, highly flexible protein-ligand docking problems. The duration of this PhD position is 2-3 years, starting in August 2015. Remuneration paid to candidate is MOP 11000-14000/month (~USD 1375-1750/month). The applications should be submitted before March 2015.</p>

<p>Study Subject(s): PhD position is award in the field of Bioinformatics/Computer Science.<br />Course Level: Position is available for pursuing PhD degree level at the University of Macau.<br />Scholarship Provider: University of Macau<br />Scholarship can be taken at: China</p>

<p>Eligibility: The ideal candidate would be a master degree holder in Bioinformatics or related disciplines with knowledge in Medical sciences or Life sciences (with GPA of at least 3.0 on a 4-point scale or equivalent) . Knowledge in programming (C and C++) and Linux scripting are necessary; experience in molecular docking, molecular dynamics simulations or molecular modeling is an advantage. The candidate should be fluent in spoken and written English; preference will be given to applicants with good publication records in relevant areas.</p>

<p>Scholarship Open for International Students: Researchers from China can apply for this PhD position.</p>

<p>Scholarship Description:</p>

<p>The Computational Biology and Bioinformatics Group at the University of Macau is looking for a motivated PhD student in Bioinformatics or Computer Science to work on a research project focusing on the flexible receptor protein-ligand docking algorithms for computer-aided drug design.  The candidate will be working as part of a team in developing novel metaheuristic algorithms and scoring functions for large-scale, highly flexible protein-ligand docking problems.</p>

<p>Number of award(s): There is only one PhD position available.</p>

<p>Duration of award(s): The duration of this PhD position is 2-3 years.</p>

<p>What does it cover? Remuneration paid to candidate is  MOP 11000-14000/month (~USD 1375-1750/month).</p>

<p>Selection Criteria: Not Known</p>

<p>Notification: Not Known</p>

<p>How to Apply: Send your current CV, your academic transcripts, a letter of motivation and research interests, two letters of recommendations from academic faculty to Dr. Shirley Siu at shirleysiu[at]umac.mo before March 2015.</p>

<p>Scholarship Application Deadline: The applications should be submitted before March 2015.</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/38682/bourque-lab</guid>
  <pubDate>Mon, 14 Jan 2019 15:39:25 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bourque Lab]]></title>
  <description><![CDATA[
<p>The goal of the lab is to understand mammalian genomes using comparative genomic and epigenomic analyses. Areas of interest include: the evolution of regulatory sequences, the role of transposable elements in gene regulation and the impact of genome rearrangements in evolution and cancer.</p>

<p>As a computational genomicists our work involves examining billions of DNA base pairs and interpreting how variation impacts basic biology and disease. We develop computational methods and resources for the functional annotation of genomes with a special emphasis on sequencing-based assays (e.g. ChIP-seq, RNA-Seq, exome- and whole-genome sequencing, single-cell analysis).</p>

<p>http://www.computationalgenomics.ca</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43645/corona-virus-genome-and-data-download</guid>
	<pubDate>Sun, 12 Dec 2021 23:34:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43645/corona-virus-genome-and-data-download</link>
	<title><![CDATA[Corona Virus Genome and Data Download !]]></title>
	<description><![CDATA[<p>Genes and its related metadata could be found on&nbsp;https://www.ncbi.nlm.nih.gov/datasets/coronavirus/genomes/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/datasets/coronavirus/genomes/" rel="nofollow">https://www.ncbi.nlm.nih.gov/datasets/coronavirus/genomes/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43650/rules-for-pango-lineage</guid>
	<pubDate>Tue, 14 Dec 2021 04:40:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43650/rules-for-pango-lineage</link>
	<title><![CDATA[Rules for Pango Lineage !]]></title>
	<description><![CDATA[<p>All the rules to classify a Lineage !</p>
<p>https://www.pango.network/the-pango-nomenclature-system/statement-of-nomenclature-rules/</p><p>Address of the bookmark: <a href="https://www.pango.network/the-pango-nomenclature-system/statement-of-nomenclature-rules/" rel="nofollow">https://www.pango.network/the-pango-nomenclature-system/statement-of-nomenclature-rules/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

</channel>
</rss>