<?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/29144?offset=1400</link>
	<atom:link href="https://bioinformaticsonline.com/related/29144?offset=1400" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34922/camsa-a-tool-for-comparative-analysis-and-merging-of-scaffold-assemblies</guid>
	<pubDate>Thu, 28 Dec 2017 09:10:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34922/camsa-a-tool-for-comparative-analysis-and-merging-of-scaffold-assemblies</link>
	<title><![CDATA[CAMSA :: a tool for Comparative Analysis and Merging of Scaffold Assemblies]]></title>
	<description><![CDATA[<p>CAMSA &ndash; is a tool for&nbsp;<span>C</span>omparative&nbsp;<span>A</span>nalysis and&nbsp;<span>M</span>erging of&nbsp;<span>S</span>caffold&nbsp;<span>A</span>ssemblies, distributed both as a standalone software package and as Python library under the MIT license.</p>
<p>Main features:</p>
<ol>
<li>works with any number of scaffold assemblies in de-novo non-progressive fashion</li>
<li>allows to simultaneously work with scaffold assemblies obtained from any&nbsp;<em>in silico</em>&nbsp;and&nbsp;<em>in vitro</em>&nbsp;techniques, supporting multiple existing formats via built-in converters</li>
<li>creates an extensive report with several comparative quality metrics (both on assembly level and on the level of individual assembly points)</li>
<li>constructs a merged combined scaffold assembly</li>
<li>provides an interactive framework for a visual comparative analysis of the given assemblies</li>
</ol><p>Address of the bookmark: <a href="https://cblab.org/camsa/" rel="nofollow">https://cblab.org/camsa/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32376/diamond</guid>
	<pubDate>Thu, 27 Apr 2017 04:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32376/diamond</link>
	<title><![CDATA[DIAMOND]]></title>
	<description><![CDATA[<p><span>DIAMOND is a sequence aligner for protein and translated DNA searches and functions as a drop-in replacement for the NCBI BLAST software tools. It is suitable for protein-protein search as well as DNA-protein search on short reads and longer sequences including contigs and assemblies, providing a speedup of BLAST ranging up to x20,000.</span></p>
<p><span>More at&nbsp;file:///home/urbe/Downloads/diamond_manual.pdf</span></p>
<p><span>http://www.nature.com/nmeth/journal/v12/n1/full/nmeth.3176.html</span></p><p>Address of the bookmark: <a href="https://github.com/bbuchfink/diamond" rel="nofollow">https://github.com/bbuchfink/diamond</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/32496/bioinformatician-at-23andme</guid>
  <pubDate>Sat, 06 May 2017 17:57:39 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatician at 23andMe]]></title>
  <description><![CDATA[
<p>23andMe’s mission is to help people access, understand, and benefit<br />from the human genome. We are a group of passionate individuals excited<br />to push the boundaries of what’s possible to help turn genetic insight<br />into better health and personal understanding.</p>

<p>Our Research Team prides itself on driving cutting edge, industrial-scale<br />science to make an impact that belies the team’s size, in an environment<br />and culture that fosters creativity, innovation, collaboration, and fun.</p>

<p>More than 80% of our customers consent to participate in research, and as<br />a result of their participation, we have one of the largest recontactable,<br />genotyped, and phenotyped research cohorts in the world. The scope and<br />breadth of our vision means that most of the methods and tools necessary<br />to unlock the potential of this unique resource for discovery have yet<br />to be developed.</p>

<p>Our science has garnered the respect of many members of the<br />broader scientific community. For a list of our publications, see<br />www.23andme.com/publications/for-scientists/.</p>

<p>Join us! Visit our Careers page (www.23andMe.com/careers) to learn more<br />about these open positions:</p>

<p>•	Scientist, Research Communications<br />•	Bioinformaticist<br />•	Computational Biologist, Ancestry R&amp;D<br />•	Scientist/Senior Scientist, Statistical Genetics<br />•	Scientist/Senior Scientist, Survey Methodology<br />•	Scientist/Senior Scientist, Health R&amp;D<br />•	Senior Computational Biologist<br />•	Biostatistician</p>

<p>pfontanillas@23andme.com</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38378/gwaspro-a-high-performance-genome-wide-association-analysis-server</guid>
	<pubDate>Fri, 07 Dec 2018 08:04:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38378/gwaspro-a-high-performance-genome-wide-association-analysis-server</link>
	<title><![CDATA[GWASpro: A High-Performance Genome-Wide Association Analysis Server]]></title>
	<description><![CDATA[<p>GWASpro supports building complex design matrices, by which complex experimental designs that may include replications, treatments, locations and times, can be accounted for in the linear mixed model (LMM). GWASpro is optimized to handle GWAS data that may consist of up to 10 million markers and 10,000 samples from replicable lines or hybrids. GWASpro provides an interface that significantly reduces the learning curve for new GWAS investigators.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://bioinfo.noble.org/GWASPRO/" rel="nofollow">https://bioinfo.noble.org/GWASPRO/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32633/a-post-assembly-genome-improvement-toolkit-pagit-to-obtain-annotated-genomes-from-contigs</guid>
	<pubDate>Fri, 12 May 2017 10:50:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32633/a-post-assembly-genome-improvement-toolkit-pagit-to-obtain-annotated-genomes-from-contigs</link>
	<title><![CDATA[A Post-assembly genome-improvement toolkit (PAGIT) to obtain annotated genomes from contigs]]></title>
	<description><![CDATA[<p>PAGIT addresses the need for software to generate high quality draft genomes. It is based on a series of programs that we developed:</p>
<p><a href="https://sourceforge.net/projects/abacas/files/">ABACAS</a>, that is able to contiguate contigs from a de novo assembly against a closely related reference.</p>
<p><a href="https://sourceforge.net/projects/image2/files/">IMAGE</a>, an iterative approach for closing gaps in assembled genomes using mate pair information. It is able to close gaps left open by the assembler in a draft genome, even when using the same data sets as used by the original assembler.</p>
<p><a href="http://icorn.sourceforge.net/">iCORN</a>, that enables errors in the consensus sequence to be corrected by iteratively mapping reads to the current assembly. An improved version, especially correction Pacfic Bioscience assemblies (PacBio) can be found&nbsp;<a href="ftp://ftp.sanger.ac.uk/pub4/resources/software/pagit/ICORN2/icorn2.V0.95.tgz">here</a>.</p>
<p><a href="https://ratt.svn.sourceforge.net/svnroot/ratt">RATT</a>, a tool to transfer the annotation from a reference genome, or an earlier assembly, onto the latest assembly.</p>
<p>PAGIT bundles these software and makes them more accessible for users.</p><p>Address of the bookmark: <a href="http://www.sanger.ac.uk/science/tools/pagit" rel="nofollow">http://www.sanger.ac.uk/science/tools/pagit</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/32822/phd-positions-in-genova-at-dibris-univ-of-genoa-italy</guid>
  <pubDate>Thu, 18 May 2017 00:04:07 -0500</pubDate>
  <link></link>
  <title><![CDATA[PhD positions in Genova at DIBRIS - Univ. of Genoa, Italy]]></title>
  <description><![CDATA[
<p>PhD positions in Genova at DIBRIS - Univ. of Genoa (Italy)</p>

<p>http://www.disi.unige.it/person/MasulliF/ricerca/PhDinGenova2017.html</p>

<p>The call for some funded positions for  the 3 years PhD studies  at the Department of Informatics, Bioengineering, Robotics and System Engineering (DIBRIS) in Genova is available at</p>

<p>http://www.studenti.unige.it/postlaurea/dottorati/XXXIII/ENG/</p>

<p>The deadline for applications is June13, 2017 and the PhD courses and fellowships should start on Nov 2017.</p>

<p>Details for the application to the  PhD Program in Computer Science and Systems Engineering (CODICE 6608) are at http://phd.dibris.unige.it/csse/index.php/how-to-apply</p>

<p>The research activity of my research group is focused on Computational Intelligence, Machine Learning, Bioinformatics, Systems Biology, and Positive Technology as described at http://www.disi.unige.it/person/MasulliF/ricerca/index.html</p>

<p>The research themes proposed by me and Prof. Stefano Rovetta are:</p>

<p>- Computational Intelligence and Machine Learning (see http://www.disi.unige.it/person/MasulliF/ricerca/Phd2017-T1.html)</p>

<p>- Computational Intelligence and Health and Wellbeing Support( see http://www.disi.unige.it/person/MasulliF/ricerca/Phd2017-T3.html)</p>

<p>You can also propose a different research theme belonging to the research activity of my group.</p>

<p>Looking for self-motivated PhD candidates, interested to the mathematical aspects of their research and to the development of new algorithms for intelligent data analysis, and skilled in programming and   in  thorough experimental data analysis. They will be part of my research group and will collaborate to our research projects and publications.</p>

<p>Italian and international students interested to work are invited  to send their cv  and the name/email-addresses of 3 referees to my email address francesco.masulli@unige.it A.S.A.P.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44539/bactopia-a-flexible-pipeline-for-complete-analysis-of-bacterial-genomes</guid>
	<pubDate>Wed, 15 May 2024 14:36:12 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44539/bactopia-a-flexible-pipeline-for-complete-analysis-of-bacterial-genomes</link>
	<title><![CDATA[Bactopia: a Flexible Pipeline for Complete Analysis of Bacterial Genomes]]></title>
	<description><![CDATA[<p dir="auto">Bactopia is a flexible pipeline for complete analysis of bacterial genomes. The goal of Bactopia is to process your data with a broad set of tools, so that you can get to the fun part of analyses quicker!</p>
<p dir="auto">Bactopia can be split into two main parts:&nbsp;<a href="https://bactopia.github.io/latest/beginners-guide/">Bactopia Analysis Pipeline</a>, and&nbsp;<a href="https://bactopia.github.io/latest/bactopia-tools/">Bactopia Tools</a>.</p>
<p dir="auto">Bactopia Analysis Pipeline is the main&nbsp;<em>per-isolate</em>&nbsp;workflow in Bactopia. Built with&nbsp;<a href="https://www.nextflow.io/">Nextflow</a>, input FASTQs (local or available from SRA/ENA) are put through numerous analyses including: quality control, assembly, annotation, minmer sketch queries, sequence typing, and more.</p>
<p dir="auto"><a href="https://github.com/bactopia/bactopia/blob/master/data/bactopia-workflow.png" target="_blank"><img src="https://github.com/bactopia/bactopia/raw/master/data/bactopia-workflow.png" alt="Bactopia Overview" style="border: 0px;"></a></p>
<p dir="auto">Bactopia Tools are a set a independent workflows fo</p><p>Address of the bookmark: <a href="https://github.com/bactopia/bactopia" rel="nofollow">https://github.com/bactopia/bactopia</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/33966/ra-bioinformatics-at-national-institute-of-biomedical-genomics-india</guid>
  <pubDate>Wed, 26 Jul 2017 03:49:52 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at NATIONAL INSTITUTE OF BIOMEDICAL GENOMICS,  INDIA]]></title>
  <description><![CDATA[
<p>NATIONAL INSTITUTE OF BIOMEDICAL GENOMICS<br />(An Autonomous Institution of the Government of India) <br />P.O.: N.S.S., Kalyani 741251, West Bengal</p>

<p>Advertisement No. 137/ESTB/NIBMG/17-18 </p>

<p>Position available Project Description: Several positions are available for the project titled: “A unified web-portal for analysis, integration and visualization of multi-omics data”. The goal of this project is to develop a user-accessible resource for integrated analysis and visualization of multi-OMICs data sets (including gene expression, genotype, methylation, microRNA, etc.). Data sets generated on various platforms shall be maintained in a stable database, accessed through standard querying mechanisms, and the results shall be displayed via user-friendly interface. The analysis engine shall run on open-source software (such as R/Bioconductor) developed in-house. All positions are contractual. </p>

<p>Appointment will be initially given for a period of one year which is extendable depending upon performance, availability of funds and requirements of the institute. </p>

<p>Project Code: 20275 Position: (No. of positions available) </p>

<p>Research Associate (3)</p>

<p>Position 1: Ph.D. or equivalent in statistics, computer science, mathematics, bioinformatics, or related subject. <br />Position 1: Those with experience in database management shall be preferred. Experience with UNIX or GNU/Linux operating system. <br />Position 1: Creation and maintenance of a database for population- and diseaseassociated variation resource. Development of programmatic interface for querying the database, filtering of the results and identification of genes of interest. </p>

<p>Rs. 36000/- + 10% HRA </p>

<p>Please apply online via web link http://apply.nibmg.ac.in/ (no other form of application will be accepted). The last date of application is 14-08-2017. All letters to attend screening test and /or interview will be sent only to the short-listed candidates by Email only. No correspondence will be made with applicants who are not shortlisted /not called for screening test and /or interview. No TA/DA will be paid for attending the screening test and /or interview.<br />Detail information at http://www.nibmg.ac.in/academic/Advt_20275.pdf</p>

<p>More Info: http://www.nibmg.ac.in/?q=Project%20Linked%20Personnel</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34479/bioinformatics-lectures</guid>
	<pubDate>Wed, 29 Nov 2017 05:39:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34479/bioinformatics-lectures</link>
	<title><![CDATA[Bioinformatics lectures !]]></title>
	<description><![CDATA[<div>
<div>
<div>Computational Biology is a&nbsp;<em style="font-size: 12.8px; font-weight: normal;">huge</em>&nbsp;field of study, that touches upon many distinct algorithmic and biological areas of study. What we are able to cover in this course will depend, in part, on the pace at which we move, which I will attempt to adjust as appropriate. However, here is a tentative list of topics I hope to cover this semester (not necessarily in order).
<ul>
<li>Optimal sequence alignment (global, local, and glocal alignment &amp;mdash with constant &amp; affine gap penalties</li>
<li>Algorithms and data structures for efficient text indexing and&nbsp;<em>exact</em>&nbsp;search</li>
<li>Heuristics for read&nbsp;<em>alignment</em>&nbsp;and&nbsp;<em>mapping</em>&nbsp;&amp;mdash mapping DNA-seq and RNA-seq reads</li>
<li>Genome assembly &amp;mdash k-mers, De Brujin graph construction and representation, long-read technology and read-overlap graph assembly</li>
<li>Motif finding via Gibbs sampling</li>
<li>Gene finding &amp;mdash statistical models for&nbsp;<em>ab initio</em>&nbsp;and evidence-guided prediction of genes</li>
<li>RNA-seq and transcriptomics &amp;mdash transcript assembly, abundance estimation and differential expression testing</li>
<li>Phylogenetics &amp;mdash The small and large phylogeny problem; parsimony, maximum likelihood and Bayesian methods</li>
</ul>
</div>
</div>
</div><p>Address of the bookmark: <a href="https://rob-p.github.io/CSE549F16/lectures/" rel="nofollow">https://rob-p.github.io/CSE549F16/lectures/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33912/mesquite-a-modular-system-for-evolutionary-analysis</guid>
	<pubDate>Tue, 18 Jul 2017 07:42:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33912/mesquite-a-modular-system-for-evolutionary-analysis</link>
	<title><![CDATA[Mesquite: A modular system for evolutionary analysis]]></title>
	<description><![CDATA[<p><span>Mesquite is modular, extendible software for evolutionary biology, designed to help biologists organize and analyze comparative data about organisms. Its emphasis is on phylogenetic analysis, but some of its modules concern population genetics, while others do non-phylogenetic multivariate analysis. Because it is modular, the analyses available depend on the modules installed.</span></p>
<p><span>http://mesquiteproject.wikispaces.com/</span></p><p>Address of the bookmark: <a href="https://github.com/MesquiteProject/MesquiteCore/releases" rel="nofollow">https://github.com/MesquiteProject/MesquiteCore/releases</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>