<?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/29635?offset=820</link>
	<atom:link href="https://bioinformaticsonline.com/related/29635?offset=820" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/opportunity/view/6012/project-junior-research-fellow-ccmb</guid>
  <pubDate>Fri, 01 Nov 2013 10:38:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Project Junior Research Fellow @ CCMB]]></title>
  <description><![CDATA[
<p>Temporary Project positions available purely on temporary basis - Oct/2013</p>

<p>1. Project Junior Research Fellow / Project Assistant</p>

<p>Last Date: 11th Nov 2013</p>

<p>Qualification B.Tech (Comp. Sci.), B.Tech/M.Tech (Bioinformatics), MCA,  M.Sc. (Mathematics/Statistics)</p>

<p>Desirable Qualifications: Programming in FORTRAN/ C /PERL, Web application technologies</p>

<p>Upper Age limit 28</p>

<p>Rs.12000 / Rs.16000 (as sanctioned by the funding agency)</p>

<p>General terms and conditions:</p>

<p>    Positions are purely temporary and co-terminus with the project.</p>

<p>    HRDG (CSIR) prevailing guidelines are applicable these positions.</p>

<p>    All categories of applicants are required to submit online application.</p>

<p>    Enhancement of stipend to Project JRF to Project SRF will be with the due recommendation of Principal Investigator and approval of the Director on the evaluation of the 3 member Standing Committee consisting of Chairperson at the level of Chief Scientist, Coordinator of the JRFs/RAs/PDFs and the Principal Investigator of the Project.</p>

<p>    The age relaxation as per HRDG (CSIR) norms: SC/ST/OBC/Women/Physically Handicapped persons – five years.</p>

<p>    The Stipend normally be fixed at Rs.22000/- for Research Associates/Post Doc. Fellows. However, a selected RA/PDF may be placed in the higher start of stipend if there is ample justification and such recommendation is made by the Selection Committee. Based on the recommendation with justification by the PI and approval of the Director, person getting stipend at lower rate may be elevated to higher rate subject to availability of the funds in the project.</p>

<p>    Recruitment will be based on initial screening based on qualifications and experience criteria and also based on suitability of the candidates to the nature of research project. This screening will be followed by written test followed / interview. After completing this process, candidates will be shortlisted and appointed in specific project subjects as and when appropriate positions become available. The pool of selected candidates will be valid for six months.</p>

<p>    Remunerations indicate are maximum admissible and will depend upon the availability of funds and subject to conditions applicable to projects from different funding agencies at the time of recruitment.</p>

<p>Apply : http://www.ccmb.res.in/positions/projects/temp_positions.php</p>

<p>Form download : http://www.ccmb.res.in/positions/projects/oct-2013/pdf_download.php</p>
]]></description>
</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/researchlabs/view/6233/edwards-lab</guid>
  <pubDate>Sun, 10 Nov 2013 15:07:08 -0600</pubDate>
  <link></link>
  <title><![CDATA[Edwards Lab]]></title>
  <description><![CDATA[
<p>We study the evolutionary biology of birds and relatives, combining field, museum and genomics approaches to understand the basis of avian diversity, evolution and behavior. Our guiding approaches include population genetics, which provides a quantitative framework for studying speciation, geographic variation and genome evolution; systematics, which acknowledges that the focal species of any study has relatives that are behaviorally and ecologically no less interesting; and natural history, which gives meaning to the genes and genomic patterns we study.</p>

<p>Lab page: http://www.oeb.harvard.edu/faculty/edwards/index.html</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/6559/ai-cadd-project-kerela-university</guid>
  <pubDate>Tue, 19 Nov 2013 17:48:15 -0600</pubDate>
  <link></link>
  <title><![CDATA[Ai-CADD Project @ Kerela University]]></title>
  <description><![CDATA[
<p>Applications are invited for the following Positions in the AiCADD project funded by MHRD Govt of India</p>

<p>Last Date for Submitting Application: 25th November 2013</p>

<p>1. Senior Scientist: (01 position)<br />Pay Scale: Rs.40, 000/-<br />Qualifications:  PhD/ Post Doctoral with Experience in CADD</p>

<p>2. Junior Scientist (10 positions)<br />Pay Scale: Rs. 22,000/-<br />Qualifications: MPhil / Masters Degree in Bioinformatics / Computational Biology / CADD / Ayurveda</p>

<p>3. Technical Assistant (01+01 positions)<br />Pay Scale: Rs.12,000/-<br />Qualifications: 1. BSc Computer Science/ MCA<br />Qualifications: 2. MSc Biotechnology / MSc Microbiology </p>

<p>4. Programmer (01 position)<br />Pay Scale: Rs.20,000/-<br />Qualifications: MSc Computer Science/ MCA / B Tech (Experience in MATLAB, C, C++) Industrial experience is desirable</p>

<p>5. Teaching Assistant (03 positions)<br />Pay Scale: Rs.10,000/-<br />Qualifications: MSc in Bioinformatics </p>

<p>6. Administration Assistant (02 positions)<br />Pay Scale: Rs.8,000/-<br />Qualifications: Degree + PGDCA</p>

<p>The Selection process comprises of written test and interview. Positions are purely temporary (initially for the period of one year) and co-terminus with the project. For more details mail to: cbi.uok [at] gmail.com</p>

<p>More detail @ https://sites.google.com/site/centreforbioinformatics/announcements/applicationsinvitedforapplicationforai-caddproject</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/6577/scientist-b-vector-control-research-centre</guid>
  <pubDate>Tue, 19 Nov 2013 21:19:15 -0600</pubDate>
  <link></link>
  <title><![CDATA[Scientist-B @ VECTOR CONTROL RESEARCH CENTRE]]></title>
  <description><![CDATA[
<p>VECTOR CONTROL RESEARCH CENTRE<br />(Indian Council of Medical Research)<br />Indira Nagar Medical Complex<br />Puducherry-605006</p>

<p>WALK-IN-INTERVIEW</p>

<p>The following vacancies shall be filled purely on adhoc basis under Non-Institutional adhoc project “Bioinformatics in ICMR Institutes” funded by Indian Council of Medical Research at Vector Control Research Centre, Puducherry, to be renewed annually and filled through Walk-in-Interview as indicated below. Candidates who wish to appear for the Walk-in-Interview can download the application format given in the website of Vector Control Research Centre (www.vcrc.res.in). Duly filled in application along with attested copies of certificate should be submitted at time of interview.</p>

<p>Date &amp; Time : 05.12.2013 at 9.00 AM – Scientist-C (Non-Medical)</p>

<p>05.12.2013 at 1.30 PM – Scientist-B (Non-Medical)<br />06.12.2013 at 9.00 AM – Technical Assistant (Research Assistant)<br />06.12.2013 at 1.30 PM – Multi Tasking Staff (General)</p>

<p>Place : Vector Control Research Centre, Puducherry</p>

<p>Project entitled : Biomedical Informatics Centres of ICMR</p>

<p>1. Scientist - C (Non-Medical) Number of post – ONE</p>

<p>Essential qualification</p>

<p>B.E./ B. Tech. Degree in Bioinformatics/ Computational Biology from a recognized University with 6 years experience in the relevant field  OR</p>

<p>First class Master’s Degree and Ph.D. Degree in Bioinformatics/ Computational Biology from a recognized University OR</p>

<p>First class Master’s Degree in Bioinformatics/ Computational Biology from a recognized University with 4 years R &amp; D experience in the related subjects as mentioned above OR</p>

<p>Second class Master’s Degree + Ph.D. in Bioinformatics/ Computational Biology from a recognized University with 4 years research experience in bio-medical subjects</p>

<p>Age: Not exceeding 40 years Consolidated Salary – Rs.39,960/- p.m. + HRA as<br />admissible </p>

<p>Desirable qualification (i) Post-doctorate in Bioinformatics/ Computational Biology or M.E. / M. Tech. Degree in Bioinformatics/ Computational Biology from a recognized University for candidates with First Class relevant degree.</p>

<p>(ii) Additional post-doctoral research / teaching experience in Bioinformatics/Computational Biology in recognized Institute(s).</p>

<p>(iii) Knowledge of computer applications or data management</p>

<p>Job requirements i) To apply Bioinformatics / Computational Biology tools in understanding interactions between vectors and parasites/ pathogens and target based development of drug / insecticides.</p>

<p>ii) To assist the investigators to carry out genomic studies on parasites/pathogens/vectors of vector borne diseases</p>

<p>Advertisement: http://vcrc.res.in/Adv_Bio13.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/researchlabs/view/6835/roslin-bioinformatics-group</guid>
  <pubDate>Mon, 25 Nov 2013 23:55:25 -0600</pubDate>
  <link></link>
  <title><![CDATA[Roslin Bioinformatics Group]]></title>
  <description><![CDATA[
<p>Roslin Bioinformatics Group</p>

<p>The Law group provides internal Institute-specific development, training and support roles for data manipulation, sequence analysis and any other aspect of the analysis of biological data using computer systems. Additionally we provide databases and applications supporting the international animal science community, particularly tools and resources for genome mapping.</p>

<p>Head: Andy Law. Members: John Bowman (animal facility database applications), Zen Lu (bioinformatics support), Trevor Paterson (software development)</p>

<p>More @ http://www.bioinformatics.ed.ac.uk/groups/roslin-bioinformatics-group</p>
]]></description>
</item>

</channel>
</rss>