<?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/27035?offset=1270</link>
	<atom:link href="https://bioinformaticsonline.com/related/27035?offset=1270" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/opportunity/view/7999/senior-research-fellow-indian-agricultural-statistics-research-institute</guid>
  <pubDate>Thu, 23 Jan 2014 06:22:15 -0600</pubDate>
  <link></link>
  <title><![CDATA[Senior Research Fellow @ Indian Agricultural Statistics Research Institute]]></title>
  <description><![CDATA[
<p>Indian Agricultural Statistics Research Institute<br />Library Avenue, Pusa, New Delhi – 110012</p>

<p>Walk-in-Interview</p>

<p>Walk-in-interview will be held on February 11, 2014 at 10:00 A.M. at IASRI, New Delhi for a project “Whole Genome Sequencing and Development of Allied Genomics Resources in Two Commercially Important Fish-Labeo rohita and Clarias batrachus” funded by Department of Biotechnology, Ministry of Science and Technology, Government of India, New Delhi for the following posts. The appointment will be on contractual basis upto September, 2016 or till the termination of the project whichever is earlier and the incumbent shall not have any claim for regular appointment under ICAR.</p>

<p>Senior Research Fellow Two</p>

<p>Post-Graduation in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application/ Biotechnology or equivalent with 1st Division</p>

<p> Knowledge of Statistical Analysis /Bioinformatics tools/computer programming for computational genomics.</p>

<p>Emoluments for Research Associate: Consolidated Rs: 16000/- per month + 30% HRA (1st Two years) and Rs: 18000/- per month + 30% HRA (3rd Year)</p>

<p>Age Limit: Age should be not more than 35 years (5 years relaxation for SC/ST/women candidates and 3 years for OBC candidates as on date of interview).<br />Interested candidates are requested to appear for Walk-in-Interview on the date and time as specified above in Room No. 106, Training Cum Administrative Block of the Institute along with their application giving bio-data with attested copies of certificates, degrees, testimonials, etc. and one passport size photograph. Original certificates/ Degrees are needed to be produced at the time of interview. No T.A. /D.A. will be paid for appearing in the interview.</p>

<p>Advertisement: http://www.iasri.res.in/employment/2014/srf_cabin.pdf</p>
]]></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/8108/jrf-institute-of-cytology-preventive-oncology</guid>
  <pubDate>Sat, 01 Feb 2014 13:47:29 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF @ Institute of Cytology &amp; Preventive Oncology]]></title>
  <description><![CDATA[
<p>Institute of Cytology &amp; Preventive Oncology (ICPO) which was initially established as Cytology Research Centre ( CRC ) by the Indian Council of Medical Research (ICMR) in 1979, came into the existence in 1989 when CRC was elevated to the level of Institute. ICPO was instituted with the main aim of promoting research in the field of cancers that are most prevalent in India with an emphasis on their early detection and prevention.</p>

<p>Candidates having the below mentioned qualifications may appear for Walk in Interview at ICPO on 5th Feb 2014 between 10.00 AM and 12.00 PM under the NIF project entitled "Prediction of drug tragets of chemical constituents present within non-codified medicinal plants" under Dr Subhash M.Agarwal, Scientist C</p>

<p>    Position : JRF<br />    No of Post : One<br />    Pay : Rs 12000/- + 30% HRA </p>

<p>    Desired Profile : M.Sc in Bioinformatics with good academic record. Candidate with experience in database development and scripting would be preferred<br />    Age Limit : Below 28 years<br />    Period : 2 months</p>

<p>Interested candidates may send their applications with bio-data by email (smagarwal@gmail.com) or post addressed to Dr Subhash M Agarwal, Scientist C, Bioinformatics Division, Institute of Cytology and Preventive Oncology (ICPO) I-7, Sector 39, Noida-201301 so as to reach latest by 04.02.14</p>

<p>Deadline : 04.02.14</p>

<p>http://icmr.nic.in/icmrnews/icpo_jrf.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/8385/peng-lab</guid>
  <pubDate>Tue, 18 Feb 2014 13:53:46 -0600</pubDate>
  <link></link>
  <title><![CDATA[Peng Lab]]></title>
  <description><![CDATA[
<p>Peng Lab at Janelia Farm Research Campus, Howard Hughes Medical Institute focuses on data mining for bioinformatics and computational molecular biology, particularly, bioimage data mining and informatics. These bioimages include cellular and molecular images and related medical images. </p>

<p>* Analysis of Gene Expression Pattern Images: high-performance image analysis and mining for different model organisms, such as fruitfly, C. elegans, and mouse;<br />* Feature/Model Learning: developing algorithms and software</p>

<p>Location :Janelia Farm Research Campus, Howard Hughes Medical Institute, Ashburn, Virginia, USA.</p>

<p>http://research.janelia.org/peng/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/37236/installing-salmon-for-trinity</guid>
	<pubDate>Tue, 03 Jul 2018 09:02:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/37236/installing-salmon-for-trinity</link>
	<title><![CDATA[Installing Salmon for Trinity !]]></title>
	<description><![CDATA[
<p>➜  trinityrnaseq-Trinity-v2.6.6 git:(master) ✗ conda install salmon<br />Solving environment: done</p>

<p>## Package Plan ##</p>

<p>  environment location: /home/urbe/anaconda3</p>

<p>  added / updated specs: <br />    - salmon</p>

<p>The following packages will be downloaded:</p>

<p>    package                    |            build<br />    ---------------------------|-----------------<br />    boost-1.64.0               |           py36_4         331 KB  conda-forge<br />    jemalloc-5.1.0             |       hfc679d8_0         8.2 MB  conda-forge<br />    boost-cpp-1.64.0           |                1        17.8 MB  conda-forge<br />    salmon-0.10.2              |                1         3.7 MB  bioconda<br />    conda-4.5.5                |           py36_0         624 KB  conda-forge<br />    tbb-2018_20171205          |                0         1.2 MB  conda-forge<br />    ------------------------------------------------------------<br />                                           Total:        31.8 MB</p>

<p>The following NEW packages will be INSTALLED:</p>

<p>    boost:     1.64.0-py36_4    conda-forge<br />    boost-cpp: 1.64.0-1         conda-forge<br />    jemalloc:  5.1.0-hfc679d8_0 conda-forge<br />    salmon:    0.10.2-1         bioconda   <br />    tbb:       2018_20171205-0  conda-forge</p>

<p>The following packages will be UPDATED:</p>

<p>    conda:     4.5.4-py36_0     conda-forge --&gt; 4.5.5-py36_0 conda-forge</p>

<p>Proceed ([y]/n)? y</p>

<p>Downloading and Extracting Packages<br />boost-1.64.0         |  331 KB | ####################################################################################################################################### | 100% <br />jemalloc-5.1.0       |  8.2 MB | ####################################################################################################################################### | 100% <br />boost-cpp-1.64.0     | 17.8 MB | ####################################################################################################################################### | 100% <br />salmon-0.10.2        |  3.7 MB | ####################################################################################################################################### | 100% <br />conda-4.5.5          |  624 KB | ####################################################################################################################################### | 100% <br />tbb-2018_20171205    |  1.2 MB | ####################################################################################################################################### | 100% <br />Preparing transaction: done<br />Verifying transaction: done<br />Executing transaction: done</p>
]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/8442/assistant-professor-king-saud-university-riyadh</guid>
  <pubDate>Fri, 21 Feb 2014 05:57:18 -0600</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor @ King Saud University Riyadh]]></title>
  <description><![CDATA[
<p>Qualifications: Candidates must have a Ph.D. and a strong background in Molecular and Cellular Biology, protein expression, FACS, or computational biology, and ability to work collaboratively.</p>

<p>This position will have a significant focus on providing analytical support for next generation sequencing data analysis – Exome-sequencing, Targetted sequencing as well as high-throughput genotyping on Illumina platform.</p>

<p>Job location:</p>

<p>Genome Research Chair<br />King Saud University, Riyadh-11451<br />KSA</p>

<p>Interested candidate may forward their CV to grcksu@gmail.com</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</guid>
	<pubDate>Mon, 30 Jul 2018 12:01:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</link>
	<title><![CDATA[nanofilt: Filtering and trimming of long read sequencing data]]></title>
	<description><![CDATA[<p>Filtering on quality and/or read length, and optional trimming after passing filters.<br>Reads from stdin, writes to stdout.</p>
<p>Intended to be used:</p>
<ul>
<li>directly after fastq extraction</li>
<li>prior to mapping</li>
<li>in a stream between extraction and mapping</li>
</ul>
<p>https://github.com/wdecoster/nanofilt</p><p>Address of the bookmark: <a href="https://github.com/wdecoster/nanofilt" rel="nofollow">https://github.com/wdecoster/nanofilt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/8466/srf-position-in-computational-systems-biology-computational-biology-group-iiit-delhi</guid>
  <pubDate>Sun, 23 Feb 2014 20:56:08 -0600</pubDate>
  <link></link>
  <title><![CDATA[SRF position in Computational Systems Biology Computational biology Group, IIIT-Delhi]]></title>
  <description><![CDATA[
<p>An opportunity to perform research in DST supported project that involves building of mathematical models to understand the functional relationship between circadian rhythms and memory formation under stressful condition.  In this project, mathematical model of circadian rhythms based on gene regulatory mechanisms will be unified with the mathematical model of calcium signal transduction pathway to understand and predict the formation of fear memory under stressful conditions. The research scholar will spend full time on this project to build new models and expected to contribute significantly to prepare the results for publication and presentation, and to contribute to grant proposals. </p>

<p>Required Qualifications: Masters in physics/chemistry/mathematics (or) MTech in bioengineering, chemical (or) Masters in any traditional field of science with outstanding performance throughout the program. Candidate should have cleared GATE/UGC-CSIR examinations. Applicant should have done basic mathematics courses like calculus, differential equations, numerical analysis etc in their degree program and have obtained good grades in those courses. Knowledge of MATLAB and C or at least one traditional programming language is absolutely necessary. Strong inclination to understand biological concepts is a must for this research work as this project is about modeling biological systems.     </p>

<p>Salary: A fixed salary of Rs 18000 PM including HRA will be paid. </p>

<p>Last date for application: This advertisement is open until suitable candidate is found for the project. </p>

<p>Preferred Qualifications:  - Expertise in dynamical systems theory, bifurcation theory, numerical simulations, parameter estimation. </p>

<p>Independence and high motivation for carrying out interdisciplinary research. - Excellent communication skills and ability to work independently. - Good working habits. </p>

<p>Interested candidates should submit both curriculum vitae and statement of interest in PDF format to sriramk@iiitd.ac.in and should clearly mention in the subject "Application for SRF".</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37830/nquire-a-statistical-framework-for-ploidy-estimation-using-next-generation-sequencing</guid>
	<pubDate>Thu, 04 Oct 2018 05:23:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37830/nquire-a-statistical-framework-for-ploidy-estimation-using-next-generation-sequencing</link>
	<title><![CDATA[nQuire: a statistical framework for ploidy estimation using next generation sequencing]]></title>
	<description><![CDATA[<p>nQuire provides a statistical framework to study organisms with intraspecific variation in ploidy. nQuire is likely to be useful in epidemiological studies of pathogens, artificial selection experiments, and for historical or ancient samples where intact nuclei are not preserved. It is implemented as a stand-alone Linux command line tool in the C programming language and is available at https://github.com/clwgg/nQuireunder the MIT license.</p><p>Address of the bookmark: <a href="https://github.com/clwgg/nQuireunder" rel="nofollow">https://github.com/clwgg/nQuireunder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>