<?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/34867?offset=200</link>
	<atom:link href="https://bioinformaticsonline.com/related/34867?offset=200" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32946/grass-a-generic-algorithm-for-scaffolding-next-generation-sequencing-assemblies</guid>
	<pubDate>Tue, 23 May 2017 05:20:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32946/grass-a-generic-algorithm-for-scaffolding-next-generation-sequencing-assemblies</link>
	<title><![CDATA[GRASS: a generic algorithm for scaffolding next-generation sequencing assemblies.]]></title>
	<description><![CDATA[<p><span>GRASS (GeneRic ASsembly Scaffolder)-a novel algorithm for scaffolding second-generation sequencing assemblies capable of using diverse information sources. GRASS offers a mixed-integer programming formulation of the contig scaffolding problem, which combines contig order, distance and orientation in a single optimization objective. The resulting optimization problem is solved using an expectation-maximization procedure and an unconstrained binary quadratic programming approximation of the original problem. We compared GRASS with existing HTS scaffolders using Illumina paired reads of three bacterial genomes. Our algorithm constructs a comparable number of scaffolds, but makes fewer errors. This result is further improved when additional data, in the form of related genome sequences, are used.</span></p><p>Address of the bookmark: <a href="https://github.com/AlexeyG/GRASS" rel="nofollow">https://github.com/AlexeyG/GRASS</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35055/jabba-hybrid-error-correction-for-long-sequencing-reads</guid>
	<pubDate>Fri, 05 Jan 2018 03:58:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35055/jabba-hybrid-error-correction-for-long-sequencing-reads</link>
	<title><![CDATA[Jabba: Hybrid Error Correction for Long Sequencing Reads]]></title>
	<description><![CDATA[<p>Jabba is a hybrid error correction tool to correct third generation (PacBio / ONT) sequencing data, using second generation (Illumina) data.</p>
<p>Input</p>
<p>Jabba takes as input a concatenated de Bruijn graph and a set of sequences:</p>
<p>the de Bruijn graph should appear in fasta format with 1 entry per node, the meta information should be in the format:<br>&gt;NODE <br>the set of sequences should be in fasta or fastq format. These sequences will be corrected (e.g. PacBio reads). The corrections will be written to a file Jabba fasta.<br>The output is a file in fasta format with corrections of the long reads, and additionally a file in the input format containing uncorrected reads.</p>
<p>https://github.com/biointec/jabba/wiki</p>
<p>https://almob.biomedcentral.com/articles/10.1186/s13015-016-0075-7</p><p>Address of the bookmark: <a href="https://github.com/biointec/jabba" rel="nofollow">https://github.com/biointec/jabba</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/view/1906</guid>
	<pubDate>Sun, 11 Aug 2013 11:13:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/1906</link>
	<title><![CDATA[Compressive Genomics]]></title>
	<description><![CDATA[<p>The key to finding a solution is to notice that most&nbsp;<a href="http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html">genomic</a>sequences differ by very little. It may well be that the number of complete genome sequences being stored is increasing rapidly, but the actual amount of new data is very small. In other words, a single DNA sequence isn't particularly compressible but a set of sequences shares so much in common that the redundancy can be used to store them in a much smaller storage space. (Source:e-article from&nbsp;Alex Armstrong)</p><p><a href="http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html">http://www.i-programmer.info/news/181-algorithms/4537-a-new-dna-sequence-search-compressive-genomics.html</a></p><p><a href="http://en.wikipedia.org/wiki/Compression_of_Genomic_Re-Sequencing_Data">http://en.wikipedia.org/wiki/Compression_of_Genomic_Re-Sequencing_Data</a></p><p><a href="http://www.nature.com/nbt/journal/v30/n7/full/nbt.2241.html">http://www.nature.com/nbt/journal/v30/n7/full/nbt.2241.html</a></p><p><a href="http://bioinformatics.oxfordjournals.org/content/29/13/i283.full">http://bioinformatics.oxfordjournals.org/content/29/13/i283.full</a></p><p><a href="http://groups.csail.mit.edu/cb/cast/">http://groups.csail.mit.edu/cb/cast/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/3889/bioinformatics-and-sequencing-courses-and-workshops</guid>
	<pubDate>Sat, 24 Aug 2013 16:41:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/3889/bioinformatics-and-sequencing-courses-and-workshops</link>
	<title><![CDATA[Bioinformatics and Sequencing Courses and Workshops]]></title>
	<description><![CDATA[<p>Swiss Institute of Bioinformatics (SIB) organises lots of bioinformatics courses covering wide range of topics:</p><p><a href="http://www.isb-sib.ch/education/training-courses.html">http://www.isb-sib.ch/education/training-courses.html</a></p><p>Canadian bioinformatics also organises various bioinformatics and sequencing courses:</p><p><a href="http://bioinformatics.ca/workshops">http://bioinformatics.ca/workshops</a></p><p>In addition to above two, EMBI&nbsp;Europe, EMBO Europe, Cold Spring Harbour USA, Wellcome Trust UK and NOVA&nbsp;Europe&nbsp;also organise bioinformatics and sequencing courses annually:</p><p><a href="http://www.embl.de/training/events/index.php?p_outstation=ALL">http://www.embl.de/training/events/index.php?p_outstation=ALL</a></p><p><a href="http://www.embo.org/funding-awards/courses-workshops">http://www.embo.org/funding-awards/courses-workshops</a></p><p><a href="http://meetings.cshl.edu/courses.html">http://meetings.cshl.edu/courses.html</a></p><p><a href="http://www.wellcome.ac.uk/Education-resources/Courses-and-conferences/Advanced-Courses-and-Scientific-Conferences/Advanced-Courses/index.htm">http://www.wellcome.ac.uk/Education-resources/Courses-and-conferences/Advanced-Courses-and-Scientific-Conferences/Advanced-Courses/index.htm</a></p><p><a href="http://www.nova-university.org/pagetop.cfm?MenySidorTop_id=2&amp;open=7">http://www.nova-university.org/pagetop.cfm?MenySidorTop_id=2&amp;open=7</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/3030/illuminating-next-generation-sequencing-data-with-go</guid>
	<pubDate>Fri, 23 Aug 2013 07:13:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/3030/illuminating-next-generation-sequencing-data-with-go</link>
	<title><![CDATA[Illuminating next generation sequencing data with Go]]></title>
	<description><![CDATA[<p>Another good lecture for Illumina sequencing data analysis from&nbsp;</p>
<p>Dan Kortschak,&nbsp;Bioinformatics Group,&nbsp;School of Molecular and Biomedical Science ,The University of Adelaide</p><p>Address of the bookmark: <a href="http://talks.biogo.googlecode.com/git/illumination/illumination.pdf" rel="nofollow">http://talks.biogo.googlecode.com/git/illumination/illumination.pdf</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/5166/role-of-microbes-in-forensic-science</guid>
	<pubDate>Sun, 29 Sep 2013 10:07:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/5166/role-of-microbes-in-forensic-science</link>
	<title><![CDATA[Role of microbes in forensic science]]></title>
	<description><![CDATA[<p>"<span>Studies on decomposing mice suggest that the microbial content of a corpse can offer clues as to how old a body is and the approximate time that death occurred."</span><span><br /><br />Read more:&nbsp;<a href="http://www.digitaljournal.com/article/359185#ixzz2gIJFVHRo">http://www.digitaljournal.com/article/359185#ixzz2gIJFVHRo</a></span></p><p><span><a href="http://www.colorado.edu/news/releases/2013/09/24/new-cu-boulder-led-study-finds-%E2%80%98microbial-clock%E2%80%99-may-help-determine-time">http://www.colorado.edu/news/releases/2013/09/24/new-cu-boulder-led-study-finds-%E2%80%98microbial-clock%E2%80%99-may-help-determine-time</a></span></p><p><span>Paper:</span></p><p><span><a href="http://www.elifesciences.org/wp-content/uploads/2013/09/eLife.01104_INPRESS.pdf">http://www.elifesciences.org/wp-content/uploads/2013/09/eLife.01104_INPRESS.pdf</a></span></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/5817/the-first-50-plant-genomes</guid>
	<pubDate>Mon, 21 Oct 2013 11:19:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/5817/the-first-50-plant-genomes</link>
	<title><![CDATA[The First 50 Plant Genomes]]></title>
	<description><![CDATA[<p>Plant scientists can exploit available 50 plant complete genomic data for their resequencing or other related projects for understanding the genetic mechanism behind their different traits and molecular evolution. Complete information about these plant genomes given in paper link.</p>
<p><a href="https://www.crops.org/publications/tpg/articles/6/2/plantgenome2013.03.0001in">https://www.crops.org/publications/tpg/articles/6/2/plantgenome2013.03.0001in</a></p><p>Address of the bookmark: <a href="https://www.crops.org/publications/tpg/pdfs/6/2/plantgenome2013.03.0001in" rel="nofollow">https://www.crops.org/publications/tpg/pdfs/6/2/plantgenome2013.03.0001in</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/9676/bioinformatics-job-in-genotypic-tech-india</guid>
  <pubDate>Mon, 07 Apr 2014 08:20:54 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics job in Genotypic Tech, India]]></title>
  <description><![CDATA[
<p>Genotypic Technology, the first Genomics Company of India is poised to become the next generation life sciences company. We are hiring professionals for our high end Genomics Labs (Molecular Biology/ Microarray/NGS) and Bioinformatics groups.</p>

<p>Apply to Genotypic Technology if you are a PhD in Life Sciences/ Molecular Biology/ Biotechnology/ Human Genetics/ Bioinformatics with minimum 4-5 years post doctoral experience as well as publications in peer reviewed journals.</p>

<p>Source: http://www.genotypic.co.in/Careers/2/Current-Openings.aspx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/17885/international-conference-on-bioinformatics-models-methods-and-algorithms</guid>
	<pubDate>Sun, 05 Oct 2014 11:42:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/17885/international-conference-on-bioinformatics-models-methods-and-algorithms</link>
	<title><![CDATA[International Conference on Bioinformatics Models, Methods and Algorithms]]></title>
	<description><![CDATA[<p><span>The purpose of the International Conference on Bioinformatics Models, Methods and Algorithms is to bring together researchers and practitioners interested in the application of computational systems and information technologies to the field of molecular biology, including for example the use of statistics and algorithms to understanding biological processes and systems, with a focus on new developments in genome bioinformatics and computational biology. Areas of interest for this community include sequence analysis, biostatistics, image analysis, scientific data management and data mining, machine learning, pattern recognition, computational evolutionary biology, computational genomics and other related fields.</span></p>
<p><span><span>Position Paper Submission Extension:</span><span>&nbsp;</span><span>October 9, 2014</span><span>&nbsp;</span><br><span>Regular Paper Authors Notification:</span><span>&nbsp;</span><span>November 3, 2014</span><span>&nbsp;</span><br><span>Position Paper Authors Notification:</span><span>&nbsp;</span><span>November 6, 2014</span><span>&nbsp;</span><br><span>Regular and Position Paper Camera Ready and Registration:</span><span>&nbsp;</span><span>November 17, 2014</span><span>&nbsp;</span></span></p><p>Address of the bookmark: <a href="http://www.bioinformatics.biostec.org/" rel="nofollow">http://www.bioinformatics.biostec.org/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

</channel>
</rss>