<?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/34493?offset=170</link>
	<atom:link href="https://bioinformaticsonline.com/related/34493?offset=170" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/32713/salzberg-lab</guid>
  <pubDate>Mon, 15 May 2017 05:14:01 -0500</pubDate>
  <link></link>
  <title><![CDATA[Salzberg lab]]></title>
  <description><![CDATA[
<p>We are a computational biology lab that develops novel methods for analysis of DNA and RNA sequences. Our research includes software for aligning and assembling RNA-seq data, whole-genome assembly, and microbiome analysis. We work closely with biomedical scientists to apply these methods to current problems arising in a broad spectrum of biological and medical research areas. We’re also part of the Center for Computational Biology, a group of 20+ faculty members and their labs at Johns Hopkins working on computational, statistical, and mathematical methods that can turn massive genomic data sets into biologically and clinically useful information.</p>

<p>https://salzberg-lab.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/33486/quick-next-generation-sequencing-ngs-terms-definition</guid>
	<pubDate>Fri, 09 Jun 2017 04:52:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/33486/quick-next-generation-sequencing-ngs-terms-definition</link>
	<title><![CDATA[Quick next generation sequencing (NGS) terms definition]]></title>
	<description><![CDATA[<p><strong>fragment size:</strong><span>&nbsp;the Illumina WGS protocol generates paired-end reads from both ends of longer fragments. The lengths of these fragments are assumed to be sampled from a normal distribution. Therefore, in the absence of structural variants, mapping locations of the paired ends span within an interval [&delta;min,&delta;max]. Most (&gt;90%) of paired-end reads are sampled from no-SV regions, therefore the fragment size distribution can be learned empirically for each WGS data set separately.</span><br /><br /><strong>concordant reads:</strong><span>&nbsp;a read pair is called concordant if they can be mapped to the reference genome as &ldquo;expected&rdquo;: (a) mapped to opposing strands where the upstream read is mapped to the forward strand and the downstream read is mapped to the reverse strand2, (b) the distance between ends is between the minimum and maximum expected fragment size.</span><br /><br /><strong>discordant reads:</strong><span>&nbsp;briefly, any non-concordant read pair is considered discordant. Note that, by definition, the discordant read pairs signal potential SVs. The sequence signature produced by these type of reads is known as read-pair signature.</span><br /><br /><strong>split reads:</strong><span>&nbsp;a read that can only be mapped to the reference genome by breaking into two sub-reads is called a split-read. These types of reads also indicate a potential SV or a short insertion or deletion (indel).</span><br /><br /><strong>read depth:</strong><span>&nbsp;number of reads that map within a region of the genome. Overall genome-wide read depth is also referred to as depth of coverage. It is expected that the number of reads that &ldquo;cover&rdquo; each base-pair to follow a Poisson distribution. Therefore, if the read depth over a certain region deviates significantly from this distribution, it signals for a potential copy number variation (CNV).</span></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35429/list-of-visualization-tools-for-genome-alignments</guid>
	<pubDate>Fri, 02 Feb 2018 13:25:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35429/list-of-visualization-tools-for-genome-alignments</link>
	<title><![CDATA[List of visualization tools for genome alignments]]></title>
	<description><![CDATA[<p><span>Genome</span><span>&nbsp;browsers are useful not only for showing final results but also for improving analysis protocols, testing data quality, and generating result drafts. Its integration in analysis pipelines allows the optimization of parameters, which leads to better results. But sometime, we need publication ready figure of genomes. Following are the list of genome alignment visualization tools, which could be useful for analysis and&nbsp;interpretation of results:</span></p><p>ABySS Explorer</p><p>Interactive Java application that uses a novel graph-based representation to display a sequence assembly and associated metadata</p><p>http://www.bcgsc.ca/platform/bioinfo/software/abyss-explorer</p><p>BamView</p><p>Genome browser and annotation tool that allows visualization of sequence features, next-generation sequencing (NGS) data and the results of analyses within the context of the sequence, and also its six-frame translation</p><p>http://www.sanger.ac.uk/resources/software/artemis/</p><p>DNannotator&nbsp;</p><p>Annotation web toolkit for regional genomic sequences</p><p>http://bioapp.psych.uic.edu/DNannotator.htm</p><p>JVM&nbsp;</p><p>Java Visual Mapping tool for NGS reads</p><p>http://www.springer.com/cda/content/document/cda_downloaddocument/9789401792448-c2.pdf?SGWID=0-0-45-1487072-p176815501</p><p>LookSeq&nbsp;</p><p>Web-based visualization of sequences derived from multiple sequencing technologies. Low- or high-depth read pileups and easy visualization of putative single nucleotide and structural variation</p><p>http://lookseq.sourceforge.net</p><p>MagicViewer&nbsp;</p><p>Visualization of short read alignment, identification of genetic variation and association with annotation information of a reference genome</p><p>http://bioinformatics.zj.cn/magicviewer/</p><p>MapView&nbsp;</p><p>Alignments of huge-scale single-end and pair-end short reads</p><p>http://omictools.com/mapview-s1367.html</p><p>MultiPipMaker</p><p>Computes alignments of similar regions in two DNA sequences. The resulting alignments are summarized with a &lsquo;percent identity plot&rsquo; (pip)</p><p>http://pipmaker.bx.psu.edu/pipmaker/</p><p>PileLineGUI&nbsp;</p><p>Handling genome position files in NGS studies</p><p>http://sing.ei.uvigo.es/pileline/pilelinegui.html</p><p>SAMtools tview&nbsp;</p><p>Simple and fast text alignment viewer; NGS compatible</p><p>http://www.htslib.org/</p><p>SEWAL</p><p>Uses a locality-sensitive hashing algorithm to enumerate all unique sequences in an entire Illumina sequencing run</p><p>http://www.sourceforge.net/projects/sewal</p><p>STAR&nbsp;</p><p>A web-based integrated solution to management and visualization of sequencing data</p><p>http://wanglab.ucsd.edu/star/browser</p><p>SVA&nbsp;</p><p>Software for annotating and visualizing sequenced human genomes</p><p>http://www.svaproject.org</p><p>Viewer (IGV)&nbsp;</p><p>Visualization of large heterogeneous datasets, providing a smooth and intuitive user experience at all levels of genome resolution</p><p>https://www.broadinstitute.org/igv/</p><p>ZOOM Lite&nbsp;</p><p>NGS data mapping and visualization software</p><p>http://bioinfor.com/zoom/lite/</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</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/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/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/bookmarks/view/38829/nquire-a-statistical-framework-for-ploidy-estimation-using-ngs-short-read-data</guid>
	<pubDate>Thu, 31 Jan 2019 05:12:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38829/nquire-a-statistical-framework-for-ploidy-estimation-using-ngs-short-read-data</link>
	<title><![CDATA[nQuire: A statistical framework for ploidy estimation using NGS short-read data]]></title>
	<description><![CDATA[<p>nQuire implements a set of commands to estimate ploidy level of individuals from species, where recent polyploidization occurred and intraspecific ploidy variation is observed. Specifically, nQuire uses next-generation sequencing data to distinguish between diploids, triploids and tetraploids, on the basis of frequency distributions at variant sites where only two bases are segregating.</p>
<p>For more background see also the publication at&nbsp;<a href="https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-018-2128-z">BMC Bioinformatics</a>.</p>
<p>https://github.com/clwgg/nQuire</p><p>Address of the bookmark: <a href="https://github.com/clwgg/nQuire" rel="nofollow">https://github.com/clwgg/nQuire</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40204/iitm-tokyo-tech-joint-symposium</guid>
	<pubDate>Thu, 24 Oct 2019 10:30:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40204/iitm-tokyo-tech-joint-symposium</link>
	<title><![CDATA[IITM-Tokyo Tech Joint Symposium]]></title>
	<description><![CDATA[<p>The IITM-Tokyo Tech Joint Symposium is a biannual international symposium held in Indian Institute of Technology Madras (IITM), India in collaboration with Tokyo Institute of Technology (Tokyo-Tech), Japan. During the symposium, experts in various domains of Bioinformatics gather from India and Japan under one roof to discuss and present their works. This provides an unique opportunity to the researchers and students to learn the frontiers and interact with eminent scientists in Bioinformatics. The 5th IITM - Tokyo Tech Joint Symposium titled "Current trends in Bioinformatics: Big data analysis, machine learning and drug design", will be held on 6th - 7th March 2020 in IITM, Chennai, India.</p><p>The symposium will focus on topics in the below mentioned areas.</p><p>Topics: Algorithms for biomolecular sequences / structures Bioinformatics databases and tools Protein function Structure based drug design Machine learning Deep learning Large scale data analysis Big Data NGS Analysis Protein interactions/network Molecular modelling/docking/screening Biomolecular structure and function More</p><p>Info: https://web.iitm.ac.in/bioinfo2/symposium2020/home</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/42418/scientist-b-bioinformatics-at-aiims-delhi</guid>
  <pubDate>Sun, 20 Dec 2020 04:34:55 -0600</pubDate>
  <link></link>
  <title><![CDATA[Scientist-B (Bioinformatics) at AIIMS, Delhi]]></title>
  <description><![CDATA[
<p>Name of the Project: “Artificial intelligence in Oncology, Harnessing big data and advanced computing to provide personalized diagnosis and treatment for Cancer patients”</p>

<p>Age Limit: 35</p>

<p>How to Apply for the AIIMS Life Science Job:</p>

<p>Interested applicants are asked to send out a detailed CV to Dr Ashok Sharma (aioncoaiims@gmail.com). Laboratory of Chromatin and also Cancer Epigenetics, Department of Biochemistry with the subject line “Application for Scientist-B position for MeitY project” latest by January 01st, 2021.<br />Complete Information of the year of passing, experience, marks, etc. ought to be mentioned in the CV Incomplete. applications will certainly be rejected Just shortlisted applicants will be called for interview. Chosen candidates will certainly be intimated by email/phone.<br />No TA/DA will certainly be paid for appearing in the interview.<br />Note, The institute reserved the right to fill up or not to fill up the post advertised.</p>

<p>Emoluments: Rs. 56,000/- plus 24 percent HRA</p>

<p>Eligibility:<br />2nd class Master’s Degree with a PhD in a pertinent subject (Bioinformatics) from.a recognized University<br />1st class Master’s degree in Life Sciences (Bioinformatics) from a recognized university OR.<br />Bachelor’s Degree in Engineering or-Technology with minimal 60% marks from a recognized University or equivalent.</p>

<p>Desirable Qualifications:<br />Experience in Bioinformatics/NGS data. Analysis/System Biology/Computer Science/ statistics with experience in Machine learning/Al project.<br />Experience of Deep learning applications in biological data ( image/text).<br />Proficient in Rf Python machine learning libraries.<br />Prior experience in the cancer-related project (ML-based) will be advantageous.<br />Experience with PyTorch/TensorFlow will certainly be very desirable.<br />Applicant should have strong scientific writing as well as. verbal abilities.<br />Papers in sci-indexed journals demonstrating ML skill sets.<br />Database handling will certainly be plus yet not required.</p>

<p>More detail at https://www.aiims.edu/images/pdf/recruitment/advertisement/biochem-16-12-20.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/41041/post-doc-computational-biology-bioinformatics-network-biology-data-science-ngs-mfd</guid>
  <pubDate>Sat, 15 Feb 2020 06:13:35 -0600</pubDate>
  <link></link>
  <title><![CDATA[Post Doc Computational Biology, Bioinformatics - Network Biology &amp; Data Science, NGS (m/f/d)]]></title>
  <description><![CDATA[
<p>https://www.jobvector.de/jobs-stellenangebote/biologie-life-sciences/forschung-entwicklung/post-doc-computational-biology-bioinformatics-network-biology-data-science-ngs-129867.html?suid=e522e9793b41817e52ac58d6963b94e2519920df</p>

<p>Requirements<br />Doctoral degree in Bioinformatics, Computational Biology, (Bio)physics/-mathematics, Biochemistry/Biology or similar with strong quantitative and numeric focus<br />Ability to numerically process complex and large data sets<br />Good programming skills (R/Bioconductor and/or Python preferred, Linux is a plus)<br />Experience in analyzing next-generation sequencing data sets using network biology<br />Scientific publication record in applied bioinformatics<br />Familiarity with single cell NGS analyses and other –omics techniques is a plus, but not essential</p>
]]></description>
</item>

</channel>
</rss>