<?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/32131?offset=330</link>
	<atom:link href="https://bioinformaticsonline.com/related/32131?offset=330" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/11441/assistant-professor-in-bioinformatics-at-dr-d-y-patil-biotechnology-bioinformatics-institute</guid>
  <pubDate>Tue, 03 Jun 2014 19:54:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor 	in Bioinformatics at Dr. D. Y. Patil Biotechnology &amp; Bioinformatics Institute]]></title>
  <description><![CDATA[
<p>Dr. D. Y. Patil Biotechnology &amp; Bioinformatics Institute <br />Tathawade, Pune 411033.</p>

<p>Assistant Professor 	in Bioinformatics </p>

<p>Essential :<br />First Class Master’s Degree in the appropriate branch of Life Sciences / Technology (Tech.)<br />OR<br />Ph.D in Life Sciences or in the respective subject area of specialization<br />OR<br />Good Academic record with at least 55% marks (or an equivalent grade) at the Master’s Degree level, in the relevant subject or an equivalent degree from an Indian / Foreign University.<br />Besides fulfilling the above qualifications, candidates should have cleared the eligibility test (NET) for lecturers conducted by the UGC, CSIR or similar test accredited by the UGC and as per the requirements of UGC guidelines.</p>

<p>Desirable :<br />Teaching, research industrial and/or professional experience in a reputed organization. <br />Papers presented at Conferences and/or in refereed journals</p>

<p>Note : Application are invited in prescribed form Click here for Application Form<br />Kindly send your applications to “Registrar, Dr. D. Y. Patil Vidyapeeth, Pune, Sant Tukaram Nagar, Pimpri, Pune – 411018., Maharashtra, India.” should reach in the University office within 15 days from the publication.</p>

<p>More Info: http://www.dpu.edu.in/BiotechResearchPositions.aspx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37563/colormap-correcting-long-reads-by-mapping-short-reads</guid>
	<pubDate>Mon, 20 Aug 2018 14:17:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37563/colormap-correcting-long-reads-by-mapping-short-reads</link>
	<title><![CDATA[CoLoRMap: Correcting Long Reads by Mapping short reads]]></title>
	<description><![CDATA[<p><span>Second generation sequencing technologies paved the way to an exceptional increase in the number of sequenced genomes, both prokaryotic and eukaryotic. However, short reads are difficult to assemble and often lead to highly fragmented assemblies. The recent developments in long reads sequencing methods offer a promising way to address this issue. However, so far long reads are characterized by a high error rate, and assembling from long reads require a high depth of coverage. This motivates the development of hybrid approaches that leverage the high quality of short reads to correct errors in long reads.We introduce CoLoRMap, a hybrid method for correcting noisy long reads, such as the ones produced by PacBio sequencing technology, using high-quality Illumina paired-end reads mapped onto the long reads. Our algorithm is based on two novel ideas: using a classical shortest path algorithm to find a sequence of overlapping short reads that minimizes the edit score to a long read and extending corrected regions by local assembly of unmapped mates of mapped short reads. Our results on bacterial, fungal and insect data sets show that CoLoRMap compares well with existing hybrid correction methods.The source code of CoLoRMap is freely available for non-commercial use at https://github.com/sfu-compbio/colormap</span></p>
<p><span>ehaghshe@sfu.ca or cedric.chauve@sfu.ca</span></p><p>Address of the bookmark: <a href="https://github.com/sfu-compbio/colormap" rel="nofollow">https://github.com/sfu-compbio/colormap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/11656/faculty-post-at-zhejiang-university</guid>
  <pubDate>Tue, 10 Jun 2014 03:40:40 -0500</pubDate>
  <link></link>
  <title><![CDATA[Faculty post at Zhejiang University]]></title>
  <description><![CDATA[
<p>Zhejiang University (ZJU) is seeking faculty candidates for its newly launched, highly competitive and well funded “Hundred Talents Program”. This search covers all colleges and departments at ZJU. Applicants, expected to be about 35 years old, should hold PhD degree, and postdoctoral experiences are preferred for applicants in most fields. Applicants should have demonstrated commitment to excellence in teaching and research at a level comparable to the academic achievement of assistant professor or associate professor in world-renowned universities. Successful candidates must work full-time and are expected to establish internationally competitive and independent research program in cutting-edge areas of the relevant field at ZJU.</p>

<p>As one of the leading research-intensive universities in China, ZJU is located in the beautiful city of Hangzhou. Successful candidates will be employed as Principal Investigators and are qualified to supervise doctoral students. ZJU will offer an internationally competitive salary and the opportunity to purchase university's apartment at a price much lower than the market price, and will provide office and laboratory spaces as well as internationally competitive research startup packages.</p>

<p>Qualified applicants are strongly encouraged to submit their applications electronically to tr@zju.edu.cn. Applicants should include the following materials in pdf format: a comprehensive CV, a statement of research and teaching plan, and a list of 3 to 5 references with detailed contact information.</p>

<p>Contact：Talents Office, ZJU</p>

<p>Tel：+86-571-88981345, +86-571-88981390</p>

<p>Fax：+86-571-88981976</p>

<p>E-mail:tr@zju.edu.cn</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</guid>
	<pubDate>Mon, 04 May 2020 02:04:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41599/haslr-a-hybrid-assembler-which-uses-both-second-and-third-generation-sequencing-reads</link>
	<title><![CDATA[HASLR: a hybrid assembler which uses both second and third generation sequencing reads]]></title>
	<description><![CDATA[<p><span>HASLR, a hybrid assembler which uses both second and third generation sequencing reads to efficiently generate accurate genome assemblies. Our experiments show that HASLR is not only the fastest assembler but also the one with the lowest number of misassemblies on all the samples compared to other tested assemblers. Furthermore, the generated assemblies in terms of contiguity and accuracy are on par with the other tools on most of the samples. Availability. HASLR is an open source tool available at https://github.com/vpc-ccg/haslr.</span></p><p>Address of the bookmark: <a href="https://github.com/vpc-ccg/haslr" rel="nofollow">https://github.com/vpc-ccg/haslr</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/11592/xampp-starting-apache-fail-ubuntu</guid>
	<pubDate>Sat, 07 Jun 2014 05:52:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/11592/xampp-starting-apache-fail-ubuntu</link>
	<title><![CDATA[XAMPP: Starting Apache fail Ubuntu]]></title>
	<description><![CDATA[<p>Once you install XAMMP on linux, the most common problem you face is Apache failure. To fix the issues please use following command to first stop and then again start it.</p><p>sudo /etc/init.d/apache2 stop</p><p>sudo /etc/init.d/mysql stop</p><p>sudo /etc/init.d/proftpd stop</p><p>sudo /opt/lampp/lampp start</p><p>&nbsp;</p><p><strong>PhpMyAdmin &ldquo;Wrong permissions on configuration file, should not be world writable!&rdquo;</strong></p><p>Once the Xammp is installed, it might be possible to set up the configuration file in writable mode. Try the following steps:</p><p>Just chmod 0755 the file</p><pre>sudo chmod 0755 config.inc.php</pre>]]></description>
	<dc:creator>Ram Yash Pal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34470/simngs-and-simlibrary-%E2%80%93-software-for-simulating-next-gen-sequencing-data</guid>
	<pubDate>Tue, 28 Nov 2017 06:49:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34470/simngs-and-simlibrary-%E2%80%93-software-for-simulating-next-gen-sequencing-data</link>
	<title><![CDATA[simNGS and simLibrary – Software for Simulating Next-Gen Sequencing Data]]></title>
	<description><![CDATA[<p>simNGS is software for simulating observations from Illumina sequencing machines using the statistical models behind the AYB base-calling software. By default, observations only incorporate noise due to sequencing and do not incorporate effects from more esoteric sources of noise that may be present in real data ("dust", bubbles, merged clusters, sequence-heterogeneous clusters, etc). Many of these additional sources may optionally applied.</p>
<p>simNGS takes fasta format sequences and a file describing the covariance of noise between bases and cycles observed in an actual run of the machine, randomly generates noisy intensities representing the signals for the sequence at each cycle and calculates likelihoods for all possible base calls.</p><p>Address of the bookmark: <a href="https://www.ebi.ac.uk/goldman-srv/simNGS/" rel="nofollow">https://www.ebi.ac.uk/goldman-srv/simNGS/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/12288/genomic-medicine-bruce-korf-2014</guid>
	<pubDate>Tue, 24 Jun 2014 07:58:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/12288/genomic-medicine-bruce-korf-2014</link>
	<title><![CDATA[Genomic Medicine - Bruce Korf (2014)]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/FYldIrsXHKw" frameborder="0" allowfullscreen></iframe>May 21, 2014 - Current Topics in Genome Analysis 2014
A lecture series covering contemporary areas in genomics and bioinformatics. More: http://www.genome.gov/COURSE2014]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</guid>
	<pubDate>Fri, 08 Dec 2017 16:26:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</link>
	<title><![CDATA[jobTree based python wrapper to run the genome simulation tool suite Evolver]]></title>
	<description><![CDATA[<p><span>evolverSimControl</span><span>&nbsp;(</span><span>eSC</span><span>) can be used to simulate multi-chromosome genome evolution on an arbitrary phylogeny (</span><a href="http://evolution.genetics.washington.edu/phylip/newicktree.html">Newick format</a><span>). In addition to simply running evolver,&nbsp;</span><span>eSC</span><span>&nbsp;also automatically creates statistical summaries of the simulation as it runs including text and image files. Also included are convenience scripts to: check on a running simulation and see detailed status and logging information; extract fasta sequence files from the leaf nodes of a completed simulation; extract pairwise multiple alignment files (</span><a href="http://genome.ucsc.edu/FAQ/FAQformat.html#format5">.maf</a><span>) from leaf and branch nodes from a completed simulation and with the help of&nbsp;</span><a href="https://github.com/dentearl/mafTools/">mafJoin</a><span>, join them together into a single maf covering the entire simulation.</span></p><p>Address of the bookmark: <a href="https://github.com/dentearl/evolverSimControl" rel="nofollow">https://github.com/dentearl/evolverSimControl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12594/faculty-positions-at-central-university-of-punjab</guid>
  <pubDate>Mon, 07 Jul 2014 23:33:33 -0500</pubDate>
  <link></link>
  <title><![CDATA[Faculty Positions at Central University of Punjab]]></title>
  <description><![CDATA[
<p>Faculty Positions: Rolling/Open Advertisement Advt.No: T-10 (2013)</p>

<p>Pay Scale: Pay Band Rs.15600-39100 with AGP of Rs.6,000/-</p>

<p>Essential Qualifications for Professors, Associate Professors, and Assistant Professors: As per “UGC REGULATIONS ON MINIMUM QUALIFICATIONS FOR APPOINTMENT OF TEACHERS AND OTHER ACADEMIC STAFF IN UNIVERSITIES AND COLLEGES AND MEASURES FOR THE MAINTENANCE OF STANDARDS IN HIGHER EDUCATION 2010“ and the 2nd Amendments to the regulation issued in June 2013.</p>

<p>For details: http://www.ugc.ac.in/oldpdf/regulations/revised_finalugcregulationfinal10.pdf http://www.ugc.ac.in/pdfnews/8539300_English.pdf and University rules.</p>

<p>Procedure to apply:</p>

<p>Application forms along with API form complete in all respect along with necessary documents and application fee of Rs. 500/-. (Rs. 250/- for Scheduled Caste/Scheduled Tribe/Person with disabilities) should be sent to:</p>

<p>Registrar, Central University of Punjab, City Campus, Mansa Road, Bathinda-151001</p>

<p>For more info visit: http://www.centralunipunjab.com/Teaching/Final%20Details-t10-2013.pdf, http://www.centralunipunjab.com/Teaching/Advertisement-t10-2013.jpg</p>

<p>Last Apply Date: 31 Dec 2014</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/42188/tools-and-method-for-haplotype-phasing</guid>
	<pubDate>Fri, 04 Sep 2020 20:41:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/42188/tools-and-method-for-haplotype-phasing</link>
	<title><![CDATA[Tools and Method for Haplotype phasing !]]></title>
	<description><![CDATA[<div>Huge amounts of genotype data are being produced with recent technological advances, both from increasingly&nbsp; comprehensive and inexpensive genome-wide SNP microarrays and from ever more accessible whole-genome and whole-exome sequencing methods. The vast amount of knowledge contained in these results, however, is best&nbsp; exploited through phased haplotypes, which classify the alleles co-located on the same chromosome. Since sequence and SNP array data normally take the form of unphased genotypes, one does not specifically observe which of the two parental chromosomes, or haplotypes, falls on a specific allele. Fortunately, new advances in both computational and laboratory methods promise improved determination of haplotype phase. Following are useful tools :</div><div>&nbsp;</div><p><strong>Arlequin:</strong>&nbsp;<a href="http://cmpg.unibe.ch/software/arlequin3/" target="_blank">http://cmpg.unibe.ch/software/arlequin3/</a></p><p><strong>BEAGLE:</strong>&nbsp;<a href="http://faculty.washington.edu/browning/beagle/beagle.html" target="_blank">http://faculty.washington.edu/browning/beagle/beagle.html</a></p><p><strong>fastPHASE:</strong>&nbsp;<a href="http://stephenslab.uchicago.edu/software.html" target="_blank">http://stephenslab.uchicago.edu/software.html</a></p><p><strong>GENEHUNTER:</strong>&nbsp;<a href="http://linkage.rockefeller.edu/soft/gh/" target="_blank">http://linkage.rockefeller.edu/soft/gh/</a></p><p><strong>The Genome Analysis Toolkit:</strong></p><p><a href="http://www.broadinstitute.org/gsa/wiki/index.php/The_Genome_Analysis_Toolkit" target="_blank">http://www.broadinstitute.org/gsa/wiki/index.php/The_Genome_Analysis_Toolkit</a></p><p><strong>IMPUTE2:</strong>&nbsp;<a href="https://mathgen.stats.ox.ac.uk/impute/impute_v2.html" target="_blank">https://mathgen.stats.ox.ac.uk/impute/impute_v2.html</a></p><p><strong>MACH:</strong>&nbsp;<a href="http://www.sph.umich.edu/csg/abecasis/MACH/" target="_blank">http://www.sph.umich.edu/csg/abecasis/MACH/</a></p><p><strong>MERLIN:</strong>&nbsp;<a href="http://www.sph.umich.edu/csg/abecasis/Merlin/" target="_blank">http://www.sph.umich.edu/csg/abecasis/Merlin/</a></p><p><strong>PHASE:</strong>&nbsp;<a href="http://stephenslab.uchicago.edu/software.html" target="_blank">http://stephenslab.uchicago.edu/software.html</a></p><p><strong>PL-EM:</strong>&nbsp;<a href="http://www.people.fas.harvard.edu/~junliu/plem/" target="_blank">http://www.people.fas.harvard.edu/~junliu/plem/</a></p><p><strong>&ldquo;Read-backed phasing&rdquo; algorithm</strong>:&nbsp;<a href="http://www.broadinstitute.org/gsa/wiki/index.php/Read-backed_phasing_algorithm" target="_blank">http://www.broadinstitute.org/gsa/wiki/index.php/Read-backed_phasing_algorithm</a></p><p><strong>SHAPE-IT:</strong>&nbsp;<a href="http://www.griv.org/shapeit/" target="_blank">http://www.griv.org/shapeit/</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>

</channel>
</rss>