<?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/40531?offset=540</link>
	<atom:link href="https://bioinformaticsonline.com/related/40531?offset=540" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30555/yaha</guid>
	<pubDate>Fri, 20 Jan 2017 05:38:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30555/yaha</link>
	<title><![CDATA[YAHA]]></title>
	<description><![CDATA[<p>YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints.</p>
<p><strong>Availability:</strong> YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from <a href="http://faculty.virginia.edu/irahall/YAHA" target="pmc_ext">http://faculty.virginia.edu/irahall/YAHA</a>.</p>
<p><strong>Contact:</strong></p>
<p>http://genome.wustl.edu/people/groups/detail/hall-lab/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</guid>
	<pubDate>Sun, 02 Apr 2017 14:31:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32011/fools-guide</link>
	<title><![CDATA[Fools guide]]></title>
	<description><![CDATA[<p><span>This website and accompaning documents are intended as a tool to help researchers dealing with non-model organisms acquire and process transcriptomic high-throughput sequencing data without having to learn extensive bioinformatics skills. It covers all steps from tissue collection, sample preparation and computer setup, through addressing biological questions with gene expression and SNP data.</span></p>
<p>http://sfg.stanford.edu/denovo.html</p>
<p>http://sfg.stanford.edu/sequencing.html</p>
<p>http://sfg.stanford.edu/BLAST.html</p>
<p>http://sfg.stanford.edu/denovo.html&nbsp;</p><p>Address of the bookmark: <a href="http://sfg.stanford.edu/guide.html" rel="nofollow">http://sfg.stanford.edu/guide.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32875/finishing</guid>
	<pubDate>Sat, 20 May 2017 15:50:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32875/finishing</link>
	<title><![CDATA[Finishing !!]]></title>
	<description><![CDATA[<p>The process of&nbsp;<em>finishing</em>&nbsp;a genome and moving it from a&nbsp;<em>draft</em>&nbsp;stage (the result of sequencing and initial assembly) to a complete genome is typically a time and resource intensive task. The advent of new sequencing technologies has come with its own set of opportunities and pitfalls in the finishing process. While genomes can now be sequenced to high redundancy in a cost-effective manner, the process of assembling the genomes is more challenging and often draft genomes are fragmented into hundreds of contigs. Correspondingly, the task of producing the complete genome can involve months of lab work and thousands of finishing experiments and is usually done in large genome centers.</p>
<p>The work in our lab has focussed on computational approaches to speed-up the finishing process. Specifically, we have explored the use of optical mapping and mate-pair data to augment assemblies and direct finishing experiments. The tools developed in our lab have been used in several finishing projects, producing complete genomes (and near-complete ones) with surprisingly little computational and experimental effort (Nagarajan et al., in submission). The executables (as well as source code) for these tools are freely available here:</p>
<ul>
<li><strong>Scaffolding using Optical Restriction Mapping</strong><br>Optical Maps are global, ordered maps of restriction site locations in a genome. This information can be quite useful in scaffolding contigs from a shotgun assembly to guide the finishing process. A set of programs to exploit optical maps for assembly can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/soma-v2.tar.gz">SOMA v2.0 (63 MB tar.gz file)</a>. This version of SOMA contains several improvements to programs in v1.0 as well as new scripts for working with multiple maps, contig graphs and scaffolds.&nbsp;<br><br></li>
<li><strong>Augmenting assemblies with mate-pair data</strong><br>Mate-pair information can be valuable in augmenting short-read assemblies and reconstructing the genome as larger scaffolds. AMOS-Hybrid is a pipeline written in the AMOS framework (open-source assembly tools) to merge arbitrary mated reads into an existing assembly and merge contigs and create scaffolds where possible. Source code and executables for AMOS-Hybrid are available here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/AMOS-Hybrid-v1.tar.gz">AMOS-Hybrid v1.0 (142 MB tar.gz file)</a>.&nbsp;<br><br></li>
<li><strong>Assembly and sequence-composition guided finishing</strong><br>Contigs from a shotgun assembly are typically linked together in a graph structure that can serve to guide finishing and in some case close gaps&nbsp;<em>in-silico</em>. Also, in many cases, sequence composition of contigs can provide clues to fill gaps in scaffolds. A set of scripts to automate some of these tasks can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/finishing-v1.tar.gz">Finishing Scripts v1.0 (63 MB tar.gz file)</a>.&nbsp;</li>
</ul>
<p>http://www.cbcb.umd.edu/finishing/</p><p>Address of the bookmark: <a href="http://www.cbcb.umd.edu/finishing/" rel="nofollow">http://www.cbcb.umd.edu/finishing/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33741/diya-a-bacterial-annotation-pipeline-for-any-genomics-lab</guid>
	<pubDate>Fri, 30 Jun 2017 08:48:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33741/diya-a-bacterial-annotation-pipeline-for-any-genomics-lab</link>
	<title><![CDATA[DIYA: a bacterial annotation pipeline for any genomics lab]]></title>
	<description><![CDATA[<p><span>DIY Genomics is an open source bioinformatics consortium intended to bring a collection of tools and libraries into the hands of small scale genomics labs for the process of sequence assembly and annotation. Projects include DIYA, MGAP, CRISPR, and DIYGV</span></p>
<p><span>http://gmod.org/wiki/Diya</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/diyg/" rel="nofollow">https://sourceforge.net/projects/diyg/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/37236/installing-salmon-for-trinity</guid>
	<pubDate>Tue, 03 Jul 2018 09:02:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/37236/installing-salmon-for-trinity</link>
	<title><![CDATA[Installing Salmon for Trinity !]]></title>
	<description><![CDATA[
<p>➜  trinityrnaseq-Trinity-v2.6.6 git:(master) ✗ conda install salmon<br />Solving environment: done</p>

<p>## Package Plan ##</p>

<p>  environment location: /home/urbe/anaconda3</p>

<p>  added / updated specs: <br />    - salmon</p>

<p>The following packages will be downloaded:</p>

<p>    package                    |            build<br />    ---------------------------|-----------------<br />    boost-1.64.0               |           py36_4         331 KB  conda-forge<br />    jemalloc-5.1.0             |       hfc679d8_0         8.2 MB  conda-forge<br />    boost-cpp-1.64.0           |                1        17.8 MB  conda-forge<br />    salmon-0.10.2              |                1         3.7 MB  bioconda<br />    conda-4.5.5                |           py36_0         624 KB  conda-forge<br />    tbb-2018_20171205          |                0         1.2 MB  conda-forge<br />    ------------------------------------------------------------<br />                                           Total:        31.8 MB</p>

<p>The following NEW packages will be INSTALLED:</p>

<p>    boost:     1.64.0-py36_4    conda-forge<br />    boost-cpp: 1.64.0-1         conda-forge<br />    jemalloc:  5.1.0-hfc679d8_0 conda-forge<br />    salmon:    0.10.2-1         bioconda   <br />    tbb:       2018_20171205-0  conda-forge</p>

<p>The following packages will be UPDATED:</p>

<p>    conda:     4.5.4-py36_0     conda-forge --&gt; 4.5.5-py36_0 conda-forge</p>

<p>Proceed ([y]/n)? y</p>

<p>Downloading and Extracting Packages<br />boost-1.64.0         |  331 KB | ####################################################################################################################################### | 100% <br />jemalloc-5.1.0       |  8.2 MB | ####################################################################################################################################### | 100% <br />boost-cpp-1.64.0     | 17.8 MB | ####################################################################################################################################### | 100% <br />salmon-0.10.2        |  3.7 MB | ####################################################################################################################################### | 100% <br />conda-4.5.5          |  624 KB | ####################################################################################################################################### | 100% <br />tbb-2018_20171205    |  1.2 MB | ####################################################################################################################################### | 100% <br />Preparing transaction: done<br />Verifying transaction: done<br />Executing transaction: done</p>
]]></description>
	<dc:creator>Rahul Nayak</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>