<?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/36880?offset=1620</link>
	<atom:link href="https://bioinformaticsonline.com/related/36880?offset=1620" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23496/bioinformatics-scientist-at-nin</guid>
  <pubDate>Sat, 25 Jul 2015 22:07:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Scientist at NIN]]></title>
  <description><![CDATA[
<p>No.NIN/PERS/Sch-88/2015-16/</p>

<p>WALK-IN-INTERVIEW (EMPLOYMENT NOTIFICATION)</p>

<p>Eligible candidates are invited to apply for the following post on the ad hoc research project entitled “Biomedical Informatics Centre’s of ICMR” - funded by ICMR at this Institute. The Applications will be received from the individuals on 31st July, 2015 between 9:30 A.M. and 10:30 A.M. at Conference Hall, NIN, Tarnaka, Hyderabad.</p>

<p>Late applications will not be entertained after 10:30 A.M. at any circumstances.</p>

<p>The Candidates may download the Application Form from NIN website: www.ninindia.org</p>

<p>Selection Procedure: Written test and Interview will be conducted to the eligible candidates, if the large numbers of candidates are found to be eligible in the screening. If the lesser number of candidates are found to be eligible in the screening, interview will be conducted only to the short listed candidates for final selection. The names of the shortlisted candidates will be displayed on the Notice Board, which is kept in front of the Conference Hall by 11:30 A.M.</p>

<p>Date of Written Test / Interview: 31st July, 2015. The essential qualification, experience, consolidated Pay and service tenure are as under:</p>

<p>1. Scientist-II (no. of vacancies -1 No.) (UR)</p>

<p>Essential Qualifications :</p>

<p>(i) First Class Master’s Degree in Bio-informatics/ Life Sciences form a recognized University with 4 years R&amp;D experience in the biomedical informatics subject. (or)</p>

<p>(ii) 2nd Class M.Sc./ M.Tech. in Bio-informatics + Ph.D. in the relevant subject from recognized University with 4 years research experience in the biomedical informatics subject. </p>

<p>Age limit : Not exceeding 40 years. Cons.</p>

<p>Pay : Rs.45,954/- p.m. plus 30% HRA p.m. (fixed) without any other allowances.</p>

<p>Tenure : Initially upto 29th February, 2016 and extendable for three more years based on the performance of the candidate and funds position.</p>

<p>Note: Age relaxation will be given to the deserving Candidates. The short listed candidates should bring all original certificates of educational qualification (from SSC onwards), experience, SC/ST/OBC Community Certificate / PH Certificates along with a pass port size photograph and set of Photo copies duly attested for attending the Written Test/Interview. The persons belonging to Other Backward Category should bring the latest O.B.C. (Non-creamy layer) Certificate issued by the respective Tahsildar/ MRO specifically issued for the purpose of applying for Central Government Post. No TA/DA will be paid for attending the Written Test /Interview.</p>

<p>GENERAL CONDITIONS: The conditions of employment will be the same as are for the project staff on contract basis. The candidates have no right to claim for any regular employment at this Institute. The Director In-charge &amp; Appointing Authority has the right to accept / reject any application without assigning any reason/s and no correspondence in this matter will be entertained. </p>

<p>More at http://ninindia.org/31July2015.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33461/graphmap-a-highly-sensitive-and-accurate-mapper-for-long-error-prone-reads</guid>
	<pubDate>Wed, 07 Jun 2017 04:18:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33461/graphmap-a-highly-sensitive-and-accurate-mapper-for-long-error-prone-reads</link>
	<title><![CDATA[GraphMap - A highly sensitive and accurate mapper for long, error-prone reads]]></title>
	<description><![CDATA[<p>GraphMap - A highly sensitive and accurate mapper for long, error-prone reads http://www.nature.com/ncomms/2016/160415/ncomms11307/full/ncomms11307.html<br><br><strong>Features</strong><br><br>&nbsp;&nbsp;&nbsp; Mapping position agnostic to alignment parameters.<br>&nbsp;&nbsp;&nbsp; Consistently very high sensitivity and precision across different error profiles, rates and sequencing technologies even with default parameters.<br>&nbsp;&nbsp;&nbsp; Circular genome handling to resolve coverage drops near ends of the genome.<br>&nbsp;&nbsp;&nbsp; E-value.<br>&nbsp;&nbsp;&nbsp; Meaningful mapping quality.<br>&nbsp;&nbsp;&nbsp; Various alignment strategies (semiglobal bit-vector and Gotoh, anchored).<br>&nbsp;&nbsp;&nbsp; Overlapping of reads for de novo assembly.<br>&nbsp;&nbsp;&nbsp; Transcriptome mapping through internal construction of a transcriptome from a given genomic reference and a GTF file.<br>&nbsp;&nbsp;&nbsp; ...and much more.<br><br>GraphMap is also used as an overlapper in a new de novo genome assembly project called Ra (https://github.com/mariokostelac/ra-integrate).<br>Ra attempts to create de novo assemblies from raw nanopore and PacBio reads without requiring error correction, for which a highly sensitive overlapper is required.<br><br>Currently, development of a new spliced-alignment mode for mapping RNA-seq reads is under way.<br>Description of the current effort as well as how to reach the experimental implementation can be found here: doc/rnaseq.md.</p><p>Address of the bookmark: <a href="https://github.com/isovic/graphmap" rel="nofollow">https://github.com/isovic/graphmap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/23680/five-key-traits-to-seek-out-in-potential-bioinformatics-candidates</guid>
	<pubDate>Mon, 10 Aug 2015 12:53:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/23680/five-key-traits-to-seek-out-in-potential-bioinformatics-candidates</link>
	<title><![CDATA[Five key traits to seek out in potential bioinformatics candidates !!!]]></title>
	<description><![CDATA[<p>Genomics and proteomics data are being collected in bulk, but mostly, traditional biologist don&rsquo;t know what to do with it. Perhaps this is the reason why (not only this!!! ) computational biologist/bioinformatics scientists are hot commodities in the research world.</p><p>In fact, there are huge demands for expert biological data analyst. It&rsquo;s a fairly new &nbsp;(not exactly) hot area, these bioinformatician are invaluable because they know and understand the significance of biological data for your research and how you can use it for better understanding of biological problems.</p><p>The bioinformatics can discover biological patterns and stories in genomic and proteomics data. They can develop the pipeline needed to properly collect, store and analyse it.</p><p><img src="http://bioinformaticsonline.com/mod/photo/hire.gif" alt="image" style="border: 0px;"></p><p>Once your research group is ready to make a larger investment and hire a bioinformatician to gain a competitive edge, there are several key traits to seek out in potential candidates. The best bioinformatician are:</p><p>1. Highly Skilled - programming skills, experience with the biological software and tools.</p><p>The biological data won&rsquo;t illuminate much if the scientist analysing it doesn&rsquo;t possess practical programming skills, experience with the biological software and tools and a thorough understanding of basic biological stuff. A solid background in mathematics and statistics is also an indispensable trait.</p><p>2. Insight - Real vision, robust understanding and deep insight.</p><p>In order to hire the best bioinformatics and computational biologist scientist for your needs, it is always recommended and mostly practiced by the recruiters, to ask each contender to write and develop a sample script/presentation based on a specific set of data you provide. Then, explore the approaches used to deal with data provided and pick up those candidates who convey real vision, robust understanding and deep insight.</p><p>3. Energetic &ndash; Curiosity to explore</p><p>Mostly natural curiosity and enthusiasm for solving big biological problems coupled with an ability to transform data into a scientific stories may place one candidate above the rest. In addition to achieve that, the bioinformatician should be agile enough to quickly modify their methods to suit changes within a particular research.</p><p>4. Researcher &ndash; Publications</p><p>Look for someone who has a keen sense and understanding of concern biological problems. You can judge it by looking at previously published papers and data. It is always recommended to have a look at GitHub and other repository for codes written by her/him.</p><p>5. Impressive communicator - Insight that can&rsquo;t be expressed is worthless.</p><p>Good bioinformatics scientists are able to uncover biological patterns and are willing to explain those patterns in clear and helpful ways through thoughtful and open communication. In other words, they should must have good scientific writing skills. A computational biologis/bioinformatician&nbsp; should know how to present the data and tell a scientific story through numbers/images.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/34702/run-miniasm-assembler-on-nanopore-reads</guid>
	<pubDate>Mon, 18 Dec 2017 04:07:50 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/34702/run-miniasm-assembler-on-nanopore-reads</link>
	<title><![CDATA[Run miniasm assembler on nanopore reads !]]></title>
	<description><![CDATA[<p>Miniasm is a very fast OLC-based&nbsp;<em>de novo</em>&nbsp;assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>) as input and outputs an assembly graph in the&nbsp;<a href="https://github.com/pmelsted/GFA-spec/blob/master/GFA-spec.md">GFA</a>&nbsp;format. Different from mainstream assemblers, miniasm does not have a consensus step. It simply concatenates pieces of read sequences to generate the final&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php/Celera_Assembler_Terminology">unitig</a>&nbsp;sequences. Thus the per-base error rate is similar to the raw input reads.</p><p>Find the detail of the reads repeats:</p><blockquote><p>fq2fa ONT_A.fastq ONT_A.fasta&nbsp;<br /><br />minimap2 -xava-ont ONT_A.fasta ONT_A.fasta -t10 -X &gt; AONT.paf&nbsp;<br /><br />awk '{if($1==$6){print}}' AONT.paf &gt; AONTself.paf&nbsp;<br /><br />awk '$5=="-"' AONTself.paf | awk '{print $1}'| sort|uniq &gt; invertedrepeat.list</p></blockquote><p>Generated a few palindrome and repeats plots (highlighting only repeats largest than 10, 20 and 30 kb)</p><blockquote><p>minidot -f 5 -m 30000 AONTself.paf &gt; AONTself30000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself30000.eps &gt; AONTself30000final.eps&nbsp;<br /><br />minidot -f 5 -m 20000 AONTself.paf &gt; AONTself20000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself20000.eps &gt; AONTself20000final.eps&nbsp;<br /><br />minidot -f 5 -m 10000 AONTself.paf &gt; AONTself10000.eps&nbsp;<br />sed 's/_template_pass_FAH31515//' AONTself10000.eps &gt; AONTself10000final.eps&nbsp;</p></blockquote><p>Assemble with miniasm:</p><blockquote><p>miniasm -f ONT_A.fasta AONT.paf &gt; AONT.gfa&nbsp;</p><p>grep '^S' AONT.gfa |awk '{print "&gt;"$2"\n"$3}' &gt; AONT_miniasm.fasta&nbsp;<br /><br />minimap2 -xasm10 AONT_miniasm.fasta AONT_miniasm.fasta -t1 -X &gt; AONT_miniasm.paf&nbsp;<br /><br />awk '{if($1==$6){print}}' AONT_miniasm.paf &gt; AONT_miniasm_self.paf&nbsp;<br /><br />minidot -f 5 -m 10000 AONT_miniasm_self.paf &gt; AONT_miniasm_self10000.eps&nbsp;</p></blockquote><p>Njoy the assembly !</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23912/jrf-in-bioinformatics-central-university-of-rajasthan</guid>
  <pubDate>Thu, 20 Aug 2015 05:28:21 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF in Bioinformatics @ Central University of Rajasthan]]></title>
  <description><![CDATA[
<p>Central University of Rajasthan<br />Department of Biotechnology<br />School of Life Sciences<br />Bandarsindri, Distt. Ajmer</p>

<p>Applications are invited for one JRF position supported by DST sponsored project in Bioinformatics with Dr. Tarun Kumar Bhatt.</p>

<p>Title of the project: Molecular Modeling of malaria parasite ‘secretome’: A potential drug target</p>

<p>Fellowship: Rs. 14000 consolidated</p>

<p>Duration of project: 36 months.</p>

<p>Essential Qualification: Master’s degree in Biotechnology/Bioinformatics with minimum 55% marks. Age limit as per government rule.</p>

<p>Candidates with good experience of molecular modeling, In-silico screening, MD simulation and database formation will be preferred. Good knowledge of Linux operating system is desirable.</p>

<p>How to apply: Interested candidate can send soft copy of application in format given below to tarun@curaj.ac.in on or before 29/08/2015.</p>

<p>1. Name<br />2. Fathers name<br />3. Date of Birth<br />5. Age<br />6. Sex<br />7. Address<br />8. Telephone / mobile no.<br />9. Email:<br />10. Academic qualifications starting from 10th class.<br />11. Summary of experience in molecular modeling, In-silico screening and database formation.</p>

<p>General Conditions:</p>

<p>1.Selected candidate would be informed for date and time of the interview via email .<br />2. No TA/DA will be paid for attending the interview.</p>

<p>More at http://www.curaj.ac.in/2015/Rec/aug/Advertisement%20for%20post%20of%20JRF%20under%20DST%20project%28BioTech%29.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36512/hisat2-a-fast-and-sensitive-alignment-program-for-mapping-next-generation-sequencing-reads</guid>
	<pubDate>Tue, 08 May 2018 04:27:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36512/hisat2-a-fast-and-sensitive-alignment-program-for-mapping-next-generation-sequencing-reads</link>
	<title><![CDATA[HISAT2: a fast and sensitive alignment program for mapping next-generation sequencing reads]]></title>
	<description><![CDATA[<p><strong>HISAT2</strong><span>&nbsp;is a fast and sensitive alignment program for mapping next-generation sequencing reads (both DNA and RNA) to a population of human genomes (as well as to a single reference genome). Based on an extension of BWT for graphs&nbsp;</span><a href="http://dl.acm.org/citation.cfm?id=2674828">[Sir&eacute;n et al. 2014]</a><span>, we designed and implemented a graph FM index (GFM), an original approach and its first implementation to the best of our knowledge. In addition to using one global GFM index that represents a population of human genomes, HISAT2 uses a large set of small GFM indexes that collectively cover the whole genome (each index representing a genomic region of 56 Kbp, with 55,000 indexes needed to cover the human population). These small indexes (called local indexes), combined with several alignment strategies, enable rapid and accurate alignment of sequencing reads. This new indexing scheme is called a Hierarchical Graph FM index (HGFM).&nbsp;</span></p>
<p><span>more at&nbsp;https://ccb.jhu.edu/software/hisat2/index.shtml</span></p><p>Address of the bookmark: <a href="https://github.com/infphilo/hisat2" rel="nofollow">https://github.com/infphilo/hisat2</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24074/bioinformatics-training-fellowship</guid>
  <pubDate>Fri, 28 Aug 2015 16:02:25 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Training Fellowship !!]]></title>
  <description><![CDATA[
<p>Applications are invited from suitable candidates for six months ‘Training Fellowship’ in Bioinformatics under the BTISNET program of DBT in the Distributed Information Sub center (DISC) facility at NIPGR, New Delhi, under the supervision of Dr. Gitanjali Yadav, Scientist, NIPGR.</p>

<p>Project Title 	No. of post(s) 	Designation 	Stipend in  	Tenure 	Start 	End<br />Establishment of Distributed Information Sub-Centre (DISC) 	02 	Trainee Fellow / Student Fellow 	5,000/- p.m 	Six months 	01/01/2016 	30/06/2016</p>

<p>Essential Qualification: </p>

<p>Traineeship: Candidate having B.Tech or Master Degree or equivalent in Bioinformatics/ Biotechnology with strong interest in Computational Biology and First class/ division throughout academic career may apply. </p>

<p>Studentship: Students currently pursuing the final year of B.Tech or Masters Degree or equivalent in Bioinformatics/ Biotechnology, requiring a thesis as a necessary pre-requisite for completion of respective degree and First class/ division throughout academic career may apply.</p>

<p>Desirable Qualification: Proficiency in Coding Algorithms and Bioinformatics Applications, evidenced by short trainings or computing courses.</p>

<p>The positions are purely temporary and co-terminus with the tenure of the training period as mentioned above. NIPGR reserves the right to select the candidate against the above fellowship depending upon the qualification and experience of the candidate. Reservations shall be as per Govt. of India norms. The applicants will have no claim implicit or explicit for consideration against any regular position of DISC/NIPGR.</p>

<p>Eligible candidates may apply online application form available</p>

<p>at http://www.nipgr.res.in/discform.html within 15 days from the date of</p>

<p>advertisement.Applications received through any other mode will be disqualified outright. </p>

<p>More at http://www.nipgr.res.in/discform.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36755/minialign-fast-and-accurate-alignment-tool-for-pacbio-and-nanopore-long-reads</guid>
	<pubDate>Thu, 24 May 2018 08:33:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36755/minialign-fast-and-accurate-alignment-tool-for-pacbio-and-nanopore-long-reads</link>
	<title><![CDATA[minialign: fast and accurate alignment tool for PacBio and Nanopore long reads]]></title>
	<description><![CDATA[Minialign is a little bit fast and moderately accurate nucleotide sequence alignment tool designed for PacBio and Nanopore long reads. It is built on three key algorithms, minimizer-based index of the minimap overlapper, array-based seed chaining, and SIMD-parallel Smith-Waterman-Gotoh extension.<p>Address of the bookmark: <a href="https://github.com/ocxtal/minialign" rel="nofollow">https://github.com/ocxtal/minialign</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36921/breakpointer-using-local-mapping-artifacts-to-support-sequence-breakpoint-discovery-from-single-end-reads</guid>
	<pubDate>Tue, 12 Jun 2018 12:41:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36921/breakpointer-using-local-mapping-artifacts-to-support-sequence-breakpoint-discovery-from-single-end-reads</link>
	<title><![CDATA[Breakpointer: using local mapping artifacts to support sequence breakpoint discovery from single-end reads]]></title>
	<description><![CDATA[Breakpointer is a fast tool for locating sequence breakpoints from the alignment of single end reads (SE) produced by next generation sequencing (NGS). It adopts a heuristic method in searching for local mapping signatures created by insertion/deletions (indels) or more complex structural variants(SVs).<p>Address of the bookmark: <a href="https://github.com/ruping/Breakpointer" rel="nofollow">https://github.com/ruping/Breakpointer</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24364/ra-bioinformatics-at-university-of-delhi</guid>
  <pubDate>Thu, 10 Sep 2015 16:02:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at University of Delhi]]></title>
  <description><![CDATA[
<p>BIOINFORMATICS INFRASTRUCTURE FACILITY</p>

<p>GARGI COLLEGE (University of Delhi)</p>

<p>SiriFort Road, New Delhi-110049</p>

<p>Walk- in- interview Bioinformatics Infrastructure Facility (BIF), Gargi College, University of Delhi invites to appear for interview on 29th September, 2015 at 9.30 AM for filling up the following purely temporary position sponsored by DBT, New Delhi.</p>

<p>1. Traineeship – 01 (one post) purely temporary for a period of six months.</p>

<p>Salary: Rs.8000/- p.m. fixed.</p>

<p>Essential Qualification: Post Graduate degree in Bioinformatics or any other branch of Life Sciences preferably with dissertation in Bioinformatics.</p>

<p>Desirable Qualification: Prior knowledge of programming languages such as C, VB, SQL etc. and software/database development.</p>

<p>2. Research Associate-01(one post) purely temporary for a period of nine months.</p>

<p>Salary: Rs 36000/-+HRA p.m fixed.</p>

<p>Essential Qualification: PhD in Bioinformatics/Biological Sciences/Computer Science or allied sciences with proven experience in bioinformatics.</p>

<p>3. Studentship- 01 (one post) purely temporary for a period of six months.</p>

<p>Salary: Rs.8000/- p.m. fixed.</p>

<p>Essential Qualifications: Final year Post Graduate students pursuing a degree in Bioinformatics or any branch of Life Science with knowledge of bioinformatics.</p>

<p>Interested candidates are required to appear for the walk in interview on 29th September, 2015 at 9.30 AM in Principal’s Office, Gargi College, Sirifort Road, N. Delhi-110049, with their CVs, original documents and a set of Photostat copies of all original documents. Conditions: The original documents must be produced at the time of interview, otherwise will not be allowed to attend the same. No TA &amp; DA will be paid for appearing in the interview. The institute reserves the right to fill or not to fill the positions depending upon qualifications/credentials of the candidates etc. The appointment does not confer any right over the job and will not be considered as institute’s service. Dr Aparajita Mohanty Dr Shashi Tyagi (Co-coordinator,BIF) (Coordinator, BIF)</p>

<p>Advertisement:</p>

<p>http://gargi.du.ac.in/uploads/ngrey/News/Gargi_Advt_BIF_2015.pdf</p>
]]></description>
</item>

</channel>
</rss>