<?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/27440?offset=1250</link>
	<atom:link href="https://bioinformaticsonline.com/related/27440?offset=1250" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36518/mix-combining-multiple-assemblies-from-ngs-data</guid>
	<pubDate>Tue, 08 May 2018 04:58:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36518/mix-combining-multiple-assemblies-from-ngs-data</link>
	<title><![CDATA[MIX: Combining multiple assemblies from NGS data]]></title>
	<description><![CDATA[<p>Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices represent extremities of contigs and edges represent existing alignments between these extremities. These alignment edges are used for contig extension. The resulting output assembly corresponds to a path in the extension graph that maximizes the cumulative contig length.</p>
<p>The Mix algorithm, approach and results were published in BMC bioinformatics :&nbsp;<a href="http://www.biomedcentral.com/1471-2105/14/S15/S16">http://www.biomedcentral.com/1471-2105/14/S15/S16</a>.</p><p>Address of the bookmark: <a href="https://github.com/cbib/MIX" rel="nofollow">https://github.com/cbib/MIX</a></p>]]></description>
	<dc:creator>Rahul Nayak</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/36884/halc-high-throughput-algorithm-for-long-read-error-correction</guid>
	<pubDate>Fri, 08 Jun 2018 10:47:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</link>
	<title><![CDATA[HALC: High throughput algorithm for long read error correction]]></title>
	<description><![CDATA[HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach)

HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.<p>Address of the bookmark: <a href="https://github.com/lanl001/halc" rel="nofollow">https://github.com/lanl001/halc</a></p>]]></description>
	<dc:creator>Jit</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/37239/kat-a-k-mer-analysis-toolkit-to-quality-control-ngs-datasets-and-genome-assemblies</guid>
	<pubDate>Fri, 06 Jul 2018 03:36:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37239/kat-a-k-mer-analysis-toolkit-to-quality-control-ngs-datasets-and-genome-assemblies</link>
	<title><![CDATA[KAT: a K-mer analysis toolkit to quality control NGS datasets and genome assemblies]]></title>
	<description><![CDATA[<p>KAT is a suite of tools that analyse jellyfish hashes or sequence files (fasta or fastq) using kmer counts. The following tools are currently available in KAT:</p>
<ul>
<li><span>hist</span>: Create an histogram of k-mer occurrences from a sequence file. Adds metadata in output for easy plotting.</li>
<li><span>gcp:</span>&nbsp;K-mer GC Processor. Creates a matrix of the number of K-mers found given a GC count and a K-mer count.</li>
<li><span>comp</span>: K-mer comparison tool. Creates a matrix of shared K-mers between two (or three) sequence files or hashes.</li>
<li><span>sect</span>: SEquence Coverage estimator Tool. Estimates the coverage of each sequence in a file using K-mers from another sequence file.</li>
<li><span>blob</span>: Given, reads and an assembly, calculates both the read and assembly K-mer coverage along with GC% for each sequence in the assembly.SEquence Coverage estimator Tool.</li>
<li><span>filter</span>: Filtering tools. Contains tools for filtering k-mer hashes and FastQ/A files:
<ul>
<li><span>kmer</span>: Produces a k-mer hash containing only k-mers within specified coverage and GC tolerances.</li>
<li><span>seq</span>: Filters a sequence file based on whether or not the sequences contain k-mers within a provided hash.</li>
</ul>
</li>
<li><span>plot</span>: Plotting tools. Contains several plotting tools to visualise K-mer and compare distributions. The following plot tools are available:
<ul>
<li><span>density</span>: Creates a density plot from a matrix created with the "comp" tool. Typically this is used to compare two K-mer hashes produced by different NGS reads.</li>
<li><span>profile</span>: Creates a K-mer coverage plot for a single sequence. Takes in fasta coverage output coverage from the "sect" tool</li>
<li><span>spectra-cn</span>: Creates a stacked histogram using a matrix created with the "comp" tool. Typically this is used to compare a jellyfish hash produced from a read set to a jellyfish hash produced from an assembly. The plot shows the amount of distinct K-mers absent, as well as the copy number variation present within the assembly.</li>
<li><span>spectra-hist</span>: Creates a K-mer spectra plot for a set of K-mer histograms produced either by jellyfish-histo or kat-histo.</li>
<li><span>spectra-mx</span>: Creates a K-mer spectra plot for a set of K-mer histograms that are derived from selected rows or columns in a matrix produced by the "comp".</li>
</ul>
</li>
</ul>
<p>In addition, KAT contains a python script for analysing the mathematical distributions present in the K-mer spectra in order to determine how much content is present in each peak.</p>
<p>This README only contains some brief details of how to install and use KAT. For more extensive documentation please visit:&nbsp;<a href="https://kat.readthedocs.org/en/latest/">https://kat.readthedocs.org/en/latest/</a></p>
<p><a href="https://academic.oup.com/bioinformatics/article/33/4/574/2664339">https://academic.oup.com/bioinformatics/article/33/4/574/2664339&nbsp;</a></p><p>Address of the bookmark: <a href="https://github.com/TGAC/KAT" rel="nofollow">https://github.com/TGAC/KAT</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/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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37830/nquire-a-statistical-framework-for-ploidy-estimation-using-next-generation-sequencing</guid>
	<pubDate>Thu, 04 Oct 2018 05:23:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37830/nquire-a-statistical-framework-for-ploidy-estimation-using-next-generation-sequencing</link>
	<title><![CDATA[nQuire: a statistical framework for ploidy estimation using next generation sequencing]]></title>
	<description><![CDATA[<p>nQuire provides a statistical framework to study organisms with intraspecific variation in ploidy. nQuire is likely to be useful in epidemiological studies of pathogens, artificial selection experiments, and for historical or ancient samples where intact nuclei are not preserved. It is implemented as a stand-alone Linux command line tool in the C programming language and is available at https://github.com/clwgg/nQuireunder the MIT license.</p><p>Address of the bookmark: <a href="https://github.com/clwgg/nQuireunder" rel="nofollow">https://github.com/clwgg/nQuireunder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14054/project-fellow-at-institute-of-himalayan-bioresource-technology</guid>
  <pubDate>Fri, 15 Aug 2014 06:50:08 -0500</pubDate>
  <link></link>
  <title><![CDATA[Project Fellow at Institute of Himalayan Bioresource Technology]]></title>
  <description><![CDATA[
<p>Research Associate/ Project FellowDate of posting:14 Aug</p>

<p>Eligibility : MSc, M Phil / Phd, BE/B.Tech<br />Location : Himachal Pradesh-other<br />Job Category : Govt Jobs, Research, Walkin<br />Last Date : 20 Aug 2014</p>

<p>Advertisement No.6/2014</p>

<p>Post : Project Fellow<br />Research Associate/ Project Fellow Jobs opportunity in CSIR-Institute of Himalayan Bioresource Technology<br />M.Sc. in Bioinformatics/Computer Science with 55% marks and (ii) M.Sc. Bioinformatics/ Computational biology/ P.G. Diploma in Bioinformatics/B.Tech. or higher Degree in Bioinformatics with 55% marks</p>

<p>Date of Interview: 29.08.2014.</p>

<p>More at http://www.ihbt.res.in/recruit/AdvtNo6_2014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38169/amstat-display-statistics-of-large-sequence-files-from-next-generation-sequencing-projects</guid>
	<pubDate>Fri, 09 Nov 2018 13:34:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38169/amstat-display-statistics-of-large-sequence-files-from-next-generation-sequencing-projects</link>
	<title><![CDATA[AMStat: display statistics of large sequence files from next generation sequencing projects]]></title>
	<description><![CDATA[<p><span>SAMStat is an efficient C program to quickly display statistics of large sequence files from next generation sequencing projects. When applied to&nbsp;</span><a href="http://samstat.sourceforge.net/#about">SAM/BAM</a><span>&nbsp;files all statistics are reported for unmapped, poorly and accurately mapped reads separately. This allows for identification of a variety of problems, such as remaining linker and adaptor sequences, causing poor mapping. Apart from this SAMStat can be used to verify individual processing steps in large analysis pipelines.</span></p><p>Address of the bookmark: <a href="http://samstat.sourceforge.net/" rel="nofollow">http://samstat.sourceforge.net/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>