<?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/27685?offset=660</link>
	<atom:link href="https://bioinformaticsonline.com/related/27685?offset=660" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/27316/sample-binc-question-paper-2016-part1</guid>
	<pubDate>Fri, 13 May 2016 03:41:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/27316/sample-binc-question-paper-2016-part1</link>
	<title><![CDATA[Sample BINC question paper 2016 - part1]]></title>
	<description><![CDATA[<p>Please download the sample bioinformatics question paper for BINC 2016</p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/27316" length="40276" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27328/platanus</guid>
	<pubDate>Fri, 13 May 2016 05:12:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27328/platanus</link>
	<title><![CDATA[Platanus]]></title>
	<description><![CDATA[<p>Platanus is a novel <em>de novo</em> sequence assembler that can reconstruct genomic sequences of<br> highly heterozygous diploids from massively parallel shotgun sequencing data.</p>
<p>The latest version is <a href="http://platanus.bio.titech.ac.jp/platanus/?page_id=14">1.2.4</a>.</p>
<p>To cite Platanus, please use the following:</p>
<p>Kajitani R, Toshimoto K, Noguchi H, Toyoda A, Ogura Y, Okuno M, Yabana M, Harada M, Nagayasu E, Maruyama H, Kohara Y, Fujiyama A, Hayashi T, Itoh T, &ldquo;Efficient de novo assembly of highly heterozygous genomes from whole-genome shotgun short reads&rdquo;.&nbsp;Genome Res. 2014 Aug;24(8):1384-95. doi: 10.1101/gr.170720.113. [<a href="http://www.ncbi.nlm.nih.gov/pubmed/24755901">abstract</a> |<a href="http://genome.cshlp.org/content/24/8/1384.long"> full text</a>]</p><p>Address of the bookmark: <a href="http://platanus.bio.titech.ac.jp/" rel="nofollow">http://platanus.bio.titech.ac.jp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/27412/navin-lab</guid>
  <pubDate>Wed, 18 May 2016 16:40:14 -0500</pubDate>
  <link></link>
  <title><![CDATA[Navin Lab]]></title>
  <description><![CDATA[
<p>NAvin laboratory has pioneered the development of single cell sequencing technologies.  They apply these tools to study complex biological processes that occur in human cancers including tumor initation, clonal evolution, invasion, metastasis and chemoresistance.  These processes have previously been difficult to study with genomic technologies using bulk tissues</p>

<p>More at http://www.navinlab.com/navinlab/home.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</guid>
	<pubDate>Fri, 20 May 2016 18:53:49 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27430/mosaik-a-hash-based-algorithm-for-accurate-next-generation-sequencing-short-read-mapping</link>
	<title><![CDATA[MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping]]></title>
	<description><![CDATA[<p><span>MOSAIK is a stable, sensitive and open-source program for mapping second and third-generation sequencing reads to a reference genome. Uniquely among current mapping tools, MOSAIK can align reads generated by all the major sequencing technologies, including Illumina, Applied Biosystems SOLiD, Roche 454, Ion Torrent and Pacific BioSciences SMRT. Indeed, MOSAIK was the only aligner to provide consistent mappings for all the generated data (sequencing technologies, low-coverage and exome) in the 1000 Genomes Project. To provide highly accurate alignments, MOSAIK employs a hash clustering strategy coupled with the Smith-Waterman algorithm. This method is well-suited to capture mismatches as well as short insertions and deletions. To support the growing interest in larger structural variant (SV) discovery, MOSAIK provides explicit support for handling known-sequence SVs, e.g. mobile element insertions (MEIs) as well as generating outputs tailored to aid in SV discovery.</span></p><p>Address of the bookmark: <a href="http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581" rel="nofollow">http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27453/senior-project-fellow-bioinformatics-at-nbri</guid>
  <pubDate>Sat, 21 May 2016 21:01:05 -0500</pubDate>
  <link></link>
  <title><![CDATA[Senior Project Fellow Bioinformatics at NBRI]]></title>
  <description><![CDATA[
<p>Walk In Interview No. 03/Project/2016<br />Senior Project Fellow Bioinformatics Job vacancies in CSIR- National Botanical Research Institute (NBRI), Lucknow<br />Area III: Molecular Biology &amp; Biotechnology<br />Qualification : 1st Class M.Sc. in Bioinformatics/Biotechnology/ Life Science /Biochemistry/Botany with 2 years research experience and at least one publication in SCI Journal or 1st class M.Tech in Bioinformatics<br />Age : 32 years<br />Salary : Rs.18000<br />How to apply<br />Date &amp; Venue of Interview For Area III: 27-05-2016 at 11.00 A.M. at Conference Room, T.N. Khushoo Block, NBRI, Lucknow.</p>

<p>http://www.nbri.res.in/temp.php</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27549/ra-at-university-of-hyderabad</guid>
  <pubDate>Sun, 29 May 2016 11:50:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA at UNIVERSITY OF HYDERABAD]]></title>
  <description><![CDATA[
<p>UNIVERSITY OF HYDERABAD</p>

<p>School of Life Sciences</p>

<p>Department of Animal Biology</p>

<p>Applications are invited on a plane paper (along with copies of educational qualifications and experience) from eligible candidates for the selection of following position to work under a collaborative research project entitled “Development and application of high resolution genome conformation capture technology to investigate genome architecture in space and time” between University of Hyderabad and CR Rao advanced Institute of Mathematics, Statistics and Computer Sciences, sponsored by Department of Biotechnology, Government of India, New Delhi</p>

<p>Name and No. of positions JRF‐ONE</p>

<p>Emoluments for the position Rs. 25,000/p.m. + Eligible HRA</p>

<p>Qualifications MSc or M.Tech in any branch of biology/bioinformatics/computational biology/computer sciences/Mathematics/Physics</p>

<p>Duration Appointments are made initially for ONE year and can be extended further TWO years or until the duration of project</p>

<p>Our laboratory is interested in understanding signalling and spatiotemporal dynamics of 3‐Dimensional genome architecture and gene expression during embryonic stem cell differentiation by utilizing a combination of cellular, molecular genetics, Biochemical and computational tools in combination with next generation sequencing based chromatin structure analysing methods. Successful candidates shall pursue project related to either experimental or computational analysis of genome and Epigenomics data derived from human and mouse cells. Experience in Computational biology, bioinformatics, statistics, machine learning and algorithmic development is required. Knowledge of programming languages (e.g. C, C++, Perl, Python, Ruby etc.) and statistical framework (e.g. R, matlab, etc.) is preferable. Basic understanding of molecular biology will be an added advantage.</p>

<p>Interested candidates with the above mentioned qualification can send their curriculum vitae to   Dr. K. Sreenivasulu, Department of Animal Biology, School of Life Sciences, South campus, University of Hyderabad or via email at positionssklab@gmail.com or svksl@uohyd.ernet.in.</p>

<p>Candidates with CSIR/UGC/ICMR/DBT/BINC qualifications if interested in above mentioned area of research are welcomed to approch principal investigator for a position leading to PhD. Last date for submission of applications is 17/06/2016. Eligible candidates will be called for an interview and they should carry all original certificates of the qualifying exam. No TA/ DA will be paid for attending the interview or at the time of joining the post.</p>

<p>Advertisement: http://www.uohyd.ac.in/images/recruitment/jrf_260516.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/27695/the-kingsley-lab</guid>
  <pubDate>Fri, 03 Jun 2016 09:55:10 -0500</pubDate>
  <link></link>
  <title><![CDATA[The Kingsley Lab]]></title>
  <description><![CDATA[
<p>The Molecular Basis of Vertebrate Evolution. Naturally occurring species show spectacular differences in morphology, physiology, behavior, disease susceptibility, and life span. Although the genomes of many organisms have now been completely sequenced, Kingsley lab still know relatively little about the specific DNA sequence changes that underlie interesting species-specific traits. Kingsley lab laboratory is using a combination of genetic and genomic approaches to identify the detailed molecular mechanisms that control evolutionary change in vertebrates.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27799/bbmapbbtools-package-multipurpose-tool-designed-for-converting-reads-or-other-nucleotide-data-between-different-formats</guid>
	<pubDate>Mon, 13 Jun 2016 05:47:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27799/bbmapbbtools-package-multipurpose-tool-designed-for-converting-reads-or-other-nucleotide-data-between-different-formats</link>
	<title><![CDATA[BBMap/BBTools package: Multipurpose tool designed for converting reads or other nucleotide data between different formats.]]></title>
	<description><![CDATA[<div id="post_message_148585"><a href="https://sourceforge.net/projects/bbmap/" target="_blank">Reformat</a>is a member of the <a href="https://sourceforge.net/projects/bbmap/" target="_blank">BBMap/BBTools package</a>. It is a multipurpose tool designed for converting reads or other nucleotide data between different formats. It supports, and can inter-convert:<br /> <br /> fastq<br /> fasta<br /> fasta+qual<br /> sam<br /> scarf (an old Illumina format)<br /> bam (if samtools is installed)<br /> gzip<br /> zip<br /> ascii-33 (sanger)<br /> ascii-64 (old Illumina)<br /> paired files<br /> interleaved files<br /> <br /> It is multithreaded and can process data at over 500 megabytes per second, and can accept streams from standard in and write to standard out, allowing it to be easily dropped into the middle of a pipeline for format conversion. Reformat autodetects formats based on file extensions and content, making it very easy to use; and the autodetection can be overridden, allowing flexibility for people who don't like to follow naming conventions, or out-of-spec fastq files with qualities values like -17 or 120.<br /> <br /> The program has been gradually expanded, and can now perform various other functions. None of these will break pairing, if the input is paired.<br /> <br /> Quality trimming (either or both ends)<br /> Quality filtering<br /> Fixed-length trimming<br /> Generation of histograms (base composition, quality, etc)<br /> Subsampling (to a fraction of input reads, or an exact number of reads or bases)<br /> Changing fasta line-wrapping length<br /> Reverse-complementing (all reads or only read 2)<br /> Adding /1 and /2 suffix to read names<br /> GC-content filtering<br /> Length-filtering<br /> Testing for corrupted interleaved files<br /> <br /> Reformat is compatible with any platform that supports Java 1.7 or higher. It also has a bash shellscript for simpler invocation. Typical usage examples:<br /> <br /> Reformat fastq into fasta:<br /> <strong>reformat.sh in=x.fq out=y.fa</strong><br /> <br /> Interleave paired reads:<br /> <strong>reformat.sh in1=x1.fq in2=x2.fq out=y.fq</strong><br /> <br /> Note - you can actually use a shortcut if paired read files have the same name with a 1 and a 2. This is equivalent to the above command:<br /> <strong>reformat.sh in=x#.fq out=y.fq</strong><br /> <br /> De-interleave reads:<br /> <strong>reformat.sh in=x.fq out1=y1.fq out2=y2.fq</strong><br /> <br /> Verify that interleaving appears correct, assuming Illumina namimg conventions:<br /> <strong>reformat.sh in=x.fq vint</strong><br /> <br /> Convert ASCII-33 to ASCII-64:<br /> <strong>reformat.sh in=x.fq out=y.fq qin=33 qout=64</strong><br /> <br /> Quality-trim paired reads to Q10 on the left and right ends and discard reads shorter than 50bp after trimming:<br /> <strong>reformat.sh in1=x1.fq in2=x2.fq out1=y1.fq out2=y2.fq outsingle=singletons.fq qtrim=rl trimq=10 minlength=50</strong><br /> <br /> Subsample 10% of the first 20000 pairs in an interleaved file:<br /> <strong>reformat.sh in=x.fq out=y.fq reads=20000 samplerate=0.1 int=t</strong><br /> (in this case "int=t" overrides interleaving autodetection, to ensure reads are treated as pairs)<br /> <br /> Pipe in a gzipped sam file and pipe out fasta:<br /> <strong>reformat.sh in=stdin.sam.gz out=stdout.fa</strong><br /> <br /> Reverse-complement reads:<br /> <strong>reformat.sh in=x.fq out=y.fq rcomp</strong><br /> <br /> For reformatting a file with very long sequences, Reformat will need more memory; just add the additional flag "-Xmx2g". For example, to change the line-wrapping length on the human genome (which has individual sequences over 200Mbp long) to 70 characters:<br /> <strong>reformat.sh -Xmx2g in=HG19.fa.gz out=HG19_wrapped.fa.gz fastawrap=70</strong><br /> <br /> For additional functions, please run the shellscript with no arguments, or just read it with a text editor. If you have any questions, please post them in this thread.<br /> <br /> For people using a non-bash terminal, you may need to type "bash reformat.sh" instead of just "reformat.sh".<br /> For users of Windows or other platforms that do not support bash shellscripts, replace "reformat.sh" with "java -ea -Xmx200m /path/to/bbmap/current/ jgi.ReformatReads"<br /> for example,<br /> <strong>java -ea -Xmx200m C:\bbmap\current\ jgi.ReformatReads in=x.fq out=y.fa</strong><br /> <br /> Reformat can be downloaded with BBTools here:<br /> <a href="https://sourceforge.net/projects/bbmap/" target="_blank">https://sourceforge.net/projects/bbmap/</a></div>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27821/blobsplorer</guid>
	<pubDate>Tue, 14 Jun 2016 10:28:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27821/blobsplorer</link>
	<title><![CDATA[Blobsplorer]]></title>
	<description><![CDATA[<p>Blobsplorer is a tool for interactive visualization of assembled DNA sequence data ("contigs") derived from (often unintentionally) mixed-species pools. It allows the simultaneous display of GC content, coverage, and taxonomic annotation for collections of contigs with a view to separating out those belonging to different taxa.</p>
<p>Blobsplorer is unlikely to be of use on its own as it requires contig data to be supplied in a format that involves considerable preprocessing (see below for a description). The easiest way to use Blobsplorer is as part of a workflow using scripts from <a href="https://github.com/blaxterlab/blobology">here</a>.</p><p>Address of the bookmark: <a href="http://nematodes.org/martin/blobsplorer/blobsplorer.html" rel="nofollow">http://nematodes.org/martin/blobsplorer/blobsplorer.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27845/cnidaria-fast-reference-free-phylogenomic-clustering</guid>
	<pubDate>Thu, 16 Jun 2016 17:55:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27845/cnidaria-fast-reference-free-phylogenomic-clustering</link>
	<title><![CDATA[CNIDARIA: fast, reference-free phylogenomic clustering]]></title>
	<description><![CDATA[<p>Motivation: Identification of biological specimens is a major requirement for a range of applications. Reference-free methods analyse unprocessed sequencing data without relying on prior knowledge, but these do not scale to arbitrarily large genomes and arbitrarily large phylogenetic distances.</p>
<p>Results: We present Cnidaria, a practical tool for clustering genomic and transcriptomic data with no limitation on ge-nome size or phylogenetic distances. We successfully simultaneously clustered 169 genomic and transcriptomic datasets from 4 kingdoms, achieving 100% accuracy at supra-species level and 78% accuracy for species level.</p>
<p>Availability and Implementation: Cnidaria is written in C++ and Python and is available at http://www.ab.wur.nl/cnidaria.</p>
<p>Contact: Saulo Aflitos - sauloal@gmail.com</p>
<p>Supplementary information: Supplementary data are available at Bioinformatics online.</p><p>Address of the bookmark: <a href="https://github.com/sauloal/cnidaria/wiki" rel="nofollow">https://github.com/sauloal/cnidaria/wiki</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>

</channel>
</rss>