<?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/32709?offset=580</link>
	<atom:link href="https://bioinformaticsonline.com/related/32709?offset=580" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33859/disco-multi-threaded-and-multiprocess-distributed-memory-overlap-layout-consensus-olc-metagenome-assembler</guid>
	<pubDate>Mon, 10 Jul 2017 10:09:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33859/disco-multi-threaded-and-multiprocess-distributed-memory-overlap-layout-consensus-olc-metagenome-assembler</link>
	<title><![CDATA[DISCO : multi threaded and multiprocess distributed memory overlap-layout-consensus (OLC) metagenome assembler]]></title>
	<description><![CDATA[<p><span>DISCO is a multi threaded and multiprocess distributed memory overlap-layout-consensus (OLC) metagenome assembler. Disco was developed as a&nbsp;scalable assembler to assemble large metagenomes from billions of Illumina sequencing reads of complex microbial communities. Disco was parallelized for computer clusters in a hybrid architecture that integrated shared-memory multi-threading, point-to-point message passing, and remote direct memory access. The assembly and scaffolding were performed using an iterative overlap graph approach.</span></p><p>Address of the bookmark: <a href="http://disco.omicsbio.org/" rel="nofollow">http://disco.omicsbio.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/28564/dbt-%E2%80%93-bioinformatics-industrial-training-programme-biitp-2016-%E2%80%93-17</guid>
	<pubDate>Wed, 27 Jul 2016 04:09:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/28564/dbt-%E2%80%93-bioinformatics-industrial-training-programme-biitp-2016-%E2%80%93-17</link>
	<title><![CDATA[DBT – Bioinformatics Industrial Training Programme (BIITP) 2016 – 17]]></title>
	<description><![CDATA[<p>BIITP is a programme of Department of Biotechnology (DBT), Ministry of Science and Technology, Government of India, managed by Biotech Consortium India Limited (BCIL).The objective of BIITP is to provide an opportunity to bioinformatics students to acquire practical skills and experience by working on projects alongside industry experts as well as to provide an opportunity for the industry to identify potential employees.</p><p><strong>DBT Invites online applications from the bioinformatics&nbsp;students and requisitions from biotech/bioinformatics companies.</strong></p><p><strong>Biotech Industry</strong>&nbsp;:</p><p>Biotech/Bioinformatics companies interested to provide hands on industrial training to the students of Bioinformatics under BIITP may apply online. The companies would have no obligation towards any payments to trainees. The companies would be paid bench fee to cover expenses towards training. Trainees would be provided to companies subject to availability.</p><p><strong>Attn: Bioinformatics Students</strong></p><p>Bioinformatics students interested in training in biotech / bioinformatics companies may apply online.&nbsp;<strong>Stipend of Rs. 10,000/- per month</strong>&nbsp;will be paid to candidates placed for training. The candidates will be selected for training through an interview.</p><p><strong>Eligiblity</strong>&nbsp;:</p><p>a) B.E /B.Tech./M.Sc./M.Tech./Advanced Post Graduate Diploma in Bioinformatics from an Indian recognized university with minimum 55% marks or equivalent grade at highest degree/diploma completed in the year 2015 or 2016 are only eligible to apply.</p><p>b) The Advanced Post Graduate diploma should be of at least one year duration after graduation.</p><p>c)&nbsp; Students whose result of last semester/final year is not declared can also apply mentioning their marks upto the semester/year upto which result declared. The final result with original mark sheet(s) of all the semesters/years will have to be produced at the time of interview.</p><p><strong>Application Procedure</strong>&nbsp;:</p><p>The online application form is available below :</p><p><strong><a href="https://www.biotecnika.org/2016/07/dbt-bioinformatics-industrial-training-programme-biitp-2016-17/?xurl=%3A%2F%2Fwww.bcil.nic.in%2Fbiitp2016-17%2Fregistration1.asp" target="_blank">Application Form For Students (New User)</a></strong></p><p><strong><a href="https://www.biotecnika.org/2016/07/dbt-bioinformatics-industrial-training-programme-biitp-2016-17/?xurl=%3A%2F%2Fwww.bcil.nic.in%2Fbiitp2016-17%2Fregistration.asp%3FT1%3DCompany" target="_blank">Requisition form for companies (New User)</a></strong></p><p><strong><a href="https://www.biotecnika.org/2016/07/dbt-bioinformatics-industrial-training-programme-biitp-2016-17/?xurl=%3A%2F%2Fwww.bcil.nic.in%2Fbiitp2016-17%2Findex1.asp" target="_blank">Already registered User Click Here</a></strong></p><p>The following documents are to be sent to Mr. Manoj Gupta, Manager, Biotech Consortium India Limited, 5th floor, Anuvrat Bhawan, 210, Deen Dayal UpadhyayaMarg, New Delhi-110002.</p><p>More at&nbsp;http://www.bcil.nic.in/biitp2016-17/index.asp</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28592/bioinformatics-technical-position-at-cdac-pune-india</guid>
  <pubDate>Mon, 01 Aug 2016 03:36:26 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Technical Position at CDAC Pune - India]]></title>
  <description><![CDATA[
<p>CDAC Pune Recruitment 2016 – Apply Online for Technical Positions: Department of Information Technology under the Ministry of Communications and Information Technology, Government of India, Centre for Development of Advanced Computing (C-DAC), Pune has advertised notification for the recruitment of Technical vacancies for for PwD candidates n direct recruitment basis. Eligible candidates can apply Online from 27-07-2016 at 10.00 AM to 31-08-2016 at 18.00 PM.. Other information like age limit, educational qualification, selection process &amp; how to apply are given below… </p>

<p>CDAC Pune Vacancy Details:<br />Total No. of Posts: 23 </p>

<p>Name of the Post: Technical </p>

<p>Name of the Discipline:<br />A. Computer Science/ Information Technology and Allied disciplines. </p>

<p>B.Electronics Communications/ Electrical/ Telecommunication/Instrumentation &amp; Control/ Medical Electronics/ Power Electronics/ VLSI &amp; Embedded System and Allied disciplines. </p>

<p>C.Biotechnology/ Bioinformatics/ Health informatics/ Geoinformatics/ Meteorology/ Environmental Science/ Ocean Sciences/Oceanography/Environmental Engineering </p>

<p>1. Visually Impaired: 09 Posts </p>

<p>2. Hearing Impaired: 08 Posts </p>

<p>3. Orthopedically Impaired: 06 Posts </p>

<p>Educational Qualification : Candidates should possess Graduation in relvany discpline with relevant experience. </p>

<p>Selection Process: Candidates will be selected based on applicants performance in interview. </p>

<p>How to Apply: Eligible candidates can apply online through the website www.cdac.in from 27-07-2016 at 10.00 AM to 31-08-2016 at 18.00 PM. </p>

<p>More at http://www.cdac.in/index.aspx?id=current_jobs</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28819/research-project-at-iit-madras</guid>
  <pubDate>Wed, 17 Aug 2016 03:26:06 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Project at IIT, Madras]]></title>
  <description><![CDATA[
<p>Two project positions are available to work on (i) molecular modeling and molecular dynamics simulations and (ii) development of bioinformatics databases and tools at Protein Bioinformatics Lab, Department of Biotechnology, IIT Madras.</p>

<p>Duration : Initially for a period of one year. Extendable based on the performance.</p>

<p>Qualification: (i) MSc in Bioinformatics, Biotechnology, Physics, Biophysics, Biochemistry,Computer Science with NET (UGC/CSIR/GATE/BINC/INSPIRE etc) qualification. (OR) (ii) M. Tech in Bioinformatics, Biotechnology</p>

<p>Additional qualification: Programming skills</p>

<p>Candidates who fulfill the requirements of IIT have the possibility to register for PhD.</p>

<p>Fellowship: Rs.25,000 and HRA.</p>

<p>Applicants are encouraged to send the CV to the coordinator by postal mail and e-mail. The deadline to receive the applications is 31st August 2016. The project coordinator has the discretion to restrict the number of candidates to be called for interview to a reasonable limit on the basis of qualifications and experience higher than the minimum prescribed in the announcement.</p>

<p>Project Co-ordinator:</p>

<p>Dr. M. Michael Gromiha <br />Department of Biotechnology <br />Indian Institute of Technology Madras <br />Chennai 600036 <br />Email: gromiha@iitm.ac.in</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40895/tadpole-an-assembler-error-corrector-and-read-extender</guid>
	<pubDate>Tue, 04 Feb 2020 23:35:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40895/tadpole-an-assembler-error-corrector-and-read-extender</link>
	<title><![CDATA[Tadpole: an assembler, error-corrector, and read-extender]]></title>
	<description><![CDATA[<p><span>Tadpole is a kmer-based assembler, with additional capabilities of error-correcting and extending reads. It does not do any complicated graph analysis or scaffolding, and therefore, is not particularly good for diploid organisms.&nbsp;</span><span>Tadpole is very conservative and optimized for correctness rather than length; which is to say, it stops at every branch, and condenses every repeat. Also, it does not currently do scaffolding.</span></p>
<p>&nbsp;</p>
<p><span><span>To error-correct reads:</span><br><strong>tadpole.sh in=reads.fq out=corrected.fq mode=correct</strong><br><br><span>To extend reads by 50bp in each direction:</span><br><strong>tadpole.sh in=reads.fq out=extended.fq mode=extend el=50 er=50</strong><br><br><span>To error-correct and extend at the same time, using a kmer length of 62:</span><br><strong>tadpole.sh in=reads.fq out=extended.fq mode=extend el=50 er=50 k=62 ecc=t</strong></span></p>
<p>&nbsp;</p>
<p>More at&nbsp;<a href="http://seqanswers.com/forums/showthread.php?t=61445">http://seqanswers.com/forums/showthread.php?t=61445</a></p><p>Address of the bookmark: <a href="https://jgi.doe.gov/data-and-tools/bbtools/bb-tools-user-guide/tadpole-guide/" rel="nofollow">https://jgi.doe.gov/data-and-tools/bbtools/bb-tools-user-guide/tadpole-guide/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</guid>
	<pubDate>Wed, 21 Aug 2013 07:56:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</link>
	<title><![CDATA[Comparison of Short Read De Novo Alignment Algorithms]]></title>
	<description><![CDATA[<p>Excellent article to introduce different sequencing methods along with tools for de novo assembly of sequencing reads and their relevant references.</p>
<p>Title:&nbsp;<strong>Comparison of Short Read De Novo Alignment Algorithms&nbsp;</strong></p>
<p>Author<strong>: Nikhil Gopal</strong></p><p>Address of the bookmark: <a href="http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf" rel="nofollow">http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</guid>
	<pubDate>Thu, 25 Jan 2018 05:47:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</link>
	<title><![CDATA[RGFA: powerful and convenient handling of assembly graphs]]></title>
	<description><![CDATA[<p><span>RGFA, an implementation of the proposed GFA specification in Ruby. It allows the user to conveniently parse, edit and write GFA files. Complex operations such as the separation of the implicit instances of repeats and the merging of linear paths can be performed. A typical application of RGFA is the editing of a graph, to finish the assembly of a sequence, using information not available to the assembler. We illustrate a use case, in which the assembly of a repetitive metagenomic fosmid insert was completed using a script based on RGFA.</span></p>
<p><span>https://github.com/ggonnella/rgfa</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/29217/bioinformatics-openings-at-sri-venkateswara-college-university-of-delhi</guid>
  <pubDate>Tue, 20 Sep 2016 05:43:24 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics openings at Sri Venkateswara College, University of Delhi]]></title>
  <description><![CDATA[
<p>Bioinformatics center</p>

<p>Sri Venkateswara College (University of Delhi)</p>

<p>New Delhi- 110021</p>

<p>1. Junior Research Fellow (1 Post)</p>

<p>Applications are invited for the post of Junior Research Fellow (JRF) under DST funded project which is purely temporary and is strictly for project duration only.</p>

<p>Title of project</p>

<p>No. of post</p>

<p>Remuneration (Rs.)</p>

<p>“Computational assisted Design and Synthesis of Novel Antimalarial Agents Embodying Structural Diversity Suitable for Protease Inhibitors”</p>

<p>(One)</p>

<p>Fellowship and HRA as per DST guidelines</p>

<p>Qualification</p>

<p>Post Graduate Degree in Basic Science (M.Sc./M.Tech in Bioinformatics/Biophysics) from a recognized University in India or abroad with at least 55% marks with NET qualification or Graduate Degree in Professional Course with NET Qualification or Post Graduate Degree in Professional Course.</p>

<p>Desirable</p>

<p>Fair knowledge of Computer Aided Drug Designing (CADD), Protein Structure modeling, molecular docking, and simulations are preferable.</p>

<p>2. Traineeship (1 Post)</p>

<p>Applications are invited for the position of traineeship in DBT-BTISnet funded Bioinformatics Infrastructure Facility (BIF) to carry out project work in the area of Bioinformatics.</p>

<p>Qualification</p>

<p>Applicant should be possess PG degree/PG diploma in Bioinformatics for traineeship. The traineeship is awarded for a period of six months from the date of joining and is not extendable. The selected candidates are entitled to receive a stipend of Rs. 8000/- per month (consolidate) for a period of 6 months.</p>

<p>=====================================================================</p>

<p>3. Studentship (1 Post)</p>

<p>Applications are invited for the position of Studentship in DBT-BTISnet funded Bioinformatics Infrastructure Facility (BIF) to carry out project work in the area of Bioinformatics.</p>

<p>Qualification</p>

<p>Candidates pursuing the Final Year of Post Graduate Degree in Basic Science (M.Sc.) or Post Graduate/ Graduate Degree in Professional Course (M.Tech/B.Tech) in Bioinformatics from a recognized University in India or abroad. The selected candidates are entitled to receive a stipend of Rs. 8000/- per month (consolidate) for a period of 6 months.</p>

<p>How to Apply?</p>

<p>Applicants are required to send applications on plain paper, stating the name, address, date of birth, educational qualification, experience and Institute, along with attested photocopies of mark sheets and certificates etc. by September 20, 2016 to:</p>

<p>The Coordinator</p>

<p>Bioinformatics Center, Sri Venkateswara College</p>

<p>Benito Juarez Road, Dhaula Kuan, New Delhi- 110021</p>

<p>Applications may also be sent by email to contact@bic-svc.ac.in. Strictly mention "Application for JRF, Traineeship or Studentship" in the subject line as the case may be.</p>

<p>Short listed candidates will be called for an interview. Canvassing in any form will be a disqualification. No TA/DA will be paid either for attending the interview or joining the post.</p>

<p>For more details visit our lab webpage: http://www.bic-svc.ac.in</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37291/transrate-understanding-your-transcriptome-assembly</guid>
	<pubDate>Fri, 13 Jul 2018 07:49:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37291/transrate-understanding-your-transcriptome-assembly</link>
	<title><![CDATA[transrate: Understanding your transcriptome assembly]]></title>
	<description><![CDATA[<p><span>Transrate is software for&nbsp;</span><em>de-novo</em><span>&nbsp;transcriptome assembly quality analysis. It examines your assembly in detail and compares it to experimental evidence such as the sequencing reads, reporting quality scores for contigs and assemblies. This allows you to choose between assemblers and parameters, filter out the bad contigs from an assembly, and help decide when to stop trying to improve the assembly.</span></p><p>Address of the bookmark: <a href="http://hibberdlab.com/transrate/index.html" rel="nofollow">http://hibberdlab.com/transrate/index.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29282/cosmic</guid>
	<pubDate>Sat, 01 Oct 2016 15:04:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29282/cosmic</link>
	<title><![CDATA[COSMIC]]></title>
	<description><![CDATA[<p>The accurate description and annotation of structural variants can be complex. &nbsp;This is due to the different resolution that variants are reported from traditional&nbsp;cytogenetic coordinates down to the actual base pair positions. Furthermore, multiple&nbsp;rearrangements in a single area of the genome can make cataloguing and interpreting&nbsp;their effects challenging.&nbsp;</p>
<p>The Rearrangement Overview page describes the one or more breakpoints which make up a structural&nbsp;variant. A breakpoint is defined as a region or point where the sample sequence has altered&nbsp;from the reference sequence. Minimum interpretation is made of this data. One variant event&nbsp;can consist of one or multiple breakpoints. The Syntax (shown above the table) gives a detailed description of the variant and its location &nbsp;(e.g. chr11:g.36585230_76606619del, a deletion of&nbsp;roughly 40Mb on chromosome 11). Syntax is based on HGVS mutation nomenclature recommendations&nbsp;[http://www.hgvs.org/rec.html].&nbsp;</p>
<p>http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview</p><p>Address of the bookmark: <a href="http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview" rel="nofollow">http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>