<?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/29384?offset=660</link>
	<atom:link href="https://bioinformaticsonline.com/related/29384?offset=660" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21619/research-associate-biotechnologyjrflab-assistant-indian-institute-of-vegetable-research-iivr-varanasi-uttar-pradesh</guid>
  <pubDate>Wed, 11 Mar 2015 08:59:27 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Biotechnology/JRF/Lab. Assistant  Indian Institute of Vegetable Research (IIVR) - Varanasi, Uttar Pradesh]]></title>
  <description><![CDATA[
<p>F. No.: 2-19/2011-Adm.I </p>

<p>Research Associate Biotechnology /JRF / Lab. Assistant recruitment in Indian Institute of Vegetable Research </p>

<p>Project:<br />Genomics assisted selection of Solanum chilense introgression lines for enhancing drought tolerance in tomato <br />Post Name : Research Associate <br />Qualification : Ph.D in Biotechnology/ Bioinformatics/Genetics &amp; Plant Breeding. M. Tech in Computer Science with at least one research paper in science citation indexed journal. Desirable: Experience in bioinformatics and next generation sequence data handling. Familiarity in Linux, R, Perl/Phython or other programming languages. Willingness to travel to European partner centers. </p>

<p>Pay Scale : Rs. 36000 for 1st and 2nd year as per rules for Research Associate. Rs. 25000/- for 1st and 2nd year and Rs. 28000 as per rules for Junior Research Fellow. Rs. 7000/- for Lab. Assistant. </p>

<p>Age : Not more than 35 years for Men and 40 years for Women (Relaxable for SC/ST/OBC/PH candidates as per rules) for Research Associate/ Junior Research Fellow. Minimum age will be 21 years and maximum age will be 45 years (Relaxable for SC/ST/OBC/PH candidates as per rules) for Lab.Assistant.</p>

<p>More at http://iivr.org.in/Job%20Oppurtunities/RA20.03.2015.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34416/miniasm-very-fast-olc-based-de-novo-assembler-for-noisy-long-reads</guid>
	<pubDate>Mon, 27 Nov 2017 07:58:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34416/miniasm-very-fast-olc-based-de-novo-assembler-for-noisy-long-reads</link>
	<title><![CDATA[miniasm: very fast OLC-based de novo assembler for noisy long 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>So far miniasm is in early development stage. It has only been tested on a dozen of PacBio and Oxford Nanopore (ONT) bacterial data sets. Including the mapping step, it takes about 3 minutes to assemble a bacterial genome. Under the default setting, miniasm assembles 9 out of 12 PacBio datasets and 3 out of 4 ONT datasets into a single contig. The 12 PacBio data sets are&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/E.-coli-Bacterial-Assembly">PacBio E. coli sample</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS473430">ERS473430</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS544009">ERS544009</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS554120">ERS554120</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS605484">ERS605484</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS617393">ERS617393</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS646601">ERS646601</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS659581">ERS659581</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS670327">ERS670327</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS685285">ERS685285</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS743109">ERS743109</a>&nbsp;and a&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/E.-coli-20kb-Size-Selected-Library-with-P6-C4/ce0533c1d2a957488594f0b29da61ffa3e4627e8">deprecated PacBio E. coli data set</a>. ONT data are acquired from the&nbsp;<a href="http://lab.loman.net/2015/09/24/first-sqk-map-006-experiment/">Loman Lab</a>.</p>
<p>For a&nbsp;<em>C. elegans</em>&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/C.-elegans-data-set">PacBio data set</a>&nbsp;(only 40X are used, not the whole dataset), miniasm finishes the assembly, including reads overlapping, in ~10 minutes with 16 CPUs. The total assembly size is 105Mb; the N50 is 1.94Mb. In comparison, the&nbsp;<a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/HGAP">HGAP3</a>produces a 104Mb assembly with N50 1.61Mb.&nbsp;<a href="http://lh3lh3.users.sourceforge.net/download/ce-miniasm.png">This dotter plot</a>&nbsp;gives a global view of the miniasm assembly (on the X axis) and the HGAP3 assembly (on Y). They are broadly comparable. Of course, the HGAP3 consensus sequences are much more accurate. In addition, on the whole data set (assembled in ~30 min), the miniasm N50 is reduced to 1.79Mb. Miniasm still needs improvements.</p>
<p>Miniasm confirms that at least for high-coverage bacterial genomes, it is possible to generate long contigs from raw PacBio or ONT reads without error correction. It also shows that&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>&nbsp;can be used as a read overlapper, even though it is probably not as sensitive as the more sophisticated overlapers such as&nbsp;<a href="https://github.com/marbl/MHAP">MHAP</a>&nbsp;and&nbsp;<a href="https://github.com/thegenemyers/DALIGNER">DALIGNER</a>. Coupled with long-read error correctors and consensus tools, miniasm may also be useful to produce high-quality assemblies.</p>
<p>Minimap and miniasm are ultrafast tools for (i) mapping and (ii) assembly. Designed for long, noisy reads, they do not have a correction or consensus step, and therefore the resulting assemblies are contiguous (i.e. long) but very noisy (i.e. full of errors)</p>
<p>We start with an all against all comparison:</p>
<div>
<pre><code>minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq | gzip -1 &gt; reads.paf.gz
</code></pre>
</div>
<p>Then we can assemble</p>
<div>
<pre><code>miniasm -f reads.fq reads.paf.gz &gt; reads.gfa
</code></pre>
</div>
<p>Convert GFA to FASTA:</p>
<div>
<pre><code>awk <span>'/^S/{print "&gt;"$2"\n"$3}'</span> reads.gfa | fold &gt; reads.fa
</code></pre>
</div>
<p>And then count how many contigs:</p>
<div>
<pre><code>grep <span>"&gt;"</span> reads.fa | wc -l</code></pre>
</div>
<p>&nbsp;</p>
<pre><span><span>#</span> Download sample PacBio from the PBcR website</span>
wget -O- http://www.cbcb.umd.edu/software/PBcR/data/selfSampleData.tar.gz <span>|</span> tar zxf -
ln -s selfSampleData/pacbio_filtered.fastq reads.fq
<span><span>#</span> Install minimap and miniasm (requiring gcc and zlib)</span>
git clone https://github.com/lh3/minimap <span>&amp;&amp;</span> (cd minimap <span>&amp;&amp;</span> make)
git clone https://github.com/lh3/miniasm <span>&amp;&amp;</span> (cd miniasm <span>&amp;&amp;</span> make)
<span><span>#</span> Overlap</span>
minimap/minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq <span>|</span> gzip -1 <span>&gt;</span> reads.paf.gz
<span><span>#</span> Layout</span>
miniasm/miniasm -f reads.fq reads.paf.gz <span>&gt;</span> reads.gfa</pre><p>Address of the bookmark: <a href="https://github.com/lh3/miniasm" rel="nofollow">https://github.com/lh3/miniasm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23626/walk-ins-for-ra-jrf-and-srf-post-in-nbagr-karnal</guid>
  <pubDate>Tue, 04 Aug 2015 18:50:07 -0500</pubDate>
  <link></link>
  <title><![CDATA[Walk-ins for RA, JRF and SRF post in NBAGR, Karnal]]></title>
  <description><![CDATA[
<p>ICAR-NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES<br />Near Basant Vihar G.T. Road Bypass P.O. Box No.129,<br />Karnal-132001 (Haryana)</p>

<p>A walk-in-Interview is proposed to be held at National Bureau of Animal Genetic Resources, Karnal (Haryana)-132001 at 10:30 AM on 19.08.2015 to select One Research Associate &amp; Three Senior Research Fellow as per details given below:</p>

<p>Name of the project &amp; project period: ICAR Consortium Platform on Genomics.</p>

<p>The post duration is Upto 31.03.2017 or earlier &amp; Co-terminus with the project.</p>

<p>Upto 31.03.2017 or earlier and Coterminus with the project</p>

<p>Essential Qualifications: PhD degree in Bioinformatics OR Master’s degree in Bioinformatics with 4 years/5 years of Bachelor’s degree having 1st division or 60% marks or equivalent overall grade point average, with at least two years of research experience as evidenced from Fellowship/Associateship</p>

<p>Desirable: Working experience in Next Generation Sequencing data analysis</p>

<p>Emolument: Research Associates may be fixed at a consolidated amount at one of the two pay levels given below depending upon the qualification &amp; experience.</p>

<p>I. Research Associate – Master Degree Holders Rs. 38,000/ + HRA II. Research Associate – Doctoral Degree Holder Rs. 40,000/ + HRA</p>

<p>Senior Research Fellow: Two:- Bioinformatics One: - Biotechnology.</p>

<p>Duration of engagement: Upto 31.03.2017 or earlier and Coterminus with the project</p>

<p>Essential Qualifications: Master degree in any one of discipline/ Subjects- Biotechnology/Bioinformatics with 4 years/5 years of Bachelor’s degree.</p>

<p>Candidates having post graduate degree in above mentioned subjects with 3 years Bachelor’s degree should have NET qualification.</p>

<p>Desirable: The candidates should have zeal to work in R environment and NGS data analysis Emolument: Rs. 28,000/- per month + HRA as per admissibility</p>

<p>Age Limit: 1. 40 year for Men and 45 years for Women in case of RA on the date of Interview. 2. 35 year for Men and 40 years for Women in case of SRF on the date of Interview. (Relaxation for SC/ST/OBC and PHC as per GOI/ICAR rules) The above positions are purely temporary and will be filled in on Contractual basis. The selected candidate shall have no right/claim for regular appointment at this Institute, as the engagement is co-terminus with the Project/Scheme.</p>

<p>Interested candidates may attend Walk-in-Interview at 10:30 AM on 19.08.2015 alongwith original certificates and typed bio-data with one set of attested copies of each their certificates with passport size photograph. No TA/DA will be paid for attending the interview. All eligible candidates are advised to be present at least 30 minutes before scheduled time on the date of interview for completing necessary formalities. Canvassing in any form will disqualify the candidates. </p>

<p>More at http://210.212.93.85/Advertisiment3.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35899/reference-free-prediction-of-rearrangement-breakpoint-reads</guid>
	<pubDate>Thu, 08 Mar 2018 05:05:25 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35899/reference-free-prediction-of-rearrangement-breakpoint-reads</link>
	<title><![CDATA[Reference-free prediction of rearrangement breakpoint reads]]></title>
	<description><![CDATA[<p><span>lideSort-BPR (&nbsp;</span><span>b</span><span>&nbsp;reak&nbsp;</span><span>p</span><span>&nbsp;oint&nbsp;</span><span>r</span><span>&nbsp;eads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing depth of 100&times;, it finds &sim;88% of the breakpoints correctly with no false-positive reads. Moreover, evaluation on a real prostate cancer dataset shows that the proposed method predicts more fusion transcripts correctly than previous approaches, and yet produces fewer false-positive reads. To our knowledge, this is the first method to detect breakpoint reads without using a reference genome.</span></p>
<p><span>https://github.com/ewijaya/slidesort-bpr</span></p><p>Address of the bookmark: <a href="https://code.google.com/archive/p/slidesort-bpr/" rel="nofollow">https://code.google.com/archive/p/slidesort-bpr/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/21794/research-associate-biotechnology-bioinformatics-in-national-research-centre-on-plant-biotechnology-%E2%80%93-new-delhi</guid>
  <pubDate>Sun, 29 Mar 2015 21:13:14 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate (Biotechnology, Bioinformatics) In National Research Centre on Plant Biotechnology – New Delhi]]></title>
  <description><![CDATA[
<p>Pay Scale:Rs.24000+ 30% HRA) for Ph.D. and for M. Sc Rs.23000/‐ (+ 30% HRA)<br />Educational Requirements:Ph.D. Degree in Bioinformatics/Molecular Biology/Biotechnology/ Genetics/allied sciences; or M. Sc in Bioinformatics/ Biotechnology/Life Sciences/ allied sciences with 1st division or 60% marks or equivalent overall grade point average with at least two years of research experience as evidenced from Fellowship/ Associate ship<br />Experience Requirements:2 years research experience in bioinformatic data analysis/molecular biology techniques, and high throughput DNA/RNA sequencing, and transcriptome data analysis. Research paper with IF&gt;1 will be desirable<br />+Details will be available at: http://www.nrcpb.org/sites/default/files/ICAR-NPTC%20DBT%20RA%20SRF%20interview%2024th%20March.pdf</p>

<p>No of Post: 01<br />How To Apply: Walk-in interview will be held on 24-03-2015 at 10:00 AM at NRCPB, New Delhi for filling Research Associate and Senior Research Fellow positions as mentioned below. The positions are temporary and are initially offered for a period of one year. Details such as emoluments, qualifications, application format etc., are given below. Desirous candidates should report for interview latest by 10:30 AM with the application in the prescribed format, copies and originals of certificates, thesis and documents. No TA/DA will be provided for attending the interview<br />General Instructions: The positions are purely temporary, on a contractual basis and are initially offered for one year. The period and duration of the scheme is tentative and the same may change. The person employed will have no right to claim employment or engagement in ICAR at the end of the contract period. No TA/DA will be provided for appearing in the interview. Persons already in employment should bring “No Objection Certificate” from their present employer. The candidates must bring with them five copies of the CV in the format given below along with original documents such as t h e s i s , degree certificates, marks sheets, publications, experience certificate etc. for verification and one set of self attested copy of all certificates. The decision of the Project Director of this Institute will be final and binding in all aspects. In case of any disputes, it will be resolved within the jurisdiction of New Delhi Court only.<br />Detail of Interview: 24-03-2015<br />Age Limit: 35 Years<br />Contact Details: Ph: 011-25848783; Fax: 25843984</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</guid>
	<pubDate>Tue, 15 May 2018 02:53:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</link>
	<title><![CDATA[TAREAN: A computational tool for identification and characterization of satellite DNA from unassembled short reads]]></title>
	<description><![CDATA[<p><strong>TA</strong>ndem&nbsp;<strong>RE</strong>peat&nbsp;<strong>AN</strong>alyzer -TAREAN &ndash; is a computational pipeline for&nbsp;<strong>unsupervised identification of satellite repeats</strong>&nbsp;from unassembled sequence reads. The pipeline uses low-pass whole genome sequence reads and performs their graph-based clustering. Resulting clusters, representing all types of repeats, are then examined for the presence of circular structures and putative satellite repeats are reported.</p>
<p><em><strong>How to use TAREAN</strong></em>:</p>
<ul>
<li>Install a local instance of the pipeline using its source code available from&nbsp;<a href="https://bitbucket.org/petrnovak/repex_tarean" target="_blank" title="TAREAN source code">bitbucket repository</a>.</li>
<li>Use&nbsp; public Galaxy-based server at&nbsp;<a href="https://repeatexplorer-elixir.cerit-sc.cz/" target="_blank">https://repeatexplorer-elixir.cerit-sc.cz/</a>. The server is provided in frame of the&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank">Elixir CZ project</a>&nbsp;and is maintained by&nbsp;<a href="https://www.cesnet.cz/" target="_blank">CESNET</a>&nbsp;and&nbsp;<a href="https://www.cerit-sc.cz/en/index.html" target="_blank">CERIT-SC</a>. Simple registration is required to use this service.</li>
</ul>
<p>Development of TAREAN was supported by&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank" title="ELIXIR-CZ">ELIXIR CZ</a>&nbsp;research infrastructure project (MEYS Grant No: LM2015047).</p>
<p><strong><em>References</em></strong></p>
<p>Novak, P., Avila Robledillo, L., Koblizkova, A., Vrbova, I., Neumann, P., Macas, J. (2017) &ndash;&nbsp;<a href="https://academic.oup.com/nar/article/3574061/" target="_blank">TAREAN: a computational tool for identification and characterization of satellite DNA from unassembled short reads</a>.&nbsp;<em>Nucleic Acids Res.</em>, doi:10.1093/nar/gkx257</p><p>Address of the bookmark: <a href="https://bitbucket.org/petrnovak/repex_tarean" rel="nofollow">https://bitbucket.org/petrnovak/repex_tarean</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22147/research-associate-bioinformatics-job-position-in-nipgr</guid>
  <pubDate>Sun, 19 Apr 2015 14:55:19 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatics job position in NIPGR]]></title>
  <description><![CDATA[
<p>NIPGR Recruitment 2015 – Apply for Research Associate Posts</p>

<p>NIPGR is commonly known as National Institute of Plant Genome Research. Recently, it’s great opportunity for those candidates who are interested to do job in NIPGR. National Institute of Plant Genome Research (NIPGR) had found to build a bridge between the branches of natural sciences and due this connection it is steeping on the heaps of success. Its objectives to preserve, research, production and the advancement in the trait are very clear and also being appreciated by the nation and had been contributing for the further enrichment of the institute. NIPGR had announced the recruitment to further make improvements and amendments by the young potential in their panel. The recruitment is being announced for the post is mentioned below. We are giving a complete information to applicants for find their eligibility as per desired post under NIPGR Recruitment 2015 project but if the candidates are not satisfied with this information then they can download an official advertisement of NIPGR recruitment 2015 from the link defined ahead under the head of reference.</p>

<p>NIPGR Recruitment 2015 for the 1 post of Research Associate: National Institute of Plant Genome Research (NIPGR) had instigated the progression of the recruitment and this process is linked thoroughly so as the 1 post of Research Associate. Applicants are associated and linked with the education to be PHD degree in the life science, biotechnology, bioinformatics or molecular biology. Applicants are associated with the dispatch of the application along with the required certificates so as on the date of 24th Feb 2015.</p>

<p>The recruitment notification and application @ http://www.nipgr.res.in/careers/vacancies_latest.php#</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36800/genomemapper-simultaneous-alignment-of-short-reads-against-multiple-genomes</guid>
	<pubDate>Fri, 25 May 2018 09:29:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36800/genomemapper-simultaneous-alignment-of-short-reads-against-multiple-genomes</link>
	<title><![CDATA[GenomeMapper: Simultaneous alignment of short reads against multiple genomes]]></title>
	<description><![CDATA[GenomeMapper is a short read mapping tool designed for accurate read alignments. It quickly aligns millions of reads either with ungapped or gapped alignments. It can be used to align against multiple genomes simulanteously or against a single reference. If you are unsure which one is the appropriate GenomeMapper, you might want to use the latter

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2768987/<p>Address of the bookmark: <a href="http://1001genomes.org/software/genomemapper.html" rel="nofollow">http://1001genomes.org/software/genomemapper.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/22073/bcil-bioinformatics-bitp-application</guid>
	<pubDate>Fri, 17 Apr 2015 04:34:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22073/bcil-bioinformatics-bitp-application</link>
	<title><![CDATA[BCIL Bioinformatics BITP Application !!]]></title>
	<description><![CDATA[<p>BCIL Bioinformatics BITP Application Form 2015 logoGrab latest Information! Biotech Consortium India Limited has announced a notification for offering admission in Biotech Industrial Training Program. The organization has invited online application from 7th April 2015 BCIL Admission 2015. BCIL has conducted an entrance exam which is scheduled on 20th June 2015. Candidates those who are looking for this program just go for it and don&rsquo;t miss this opportunity.<br /><br />To apply for Biotech Industrial Training Programme the candidates should have 50% marks in B.Tech/BE/M.Tech Degree in Bio technology, bio process technology and other related disciplines form any recognized institution. The organization has decided application fee of Rs.500/- for all candidates and that should be paid through demand draft. Applicants who satisfy the organization requirement, they can take their steps forward.<br /><br />Candidates should submit the online application before 10th May 2015. After registering the online application you need to take the hard copy of it and send through post. Print out of this application should be reached before 15th May 2015. All the latest updates like selection process, exam syllabus and other related information are updated soon at the main URL of the department and aspirants should keep in touch with this site. Further details of BCIL Bioinformatics BITP Application Form 2015 are explained below.<br /><br />Organization: Biotech Consortium India Limited<br /><br />Website URL: www.bcil.nic.in<br /><br />Location: New Delhi<br /><br />Course Name: Biotech Industrial Training Program<br /><br />Exam Name: BCIL Entrance Exam<br /><br />Educational Details: Applicants should complete their B.Tech/M.Tech/BE programs in Neuro- Science, Agricultural, Bio technology, bio process technology and other related disciplines having 50% aggregate from any authorized university.<br /><br />Application Fee: For all candidates application fee is Rs.500/- and it will be paid through Demand Draft drawn in favour of BCIL, New Delhi.<br /><br />How to Apply: Candidates who are willing to apply for this program they can apply through online mode. Then send the hard copy of registered application form to through post.<br /><br />Important Dates<br /><br />Opening Date of Submission Online Application Form: 7h April 2015<br /><br />Closing Date of Submission of Online Application Form: 10th May 2015<br /><br />Last Date of Receipt of Application Form: 15th May 2015<br /><br />Exam Date: 20th June 2015</p><p>More at http://bcil.nic.in/default.htm</p>]]></description>
	<dc:creator>Pranjali Yadav</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37241/remilo-reference-assisted-misassembly-detection-algorithm-using-short-and-long-reads</guid>
	<pubDate>Fri, 06 Jul 2018 04:27:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37241/remilo-reference-assisted-misassembly-detection-algorithm-using-short-and-long-reads</link>
	<title><![CDATA[ReMILO: reference assisted misassembly detection algorithm using short and long reads.]]></title>
	<description><![CDATA[ReMILO, a reference assisted misassembly detection algorithm that uses both short reads and PacBio SMRT long reads. ReMILO aligns the initial short reads to both the contigs and reference genome, and then constructs a novel data structure called red-black multipositional de Bruijn graph to detect misassemblies. In addition, ReMILO also aligns the contigs to long reads and find their differences from the long reads to detect more misassemblies.<p>Address of the bookmark: <a href="https://github.com/songc001/remilo" rel="nofollow">https://github.com/songc001/remilo</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>