<?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/27463?offset=1260</link>
	<atom:link href="https://bioinformaticsonline.com/related/27463?offset=1260" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36950/salsa-a-tool-to-scaffold-long-read-assemblies-with-hi-c</guid>
	<pubDate>Fri, 15 Jun 2018 04:01:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36950/salsa-a-tool-to-scaffold-long-read-assemblies-with-hi-c</link>
	<title><![CDATA[SALSA: A tool to scaffold long read assemblies with Hi-C]]></title>
	<description><![CDATA[This code is used to scaffold your assemblies using Hi-C data. This version implements some improvements in the original SALSA algorithm. If you want to use the old version, it can be found in the old_salsa branch.

To use the latest version, first run the following commands:

  cd SALSA
  make
To run the code, you will need Python 2.7, BOOST libraries and Networkx(version lower than 1.2).

If you consider using this tool, please cite our publication which describes the methods used for scaffolding.

Ghurye, J., Pop, M., Koren, S., Bickhart, D., &amp; Chin, C. S. (2017). Scaffolding of long read assemblies using long range contact information. BMC genomics, 18(1), 527. Link

Ghurye, J., Rhie, A., Walenz, B.P., Schmitt, A., Selvaraj, S., Pop, M., Phillippy, A.M. and Koren, S., 2018. Integrating Hi-C links with assembly graphs for chromosome-scale assembly. bioRxiv, p.261149 Link

For any queries, please either ask on github issue page or send an email to Jay Ghurye (jayg@cs.umd.edu).<p>Address of the bookmark: <a href="https://github.com/machinegun/SALSA" rel="nofollow">https://github.com/machinegun/SALSA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/14218/pimp-your-brain-bioinformatics</guid>
	<pubDate>Wed, 20 Aug 2014 22:09:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/14218/pimp-your-brain-bioinformatics</link>
	<title><![CDATA[Pimp your brain: Bioinformatics]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/KqelGy6Q8nE" frameborder="0" allowfullscreen></iframe>Jan Lisec from the Max Planck Institute of Molecular Plant Physiology explains, in this "pimp your brain" episode, what bioinformatics is and why bioinformatics is so important and indispensable for biological research.

In the video serial "Pimp your brain" scientists from the Max Planck Institute of Molecular Plant Physiology describe their research. More videos from the 'Pimp your brain' serial are available on www.youtube.com/playlist?list=PL-l9VItC9Gn2Ur2Xj6PTOAkjLUlVPbIOO

More videos are available on www.mpimp-golm.mpg.de]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</guid>
	<pubDate>Mon, 06 Aug 2018 17:19:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</link>
	<title><![CDATA[gSearch: a fast and flexible general search tool for whole-genome sequencing]]></title>
	<description><![CDATA[<p><span>gSearch compares sequence variants in the Genome Variation Format (GVF) or Variant Call Format (VCF) with a pre-compiled annotation or with variants in other genomes. Its search algorithms are subsequently optimized and implemented in a multi-threaded manner.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ml.ssu.ac.kr/gSearch/index.html" rel="nofollow">http://ml.ssu.ac.kr/gSearch/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/12989/center-for-molecular-dynamics-nepal-cmdn-nepal</guid>
  <pubDate>Wed, 23 Jul 2014 13:54:51 -0500</pubDate>
  <link></link>
  <title><![CDATA[Center for Molecular Dynamics Nepal (CMDN), Nepal]]></title>
  <description><![CDATA[
<p>Center for Molecular Dynamics Nepal (CMDN), established 2007 prides itself as a research driven nongovernmental organization. Unlike other civil society organizations, CMDN is dedicated entirely to promoting research in the country. With its team of energetic and highly motivated experts, CMDN is now recognized as the leading public health and wildlife research organization of the country.</p>

<p>More at http://www.cmdn.org.np/main/index.php</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37576/lrcstats-a-tool-for-evaluating-long-reads-correction-methods</guid>
	<pubDate>Wed, 22 Aug 2018 11:05:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37576/lrcstats-a-tool-for-evaluating-long-reads-correction-methods</link>
	<title><![CDATA[LRCstats: a tool for evaluating long reads correction methods]]></title>
	<description><![CDATA[<p><span>LRCstats is an open-source pipeline for benchmarking DNA long read correction algorithms for long reads outputted by third generation sequencing technology such as machines produced by Pacific Biosciences. The reads produced by third generation sequencing technology, as the name suggests, are longer in length than reads produced by next generation sequencing technologies, such as those produced by Illumina. However, long reads are plagued by high error rates, which can cause issues in downstream analysis. Long read correction algorithms reduce the error rate of long reads either through self-correcting methods or using accurate, short reads outputted by next generation sequencing technologies to correct long reads.</span></p><p>Address of the bookmark: <a href="https://github.com/cchauve/lrcstats" rel="nofollow">https://github.com/cchauve/lrcstats</a></p>]]></description>
	<dc:creator>Aaryan Lokwani</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/13267/the-genome-10k-project</guid>
	<pubDate>Tue, 29 Jul 2014 09:11:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/13267/the-genome-10k-project</link>
	<title><![CDATA[The Genome 10K Project]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/B57xDIGtCT0" frameborder="0" allowfullscreen></iframe>https://genome10k.soe.ucsc.edu

The Genome 10K project aims to assemble a genomic zoo—a collection of DNA sequences representing the genomes of 10,000 vertebrate species, approximately one for every vertebrate genus. The trajectory of cost reduction in DNA sequencing suggests that this project will be feasible within a few years. Capturing the genetic diversity of vertebrate species would create an unprecedented resource for the life sciences and for worldwide conservation efforts.

The growing Genome 10K Community of Scientists (G10KCOS), made up of leading scientists representing major zoos, museums, research centers, and universities around the world, is dedicated to coordinating efforts in tissue specimen collection that will lay the groundwork for a large-scale sequencing and analysis project.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37796/grsr-a-tool-for-deriving-genome-rearrangement-scenarios-from-multiple-unichromosomal-genome-sequences</guid>
	<pubDate>Fri, 28 Sep 2018 09:35:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37796/grsr-a-tool-for-deriving-genome-rearrangement-scenarios-from-multiple-unichromosomal-genome-sequences</link>
	<title><![CDATA[GRSR: a tool for deriving genome rearrangement scenarios from multiple unichromosomal genome sequences]]></title>
	<description><![CDATA[<p>GRSR is a Tool for Deriving Genome Rearrangement Scenarios for Multiple Uni-chromosomal Genomes. This tool will do the following steps:</p>
<ul>
<li>Step 1. Run mugsy to get multiple sequence alignment results.</li>
<li>Step 2 &amp; 3. Extraction of the Coordinates of Core Blocks, Construction of Synteny Blocks and Generating Signed Permutations.</li>
<li>Step 4. Generate pairwise genome rearrangement scenarios and find repeats at the breakpoints of each rearrangement events.</li>
<li></li>
<li></li>
</ul>
<p>https://github.com/DanwangJessica/GRSR</p><p>Address of the bookmark: <a href="https://github.com/DanwangJessica/GRSR" rel="nofollow">https://github.com/DanwangJessica/GRSR</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/13477/research-associate-at-indian-institute-of-chemical-technology-iict-hyderabad</guid>
  <pubDate>Thu, 07 Aug 2014 01:55:21 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate at Indian Institute of Chemical Technology (IICT), Hyderabad]]></title>
  <description><![CDATA[
<p>Indian Institute of Chemical Technology (IICT), Hyderabad, a constituent of CSIR is a leading research Institute in the area of chemical sciences. The core strength of IICT lies in Organic Chemistry, and it continues to excel in this field for over six decades. The research efforts during these years have resulted in the development of several innovative processes for a variety of products necessary for human welfare such as drugs, agrochemicals, food, organic intermediates, adhesives etc. More than 150 technologies developed by IICT are now in commercial production.</p>

<p>CSIR-IICT is conducting Walk in Interview for the following position on a purely temporary basis for the sponsored project "GENESIS (BSC-0121) at 10.00 AM on 19th August 2014 at IICT, Hyderabad</p>

<p>    Position : Research Associate<br />    No of Post : One<br />    Desired Profile : PhD in computation biology or M.Tech in Computational Biology with three years experience in relevant subject and atleast one research paper in SCI journal</p>

<p>    Experience : Knowledge in vector and vector borne disease, disease modeling, GIS mapping and modeling.<br />    Age : 35 years<br />    Stipend : Rs 22000/- + HRA</p>

<p>Eligible candidate may download the application form from our website http://www.iictindia.org and appear for interview along with the duly filled in application form supported by bio-data and one set of attested photo copies of certificates of educational qualification, age, experience, caste, latest photograph and the cadndidates are required to bring all the original certificates for verification</p>

<p>Walk in Interview : 19.08.14</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38208/anitools-web-a-web-tool-for-fast-genome-comparison-within-multiple-bacterial-strains</guid>
	<pubDate>Wed, 14 Nov 2018 04:34:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38208/anitools-web-a-web-tool-for-fast-genome-comparison-within-multiple-bacterial-strains</link>
	<title><![CDATA[ANItools web: a web tool for fast genome comparison within multiple bacterial strains]]></title>
	<description><![CDATA[<p><span>ANItools is a software package written by PERL scripts that can be run in a Linux/Unix system. If you want to compare bacterial genomes and calculate their average nucleotide identity (ANI), you could download and run this program directly. Or you could send us the genome sequence by email. Then we will do the analysis work for you.</span></p>
<p><span>https://academic.oup.com/database/article/doi/10.1093/database/baw084/2630454</span></p><p>Address of the bookmark: <a href="http://ani.mypathogen.cn/" rel="nofollow">http://ani.mypathogen.cn/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14003/jrf-position-in-the-faculty-of-life-sciences-biotechnology-at-sauth-asian-university</guid>
  <pubDate>Wed, 13 Aug 2014 07:16:30 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF position in the Faculty of Life Sciences &amp; Biotechnology at  Sauth Asian University]]></title>
  <description><![CDATA[
<p>Opening for a Project-JRF position in the Faculty of Life Sciences &amp; Biotechnology</p>

<p>Applications are invited for the post of Junior Research Fellow (JRF) in a DBT funded IYBA project entitled “Generatingaprotein-ncRNA interactome for Dorsal mediated gene regulation and dorso-ventral patterning genes in Drosophila” in the Lab. Of Molecular Biology at the Faculty of Life Sciences and Biotechnology, South Asian University, New Delhi. The project requires extensive use of molecular, genetic and genomic approaches.</p>

<p>POST: Junior Research Fellow (JRF)</p>

<p>NO. OF VACANCIE(S) - (01)</p>

<p>FELLOWSHIP: Rs. 16,000/- plus HRA</p>

<p>PROJECT DURATION: 2014-2016 (Two years)</p>

<p>LAST DATE FOR APPLICATION: Aug 18, 2014.</p>

<p>Eligibility criteria:</p>

<p>M.Sc./M.Tech./ in Biological Sciences/Biotechnology/Bio-Informatics. Candidates with research experience in the field of Drosophila/Yeast genetics will be preferred.</p>

<p>Application Procedure:</p>

<p>A covering letter along with your CV, copy of prior publications (if any) and proof of experience should be e-mailed to lmb_sau@aol.com. Hardcopy of the application should be brought on the day of interview along with other testimonials and marks statements for verification purpose.</p>

<p>IMPORTANT NOTE:</p>

<p>-No TA/DA will be paid for attending the interview.</p>

<p>-SAU may select candidates against the post depending upon qualification and experience of candidates and reserves the right to relax any of the qualifications in case the candidate is found otherwise well qualified by the Selection Committee</p>

<p>-The abovementioned post is temporary and will be initially offered for a period of one year and can be extended, on satisfactory performance. </p>

<p>More at http://www.sau.ac.in/recruitment/vacancy.html</p>
]]></description>
</item>

</channel>
</rss>