<?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/29601?offset=670</link>
	<atom:link href="https://bioinformaticsonline.com/related/29601?offset=670" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31343/metabat-an-efficient-tool-for-accurately-reconstructing-single-genomes-from-complex-microbial-communities</guid>
	<pubDate>Mon, 06 Mar 2017 03:44:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31343/metabat-an-efficient-tool-for-accurately-reconstructing-single-genomes-from-complex-microbial-communities</link>
	<title><![CDATA[MetaBAT:  An Efficient Tool for Accurately Reconstructing Single Genomes from Complex Microbial Communities]]></title>
	<description><![CDATA[<p>MetaBAT, An Efficient Tool for Accurately Reconstructing Single Genomes from Complex Microbial Communities</p>
<p>Grouping large genomic fragments assembled from shotgun metagenomic sequences to deconvolute complex microbial communities, or metagenome binning, enables the study of individual organisms and their interactions. Here we developed an automated metagenome binning software, called MetaBAT, which integrates empirical probabilistic distances of genome abundance and tetranucleotide frequency. Tested on both synthetic and real metagenome datasets, MetaBAT outperforms alternative methods in both accuracy and computational efficiency. Applying MetaBAT to an assembly from 1,704 human gut samples formed 1,634 genome bins (&gt;200kb) in 3 hours, where 621 genome bins are &gt;50% complete with &lt;5% contamination from other species. Further analysis shows that the quality of these genome bins approaches manually curated genomes.</p><p>Address of the bookmark: <a href="https://bitbucket.org/berkeleylab/metabat" rel="nofollow">https://bitbucket.org/berkeleylab/metabat</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31375/cocacola-binning-metagenomic-contigs-using-sequence-composition-read-coverage-co-alignment-and-paired-end-read-linkage</guid>
	<pubDate>Tue, 07 Mar 2017 08:50:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31375/cocacola-binning-metagenomic-contigs-using-sequence-composition-read-coverage-co-alignment-and-paired-end-read-linkage</link>
	<title><![CDATA[COCACOLA (binning metagenomic contigs using sequence COmposition, read CoverAge, CO-alignment, and paired-end read LinkAge)]]></title>
	<description><![CDATA[<p>COCACOLA is a general framework that combines different types of information: sequence COmposition, CoverAge across multiple samples, CO-alignment to reference genomes and paired-end reads LinkAge to automatically bin contigs into OTUs. Furthermore, COCACOLA seamlessly embraces customized prior knowledge to facilitate binning accuracy.</p>
<p>News: Python version of COCACOLA is available now!</p><p>Address of the bookmark: <a href="https://github.com/younglululu/COCACOLA" rel="nofollow">https://github.com/younglululu/COCACOLA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31526/sequenceserver</guid>
	<pubDate>Fri, 10 Mar 2017 08:51:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31526/sequenceserver</link>
	<title><![CDATA[sequenceserver]]></title>
	<description><![CDATA[<p><span>SequenceServer lets you rapidly set up a BLAST+ server with an intuitive user interface for use locally or over the web.</span></p>
<p><span><span>More at&nbsp;</span><a href="http://sequenceserver.com/">http://sequenceserver.com</a><span>.</span></span></p><p>Address of the bookmark: <a href="https://github.com/wurmlab/sequenceserver" rel="nofollow">https://github.com/wurmlab/sequenceserver</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/view/459</guid>
	<pubDate>Thu, 11 Jul 2013 14:39:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/view/459</link>
	<title><![CDATA[Python vs Perl]]></title>
	<description><![CDATA[<p>Why bioinformatician still using Perl when Python is easy to code, good in ReXp and faster than perl?</p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/840/junior-research-fellow-jrf</guid>
  <pubDate>Sat, 13 Jul 2013 11:17:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Junior Research Fellow (JRF)]]></title>
  <description><![CDATA[
<p>School of Biotechnology<br />Gautam Buddha University<br />Greater Noida, UP - 201310</p>

<p>Applications are invited for one position of Junior Research Fellow (JRF) in a Department of Biotechnology (DBT) sponsored research project entitled “Design, synthesis and evaluation of potent aminopeptidase inhibitors for malarial therapy” under the supervision of Dr. Shakti Sahi.</p>

<p>The monthly fellowship of JRF will be Rs 12,000/- plus HRA as per the University rules.</p>

<p>Essential Qualification: Master degree in any discipline of Life Science with NET qualified.</p>

<p>Desirable Qualification: Preference will be given to candidates having research experience in in silico drug designing/Bioinformatics.</p>

<p>Interested candidates may send their resume to undersigned on or before 14th July 2013 by post-mail/e-mail shaktis@gbu.ac.in or shaktisahi@gmail.com. No TA and DA will be paid for appearing for the interview. Dr. Shakti Sahi (Principle Investigator)</p>

<p>Advertisement:<br />www.gbu.ac.in/Recruitment/JRF_Advt_DBTProject_Shakt</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/847/nedelec-lab</guid>
  <pubDate>Sat, 13 Jul 2013 17:38:55 -0500</pubDate>
  <link></link>
  <title><![CDATA[Nedelec Lab]]></title>
  <description><![CDATA[
<p>Location :European Molecular Biology Laboratory (EMBL), Heidelberg, Germany.</p>

<p>Our long-term research objective is to understand microtubule organization in living cells, with an emphasis on mitosis. We develop in-vitro assays, quantitative image analysis and cytosim, a computer simulation to study cellular architecture from a mechanistic angle, modeling the interactions of microtubules and related proteins such as molecular motors. In the past, we combined simulations and experiments to study microtubule self-organization, and the mechanical stability of two interacting asters. More recently, we looked at the focusing of mitotic fibers, the formation of antiparallel arrays of microtubules in fission yeast and the spindle positionning in C. elegans.<br />We are supported by BioMS, an initiative in Systems Biology, and involved in Cell networks.</p>

<p>Link: http://www.cytosim.org</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</guid>
	<pubDate>Mon, 10 Apr 2017 04:16:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32129/lordec-a-hybrid-error-correction-program-for-long-pacbio-reads</link>
	<title><![CDATA[LoRDEC: a hybrid error correction program for long, PacBio reads]]></title>
	<description><![CDATA[<p>LoRDEC is a program to correct sequencing errors in long reads from 3rd generation sequencing with high error rate, and is especially intended for PacBio reads. It uses a hybrid strategy, meaning that it uses two sets of reads: the reference read set, whose error rate is assumed to be small, and the PacBio read set, which is then corrected using the reference set. Typically, the reference set contains Illumina reads.</p>
<p><br> Usually, errors in PacBio reads include many insertions and deletions, and comparatively less substitutions. LoRDEC can correct errors of all these types.<br> After correction, a larger portion of the sequence of PacBio reads is usable for detection of region of similarity with other sequences, for aligning them to the contigs of an assembly, etc.</p>
<p>Why is LoRDEC different?</p>
<ul>
<li>It is efficient and can process large read data sets, included from eukaryotic or vertebrate species, on a usual computing server, and even works on desktop/laptop computers.</li>
<li>It adopts a novel graph based approach: it builds a succinct De Bruijn Graph (DBG) representing the short reads, and seeks a corrective sequence for each erroneous region of a long read by traversing chosen paths in the graph.</li>
</ul><p>Address of the bookmark: <a href="http://www.atgc-montpellier.fr/lordec/" rel="nofollow">http://www.atgc-montpellier.fr/lordec/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/855/bahlo-lab</guid>
  <pubDate>Sun, 14 Jul 2013 12:17:38 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bahlo Lab]]></title>
  <description><![CDATA[
<p>Melanie Bahlo is an applied statistician working in the areas of statistical genetics, bioinformatics and population genetics. Her main area of research is linkage mapping, in humans and mice.</p>

<p>Research Area:<br />Mapping loci in ENU mutants in mice in complex pedigrees<br />Investigation of DNA sharing in distantly related individuals<br />CNV analysis in pedigrees and connections to linkage studies<br />Statistical Genetics</p>

<p>Link @ http://www.wehi.edu.au/faculty_members/dr_melanie_bahlo</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32154/decostar-detection-of-co-evolution</guid>
	<pubDate>Fri, 14 Apr 2017 06:27:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32154/decostar-detection-of-co-evolution</link>
	<title><![CDATA[DeCoSTAR - Detection of Co-evolution]]></title>
	<description><![CDATA[<p><span>DeCoSTAR is a software which aims at reconstructing ancestral gene or genome organizations, in the form of sets of neighborhood relations -adjacencies- between pairs of ancestral genes or gene domains.</span><br><span>Ancestral genes or domains are deduced from reconciled gene trees in a context of birth, speciation, duplication, loss, transfer, which are either given as input or computed with the&nbsp;</span><a href="http://mbb.univ-montp2.fr/MBB/download_sources/16__TERA">ecceTERA package</a><span>, to which DeCoSTAR is integrated. DeCoSTAR constructs parsimonious scenarios of gains and breakages of adjacencies, and contains in particular all the features of previous software DeCo, DeCoLT, ArtDeCo and DeClone. It provides statistical supports on ancestral adjacencies, or the possibility to handle badly assembled genomes.&nbsp;</span><br><span>DeCoSTAR is able to reconstruct the histories of domains inside genes, including gene fusion and fission events, as well as ancestral genome structures for dozens of whole genomes from all kingdoms of life in a few minutes.</span></p><p>Address of the bookmark: <a href="http://pbil.univ-lyon1.fr/software/DeCoSTAR/" rel="nofollow">http://pbil.univ-lyon1.fr/software/DeCoSTAR/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/867/bc-cancer-agency-genome-sciences-centre</guid>
  <pubDate>Sun, 14 Jul 2013 13:21:27 -0500</pubDate>
  <link></link>
  <title><![CDATA[BC Cancer Agency Genome Sciences Centre]]></title>
  <description><![CDATA[
<p>Research Area</p>

<p>Genome analysis, genome visualization, mutation detection, molecular docking, comparative genomics, cancer informatics</p>

<p>Link @ http://www.bcgsc.ca</p>
]]></description>
</item>

</channel>
</rss>