<?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/13267?offset=730</link>
	<atom:link href="https://bioinformaticsonline.com/related/13267?offset=730" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32481/sspace</guid>
	<pubDate>Fri, 05 May 2017 05:42:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32481/sspace</link>
	<title><![CDATA[SSPACE]]></title>
	<description><![CDATA[<p>SSPACE standard is a stand-alone program for scaffolding pre-assembled contigs using NGS paired-read data. It is unique in offering the possibility to manually control the scaffolding process. By using the distance information of paired-end and/or matepair data, SSPACE is able to assess the order, distance and orientation of your contigs and combine them into scaffolds. Currently we offer this as a command-line tool in Perl. The input data is given by pre-assembled contig sequences (FASTA) and NGS paired-read data (Illumina/454/Solid FASTA or FASTQ). The final scaffolds are provided in FASTA format.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://www.baseclear.com/genomics/bioinformatics/basetools/SSPACE" rel="nofollow">https://www.baseclear.com/genomics/bioinformatics/basetools/SSPACE</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34216/meraculous-de-novo-genome-assembly-with-short-paired-end-reads</guid>
	<pubDate>Tue, 07 Nov 2017 04:36:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34216/meraculous-de-novo-genome-assembly-with-short-paired-end-reads</link>
	<title><![CDATA[Meraculous: De Novo Genome Assembly with Short Paired-End Reads]]></title>
	<description><![CDATA[<p><span>We describe a new algorithm, meraculous, for whole genome assembly of deep paired-end short reads, and apply it to the assembly of a dataset of paired 75-bp Illumina reads derived from the 15.4 megabase genome of the haploid yeast&nbsp;</span><em>Pichia stipitis</em><span>. More than 95% of the genome is recovered, with no errors; half the assembled sequence is in contigs longer than 101 kilobases and in scaffolds longer than 269 kilobases. Incorporating fosmid ends recovers entire chromosomes. Meraculous relies on an efficient and conservative traversal of the subgraph of the&nbsp;</span><em>k</em><span>-mer (deBruijn) graph of oligonucleotides with unique high quality extensions in the dataset, avoiding an explicit error correction step as used in other short-read assemblers. A novel memory-efficient hashing scheme is introduced. The resulting contigs are ordered and oriented using paired reads separated by &sim;280 bp or &sim;3.2 kbp, and many gaps between contigs can be closed using paired-end placements. Practical issues with the dataset are described, and prospects for assembling larger genomes are discussed.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3158087/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3158087/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/32629/bienko-and-crosetto-labs</guid>
  <pubDate>Fri, 12 May 2017 07:42:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bienko and Crosetto Labs]]></title>
  <description><![CDATA[
<p>We are two groups of scientists doing frontier research in quantitative biology and biomedicine. The Bienko group is interested in exploring the fundamental design principles controlling how DNA is packed in the eukaryotic nucleus and its relation to gene expression regulation. The Crosetto group engineers new molecular methods for single-cell and spatially resolved omic measurements of DNA, RNA, and proteins, with a strong focus on tumor heterogeneity. By sharing ideas and resources, we work synergistically towards a more quantitative understanding of life’s processes in healthy and diseased conditions.</p>

<p>https://bienkocrosettolabs.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35540/hinge-long-read-assembly-achieves-optimal-repeat-resolution</guid>
	<pubDate>Wed, 07 Feb 2018 09:40:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35540/hinge-long-read-assembly-achieves-optimal-repeat-resolution</link>
	<title><![CDATA[HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution]]></title>
	<description><![CDATA[<p>Software accompanying "HINGE: Long-Read Assembly Achieves Optimal Repeat Resolution"</p>
<ul>
<li>
<p>Preprint:&nbsp;<a href="http://biorxiv.org/content/early/2016/08/01/062117">http://biorxiv.org/content/early/2016/08/01/062117</a></p>
</li>
<li>
<p>Paper:&nbsp;<a href="http://genome.cshlp.org/content/27/5/747.full">http://genome.cshlp.org/content/27/5/747.full</a></p>
</li>
<li>
<p>An ipython notebook to reproduce results in the paper can be found in this&nbsp;<a href="https://github.com/govinda-kamath/HINGE-analyses">repository</a>.</p>
</li>
</ul>
<p>HINGE is an OLC(Overlap-Layout-Consensus) assembler. The idea of the pipeline is shown below.</p>
<p><a href="https://github.com/HingeAssembler/HINGE/blob/master/misc/High_level_overview.png" target="_blank"><img src="https://github.com/HingeAssembler/HINGE/raw/master/misc/High_level_overview.png" alt="image" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/HingeAssembler/HINGE" rel="nofollow">https://github.com/HingeAssembler/HINGE</a></p>]]></description>
	<dc:creator>Jit</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/36514/evidentialgene-tr2aacds-mrna-transcript-assembly-software</guid>
	<pubDate>Tue, 08 May 2018 04:39:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36514/evidentialgene-tr2aacds-mrna-transcript-assembly-software</link>
	<title><![CDATA[EvidentialGene: tr2aacds, mRNA Transcript Assembly Software]]></title>
	<description><![CDATA[<p><span>EvidentialGene is a genome informatics project, "Evidence Directed Gene Construction for Eukaryotes", to construct high quality, accurate gene sets for animals and plants, developed by Don Gilbert at Indiana University, see</span><br><a href="http://arthropods.eugenes.org/EvidentialGene/" target="_blank">http://arthropods.eugenes.org/EvidentialGene/<span></span></a><br><br><span>Construction refers to the combination of classical gene prediction, and more recent gene assembly (de-novo and genome-assisted) methods. The basic Evigene methods involve using available best-of-breed gene prediction and assembly software, combining all evidence for genes, from expressed sequences, genome assembly sequences, related species protein sequences, and any other, to annotate and score gene constructions. Over-produced constructions are classified by gene evidence for best qualities per "locus", including genome-aligned and gene-transcript aligned (genome-free) locus identification. All software developed for EvidentialGene is publicly available. See project wiki/blog for notes.</span></p>
<p><span>Download&nbsp;</span></p>
<p>http://arthropods.eugenes.org/EvidentialGene/trassembly.html</p>
<p>https://sourceforge.net/p/evidentialgene/blog/</p><p>Address of the bookmark: <a href="http://arthropods.eugenes.org/EvidentialGene/trassembly.html" rel="nofollow">http://arthropods.eugenes.org/EvidentialGene/trassembly.html</a></p>]]></description>
	<dc:creator>Rahul Nayak</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/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</guid>
	<pubDate>Mon, 14 May 2018 05:25:48 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36597/gappadder-a-sensitive-approach-for-closing-gaps-on-draft-genomes-with-short-sequence-reads</link>
	<title><![CDATA[GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads]]></title>
	<description><![CDATA[<p><span>This software is provided ``as is&rdquo; without warranty of any kind. In no event shall the author be held responsible for any damage resulting from the use of this software. The program package, including source codes, executables, and this documentation, is distributed free of charge. If you use this program in a publication, please cite the following reference:</span><br><span>Chong Chu, Xin Li, and Yufeng Wu. "GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence Reads." bioRxiv (2017): 125534.</span></p><p>Address of the bookmark: <a href="https://github.com/Reedwarbler/GAPPadder" rel="nofollow">https://github.com/Reedwarbler/GAPPadder</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</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/36897/gmcloser-closing-gaps-in-assemblies-accurately-with-a-likelihood-based-selection-of-contig-or-long-read-alignments</guid>
	<pubDate>Mon, 11 Jun 2018 05:43:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36897/gmcloser-closing-gaps-in-assemblies-accurately-with-a-likelihood-based-selection-of-contig-or-long-read-alignments</link>
	<title><![CDATA[GMcloser: closing gaps in assemblies accurately with a likelihood-based selection of contig or long-read alignments]]></title>
	<description><![CDATA[GMcloser uses likelihood-based classifiers calculated from the alignment statistics between scaffolds, contigs and paired-end reads to correctly assign contigs or long reads to gap regions of scaffolds, thereby achieving accurate and efficient gap closure. We demonstrate with sequencing data from various organisms that the gap-closing accuracy of GMcloser is 3–100-fold higher than those of other available tools, with similar efficiency.

https://academic.oup.com/bioinformatics/article/31/23/3733/209212<p>Address of the bookmark: <a href="https://academic.oup.com/bioinformatics/article/31/23/3733/209212" rel="nofollow">https://academic.oup.com/bioinformatics/article/31/23/3733/209212</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>

</channel>
</rss>