<?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/7674?offset=520</link>
	<atom:link href="https://bioinformaticsonline.com/related/7674?offset=520" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11175/next-generation-sequencingngs-books</guid>
	<pubDate>Fri, 30 May 2014 04:48:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11175/next-generation-sequencingngs-books</link>
	<title><![CDATA[Next generation sequencing(NGS) books]]></title>
	<description><![CDATA[<p>Employing different technologies, the purpose of NGS platform is to decode the identity or modification on the nucleotides. NGS platforms evolve quickly and capture the main stream.</p>
<p>This bookmark is created to provide NGS online books links.</p><p>Address of the bookmark: <a href="http://en.wikibooks.org/wiki/Next_Generation_Sequencing_%28NGS%29/Print_version" rel="nofollow">http://en.wikibooks.org/wiki/Next_Generation_Sequencing_%28NGS%29/Print_version</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26179/alignment-of-closely-related-whole-genomesscaffolds</guid>
	<pubDate>Fri, 29 Jan 2016 10:37:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26179/alignment-of-closely-related-whole-genomesscaffolds</link>
	<title><![CDATA[Alignment of closely related whole genomes/scaffolds]]></title>
	<description><![CDATA[<p>With the relative ease and low cost of current generation sequencing technologies has led to a dramatic increase in the number of sequenced genomes for species across the tree of life. This increasing volume of data requires tools that can quickly compare multiple whole-genome sequences, millions of base pairs in length, to aid in the study of populations, pan-genomes, and genome evolution.This bookmaks have been created to report new tools for whole genome alignments.</p>
<p>Please report new whole genome alignment tools under comment sections.</p><p>Address of the bookmark: <a href="http://www.cs.utoronto.ca/~brudno/721.full.pdf" rel="nofollow">http://www.cs.utoronto.ca/~brudno/721.full.pdf</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32875/finishing</guid>
	<pubDate>Sat, 20 May 2017 15:50:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32875/finishing</link>
	<title><![CDATA[Finishing !!]]></title>
	<description><![CDATA[<p>The process of&nbsp;<em>finishing</em>&nbsp;a genome and moving it from a&nbsp;<em>draft</em>&nbsp;stage (the result of sequencing and initial assembly) to a complete genome is typically a time and resource intensive task. The advent of new sequencing technologies has come with its own set of opportunities and pitfalls in the finishing process. While genomes can now be sequenced to high redundancy in a cost-effective manner, the process of assembling the genomes is more challenging and often draft genomes are fragmented into hundreds of contigs. Correspondingly, the task of producing the complete genome can involve months of lab work and thousands of finishing experiments and is usually done in large genome centers.</p>
<p>The work in our lab has focussed on computational approaches to speed-up the finishing process. Specifically, we have explored the use of optical mapping and mate-pair data to augment assemblies and direct finishing experiments. The tools developed in our lab have been used in several finishing projects, producing complete genomes (and near-complete ones) with surprisingly little computational and experimental effort (Nagarajan et al., in submission). The executables (as well as source code) for these tools are freely available here:</p>
<ul>
<li><strong>Scaffolding using Optical Restriction Mapping</strong><br>Optical Maps are global, ordered maps of restriction site locations in a genome. This information can be quite useful in scaffolding contigs from a shotgun assembly to guide the finishing process. A set of programs to exploit optical maps for assembly can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/soma-v2.tar.gz">SOMA v2.0 (63 MB tar.gz file)</a>. This version of SOMA contains several improvements to programs in v1.0 as well as new scripts for working with multiple maps, contig graphs and scaffolds.&nbsp;<br><br></li>
<li><strong>Augmenting assemblies with mate-pair data</strong><br>Mate-pair information can be valuable in augmenting short-read assemblies and reconstructing the genome as larger scaffolds. AMOS-Hybrid is a pipeline written in the AMOS framework (open-source assembly tools) to merge arbitrary mated reads into an existing assembly and merge contigs and create scaffolds where possible. Source code and executables for AMOS-Hybrid are available here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/AMOS-Hybrid-v1.tar.gz">AMOS-Hybrid v1.0 (142 MB tar.gz file)</a>.&nbsp;<br><br></li>
<li><strong>Assembly and sequence-composition guided finishing</strong><br>Contigs from a shotgun assembly are typically linked together in a graph structure that can serve to guide finishing and in some case close gaps&nbsp;<em>in-silico</em>. Also, in many cases, sequence composition of contigs can provide clues to fill gaps in scaffolds. A set of scripts to automate some of these tasks can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/finishing-v1.tar.gz">Finishing Scripts v1.0 (63 MB tar.gz file)</a>.&nbsp;</li>
</ul>
<p>http://www.cbcb.umd.edu/finishing/</p><p>Address of the bookmark: <a href="http://www.cbcb.umd.edu/finishing/" rel="nofollow">http://www.cbcb.umd.edu/finishing/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/18381/how-far-can-bioinformatics-go-creating-organisms-used-for-testing</guid>
	<pubDate>Fri, 17 Oct 2014 02:08:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/18381/how-far-can-bioinformatics-go-creating-organisms-used-for-testing</link>
	<title><![CDATA[How far can bioinformatics go creating organisms used for testing?]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/FojhDef2NW4" frameborder="0" allowfullscreen></iframe>"I think you can get very far on a technical level. The problem is that a human body is more complex than just one cell." ... "At some point we still need clinical tests on animals and humans before we use it for real treatment. But we will likely be able to remove 99 % of animal tests in the future."

Erik Lindahl, Professor of Theoretical and Computational Biophysics at KTH Royal Institute of Technology is telling us about his work.

From the episode "Science for life – mapping the building blocks of the human body". Watch the rest of the talk, and other talks at www.crosstalks.tv

Crosstalks is an academic talkshow produced by KTH Royal Institute of Technology and Stockholm University.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</guid>
	<pubDate>Fri, 01 Dec 2017 04:10:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</link>
	<title><![CDATA[PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool]]></title>
	<description><![CDATA[<p><strong>PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.</strong></p>
<p><strong>Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.</strong></p>
<p>PLAST stands for&nbsp;<em>Parallel Local Sequence Alignment Search Tool&nbsp;</em>and is was&nbsp;<a href="http://www.biomedcentral.com/1471-2105/10/329" target="_blank">published in BMC Bioinformatics.</a></p>
<p>PLAST is a general purpose sequence comparison tool providing the following benefits:</p>
<ul>
<li>PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),</li>
<li>Reduces the processing time of sequences comparisons while providing highest quality results,</li>
<li>Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),</li>
<li>Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,</li>
<li>Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.</li>
</ul>
<p>https://plast.inria.fr/</p><p>Address of the bookmark: <a href="https://plast.inria.fr/" rel="nofollow">https://plast.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/18576/graduate-research-assistantships-university-of-nebraska-lincoln-unl</guid>
  <pubDate>Wed, 22 Oct 2014 10:05:31 -0500</pubDate>
  <link></link>
  <title><![CDATA[Graduate research assistantships @ University of Nebraska-Lincoln (UNL)]]></title>
  <description><![CDATA[
<p>Graduate research assistantships in quantitative genetics are available with Gota Morota in the Department of Animal Science at the University of Nebraska-Lincoln (UNL).</p>

<p>Current projects in the Morota lab include developing kernel-based whole-genome prediction and kernel-based genome-wide association models, polygenic modeling of binary traits, reexamining the results from quantitative genetics analysis in light of functional annotation, and extending kernel methods (such as GBLUP and RKHS) specifically tailored for diverse types of emerging omics data.</p>

<p>In addition, candidates will be expected to leverage opportunities to interact with faculty in animal genetics and biometrics at the UNL in the areas of bioinformatics, breeding, functional genomics, quantitative genetics, and molecular genetics.</p>

<p>Candidates should have a B.S. or M.S. degree in quantitative disciplines with strong background and interest in statistical computing. <br />The starting date is Fall 2015. <br />For more information about research in the Morota lab at the UNL, visit: http://www.morotalab.org</p>

<p>A letter of interest in the position, C.V., and contact information for <br />three references should be emailed to Gota Morota at . <br />Review of applications will begin immediately, and continue until the <br />positions are filled. Informal inquiries are also welcome.</p>

<p>Also, please see: http://animalscience.unl.edu/anscprospectivegraduatestudents</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36518/mix-combining-multiple-assemblies-from-ngs-data</guid>
	<pubDate>Tue, 08 May 2018 04:58:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36518/mix-combining-multiple-assemblies-from-ngs-data</link>
	<title><![CDATA[MIX: Combining multiple assemblies from NGS data]]></title>
	<description><![CDATA[<p>Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices represent extremities of contigs and edges represent existing alignments between these extremities. These alignment edges are used for contig extension. The resulting output assembly corresponds to a path in the extension graph that maximizes the cumulative contig length.</p>
<p>The Mix algorithm, approach and results were published in BMC bioinformatics :&nbsp;<a href="http://www.biomedcentral.com/1471-2105/14/S15/S16">http://www.biomedcentral.com/1471-2105/14/S15/S16</a>.</p><p>Address of the bookmark: <a href="https://github.com/cbib/MIX" rel="nofollow">https://github.com/cbib/MIX</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/18820/jrfsrf-at-university-of-calcutta</guid>
  <pubDate>Fri, 31 Oct 2014 08:53:10 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF/SRF at University of Calcutta]]></title>
  <description><![CDATA[
<p>Applications are invited to appear at a walk-in-interview for one post of Junior Research Fellow in the DBT(DBT Twinning NER) sponsored project entitled “Protein folding kinetics is a selection force on shaping codon usage bias in the high expression genes” in the room of the HOD, Department of Biotechnology and the Coordinator, DR. B. C. Guha Centre for Genetic Engineering and Biotechnology, University College of Science, 35 Ballygunge Circular Road, Kolkata 700019 on the 12th November, 2014 at 3:00 p.m.</p>

<p>Essential qualifications: First class M. Sc. in any branch of life sciences and qualified CSIR-UGC NET/GATE Examination.</p>

<p>Desirable qualifications: Practical experience in biochemical and biophysical studies of proteins</p>

<p>Emoluments: as per DBT norms</p>

<p>The project is tenable for two years, initially for one year.</p>

<p>Age: Below 28 years (relaxable in the case of SC/ST/OBC/women candidates)</p>

<p>Candidates are requested to bring two sets of complete applications on plain paper furnishing bio-data and copies of attested certificates along with originals (for verification) on the date of interview.</p>

<p>No TA/DA is admissible for candidates appearing at the interview.</p>

<p>Dr. Rajat Banerjee<br />Assistant Professor<br />Department of Biotechnology and<br />Dr. B. C. Guha Centre for Genetic Engineering and Biotechnology<br />University College of Science<br />35, Ballygunge Circular Road<br />Kolkata 700019</p>

<p>Advertisement: www.caluniv.ac.in/news/jrf_biotech_2.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</guid>
	<pubDate>Fri, 08 Jun 2018 10:47:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</link>
	<title><![CDATA[HALC: High throughput algorithm for long read error correction]]></title>
	<description><![CDATA[HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach)

HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.<p>Address of the bookmark: <a href="https://github.com/lanl001/halc" rel="nofollow">https://github.com/lanl001/halc</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19085/jrf-in-bioinformatics-pondicherry-university</guid>
  <pubDate>Sat, 08 Nov 2014 14:34:48 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF in Bioinformatics @ Pondicherry University]]></title>
  <description><![CDATA[
<p>Eager to get JRF job in Puducherry? Pondicherry University, School of Life Sciences, Centre for Bioinformatics has issued notification to fill the vacancy of JRF for DST sponsored research project entitled "Design and discovery of aurora kinase inhibitors as anti cancer drugs; application of computer aided drug design". It is good chance to get job with Pondicherry University and secure your future. Learn eligibility criteria and apply on or before 21.11.2014.</p>

<p>Required Skills:	no special skills required for this job post<br />Required Experience:	<br />Experience in computer aided drug design and or biochemical testing of natural or synthetic compounds is desired<br />Required Education:	<br />M.Sc. / M.Tech.</p>

<p>Required Job Profile:<br />Candidate must possess M.Sc. in bioinformatics or computational biology or biotechnology or any branch of life sciences or pharmacology or chemical sciences or M.Tech. in any branch of life sciences with at least fifty five percent marks with NET or GATE.</p>

<p>Desired Job Profile:<br />Candidate having experience in computer aided drug design and or biochemical testing of natural or synthetic compounds.</p>

<p>How to apply:<br />Eligible and interested candidates should need to appear for walk-in interview on 21.11.2014 at 1700 hrs at the above mentioned address.</p>

<p>Contact<br />Pondicherry University<br />Dr. S. Mohane Coumar, Assistant Professor &amp; Project Investigator, Centre for Bioinformatics, Pondicherry University, Puducherry 605 014<br />Email:registrar@pondiuni.edu.in<br />Phone:	0413-2655175</p>

<p>More at http://www.pondiuni.edu.in/sites/default/files/JRF-bioinfor-041114.pdf</p>
]]></description>
</item>

</channel>
</rss>