<?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/27076?offset=1230</link>
	<atom:link href="https://bioinformaticsonline.com/related/27076?offset=1230" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40972/deepbinner-a-signal-level-demultiplexer-for-oxford-nanopore-reads</guid>
	<pubDate>Mon, 10 Feb 2020 02:45:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40972/deepbinner-a-signal-level-demultiplexer-for-oxford-nanopore-reads</link>
	<title><![CDATA[Deepbinner: a signal-level demultiplexer for Oxford Nanopore reads]]></title>
	<description><![CDATA[<p>Deepbinner is a tool for demultiplexing barcoded <a href="https://nanoporetech.com/">Oxford Nanopore</a> sequencing reads. It does this with a deep <a href="https://adeshpande3.github.io/adeshpande3.github.io/A-Beginner's-Guide-To-Understanding-Convolutional-Neural-Networks/">convolutional neural network</a> classifier, using many of the <a href="https://towardsdatascience.com/neural-network-architectures-156e5bad51ba">architectural advances</a> that have proven successful in image classification. Unlike other demultiplexers (e.g. Albacore and <a href="https://github.com/rrwick/Porechop">Porechop</a>), Deepbinner identifies barcodes from the raw signal (a.k.a. squiggle) which gives it greater sensitivity and fewer unclassified reads.</p><p>Address of the bookmark: <a href="https://github.com/rrwick/Deepbinner" rel="nofollow">https://github.com/rrwick/Deepbinner</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/13226/you-and-your-friend-have-similar-dna</guid>
	<pubDate>Sun, 27 Jul 2014 20:44:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/13226/you-and-your-friend-have-similar-dna</link>
	<title><![CDATA[You and your friend have similar DNA !!!]]></title>
	<description><![CDATA[<p>New research out of Massachusetts claims that people often choose friends that are similar to them in genetics and they are more accurate than you might suppose. A study published on PNAS&nbsp;http://www.pnas.org/content/111/Supplement_3/10796.full found that people are apt to pick friends who are genetically similar to themselves - so much so that friends tend to be as alike at the genetic level as a person's fourth cousin.</p><div style="text-align: center;"><img src="http://i.kinja-img.com/gawker-media/image/upload/s--CwLwHa43--/18fbmlokxcmqcjpg.jpg" alt="image" width="300" height="271" style="border: 0px; border: 0px;"></div><p>Scientists with a long-running Framingham Heart Study looked at 1,932 people (examination of about 1.5 million markers of genetic variations), comparing unrelated friends to unrelated strangers. They found that friends shared about 1% of their genes &mdash; a percentage much higher than those shared with strangers.This new findings made it clear that people have more DNA in common with those who are selected as friends than with strangers in the same population.&nbsp;</p><p>The genes that lined up the most were olfactory genes, which deal with smell. The ones that lined up the least were immune system genes. The researchers weren't sure why that happened :/. Olfactory genes might be a straightforward explanation: People who like the same smells tend to be drawn to similar environments, where they meet others with the same tendencies.</p><p>Reference:</p><p>http://www.pnas.org/content/111/Supplement_3/10796.full</p><p>Image : http://i.kinja-img.com</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</guid>
	<pubDate>Mon, 17 Aug 2020 05:25:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</link>
	<title><![CDATA[SqueezeMeta: a fully automated metagenomics pipeline, from reads to bins]]></title>
	<description><![CDATA[<p>SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes via binning procedures. Thus, SqueezeMeta features several unique characteristics:</p>
<ol>
<li>Co-assembly procedure with read mapping for estimation of the abundances of genes in each metagenome</li>
<li>Co-assembly of a large number of metagenomes via merging of individual metagenomes</li>
<li>Includes binning and bin checking, for retrieving individual genomes</li>
<li>The results are stored in a database, where they can be easily exported and shared, and can be inspected anywhere using a web interface.</li>
<li>Internal checks for the assembly and binning steps inform about the consistency of contigs and bins, allowing to spot potential chimeras.</li>
<li>Metatranscriptomic support via mapping of cDNA reads against reference metagenomes</li>
</ol><p>Address of the bookmark: <a href="https://github.com/jtamames/SqueezeMeta" rel="nofollow">https://github.com/jtamames/SqueezeMeta</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/13477/research-associate-at-indian-institute-of-chemical-technology-iict-hyderabad</guid>
  <pubDate>Thu, 07 Aug 2014 01:55:21 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate at Indian Institute of Chemical Technology (IICT), Hyderabad]]></title>
  <description><![CDATA[
<p>Indian Institute of Chemical Technology (IICT), Hyderabad, a constituent of CSIR is a leading research Institute in the area of chemical sciences. The core strength of IICT lies in Organic Chemistry, and it continues to excel in this field for over six decades. The research efforts during these years have resulted in the development of several innovative processes for a variety of products necessary for human welfare such as drugs, agrochemicals, food, organic intermediates, adhesives etc. More than 150 technologies developed by IICT are now in commercial production.</p>

<p>CSIR-IICT is conducting Walk in Interview for the following position on a purely temporary basis for the sponsored project "GENESIS (BSC-0121) at 10.00 AM on 19th August 2014 at IICT, Hyderabad</p>

<p>    Position : Research Associate<br />    No of Post : One<br />    Desired Profile : PhD in computation biology or M.Tech in Computational Biology with three years experience in relevant subject and atleast one research paper in SCI journal</p>

<p>    Experience : Knowledge in vector and vector borne disease, disease modeling, GIS mapping and modeling.<br />    Age : 35 years<br />    Stipend : Rs 22000/- + HRA</p>

<p>Eligible candidate may download the application form from our website http://www.iictindia.org and appear for interview along with the duly filled in application form supported by bio-data and one set of attested photo copies of certificates of educational qualification, age, experience, caste, latest photograph and the cadndidates are required to bring all the original certificates for verification</p>

<p>Walk in Interview : 19.08.14</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42946/aligngraph2-similar-genome-assisted-reassembly-pipeline-for-pacbio-long-reads</guid>
	<pubDate>Sun, 14 Mar 2021 09:42:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42946/aligngraph2-similar-genome-assisted-reassembly-pipeline-for-pacbio-long-reads</link>
	<title><![CDATA[AlignGraph2: similar genome-assisted reassembly pipeline for PacBio long reads]]></title>
	<description><![CDATA[<p><span>AlignGraph2 is the second version of&nbsp;</span><a href="https://github.com/baoe/AlignGraph">AlignGraph</a><span>&nbsp;for PacBio long reads. It extends and refines contigs assembled from the long reads with a published genome similar to the sequencing genome.</span></p>
<p><span>More at&nbsp;https://academic.oup.com/bib/advance-article-abstract/doi/10.1093/bib/bbab022/6146772</span></p><p>Address of the bookmark: <a href="https://github.com/huangs001/AlignGraph2" rel="nofollow">https://github.com/huangs001/AlignGraph2</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14003/jrf-position-in-the-faculty-of-life-sciences-biotechnology-at-sauth-asian-university</guid>
  <pubDate>Wed, 13 Aug 2014 07:16:30 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF position in the Faculty of Life Sciences &amp; Biotechnology at  Sauth Asian University]]></title>
  <description><![CDATA[
<p>Opening for a Project-JRF position in the Faculty of Life Sciences &amp; Biotechnology</p>

<p>Applications are invited for the post of Junior Research Fellow (JRF) in a DBT funded IYBA project entitled “Generatingaprotein-ncRNA interactome for Dorsal mediated gene regulation and dorso-ventral patterning genes in Drosophila” in the Lab. Of Molecular Biology at the Faculty of Life Sciences and Biotechnology, South Asian University, New Delhi. The project requires extensive use of molecular, genetic and genomic approaches.</p>

<p>POST: Junior Research Fellow (JRF)</p>

<p>NO. OF VACANCIE(S) - (01)</p>

<p>FELLOWSHIP: Rs. 16,000/- plus HRA</p>

<p>PROJECT DURATION: 2014-2016 (Two years)</p>

<p>LAST DATE FOR APPLICATION: Aug 18, 2014.</p>

<p>Eligibility criteria:</p>

<p>M.Sc./M.Tech./ in Biological Sciences/Biotechnology/Bio-Informatics. Candidates with research experience in the field of Drosophila/Yeast genetics will be preferred.</p>

<p>Application Procedure:</p>

<p>A covering letter along with your CV, copy of prior publications (if any) and proof of experience should be e-mailed to lmb_sau@aol.com. Hardcopy of the application should be brought on the day of interview along with other testimonials and marks statements for verification purpose.</p>

<p>IMPORTANT NOTE:</p>

<p>-No TA/DA will be paid for attending the interview.</p>

<p>-SAU may select candidates against the post depending upon qualification and experience of candidates and reserves the right to relax any of the qualifications in case the candidate is found otherwise well qualified by the Selection Committee</p>

<p>-The abovementioned post is temporary and will be initially offered for a period of one year and can be extended, on satisfactory performance. </p>

<p>More at http://www.sau.ac.in/recruitment/vacancy.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44171/hairsplitter-assembling-long-reads-in-an-unknown-number-of-haplotypes</guid>
	<pubDate>Wed, 07 Dec 2022 00:13:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44171/hairsplitter-assembling-long-reads-in-an-unknown-number-of-haplotypes</link>
	<title><![CDATA[HairSplitter: assembling long reads in an unknown number of haplotypes]]></title>
	<description><![CDATA[<p>Pros and cons of HairSplitter Limitations of HairSplitter:</p>
<p>Not very fast: it re-polishes the whole assembly&nbsp;</p>
<p>Limited in the number of haplotypes</p>
<p>Strengths of HairSplitter:</p>
<p>Very modular, can be used with any assembler</p>
<p>Naive: makes no assumption on ploidy, parameter-free</p>
<p>Safe: won&rsquo;t artificially duplicate contigs</p>
<p>&nbsp;</p>
<p>HairSplitter splits collapsed assemblies from &ldquo;draft&rdquo; assemblies obtained by any means</p>
<p>HairSplitter can recover haplotypes and distinguish repeated elements</p>
<p>Only needs sequencing reads, potentially error-prone</p>
<p>HairSplitter splits collapsed assemblies from &ldquo;draft&rdquo; assemblies obtained by any means</p>
<p>HairSplitter can recover haplotypes and distinguish repeated elements</p>
<p>Only needs sequencing reads, potentially error-prone</p>
<p>Not really available yet (github.com/RolandFaure/HairSplitter)</p>
<p>https://hal.archives-ouvertes.fr/hal-03864075/file/RolandFaure_presentation_SeqBIM_2022.pdf</p><p>Address of the bookmark: <a href="https://hal.archives-ouvertes.fr/hal-03817928/document" rel="nofollow">https://hal.archives-ouvertes.fr/hal-03817928/document</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/14054/project-fellow-at-institute-of-himalayan-bioresource-technology</guid>
  <pubDate>Fri, 15 Aug 2014 06:50:08 -0500</pubDate>
  <link></link>
  <title><![CDATA[Project Fellow at Institute of Himalayan Bioresource Technology]]></title>
  <description><![CDATA[
<p>Research Associate/ Project FellowDate of posting:14 Aug</p>

<p>Eligibility : MSc, M Phil / Phd, BE/B.Tech<br />Location : Himachal Pradesh-other<br />Job Category : Govt Jobs, Research, Walkin<br />Last Date : 20 Aug 2014</p>

<p>Advertisement No.6/2014</p>

<p>Post : Project Fellow<br />Research Associate/ Project Fellow Jobs opportunity in CSIR-Institute of Himalayan Bioresource Technology<br />M.Sc. in Bioinformatics/Computer Science with 55% marks and (ii) M.Sc. Bioinformatics/ Computational biology/ P.G. Diploma in Bioinformatics/B.Tech. or higher Degree in Bioinformatics with 55% marks</p>

<p>Date of Interview: 29.08.2014.</p>

<p>More at http://www.ihbt.res.in/recruit/AdvtNo6_2014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35055/jabba-hybrid-error-correction-for-long-sequencing-reads</guid>
	<pubDate>Fri, 05 Jan 2018 03:58:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35055/jabba-hybrid-error-correction-for-long-sequencing-reads</link>
	<title><![CDATA[Jabba: Hybrid Error Correction for Long Sequencing Reads]]></title>
	<description><![CDATA[<p>Jabba is a hybrid error correction tool to correct third generation (PacBio / ONT) sequencing data, using second generation (Illumina) data.</p>
<p>Input</p>
<p>Jabba takes as input a concatenated de Bruijn graph and a set of sequences:</p>
<p>the de Bruijn graph should appear in fasta format with 1 entry per node, the meta information should be in the format:<br>&gt;NODE <br>the set of sequences should be in fasta or fastq format. These sequences will be corrected (e.g. PacBio reads). The corrections will be written to a file Jabba fasta.<br>The output is a file in fasta format with corrections of the long reads, and additionally a file in the input format containing uncorrected reads.</p>
<p>https://github.com/biointec/jabba/wiki</p>
<p>https://almob.biomedcentral.com/articles/10.1186/s13015-016-0075-7</p><p>Address of the bookmark: <a href="https://github.com/biointec/jabba" rel="nofollow">https://github.com/biointec/jabba</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/14338/biology-computers-collide-in-high-demand-field-of-bioinformatics</guid>
	<pubDate>Mon, 25 Aug 2014 00:56:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/14338/biology-computers-collide-in-high-demand-field-of-bioinformatics</link>
	<title><![CDATA[Biology, Computers Collide in High-Demand Field of Bioinformatics]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/fk0z7KOTyMo" frameborder="0" allowfullscreen></iframe>Dr. Shivas Amin calls bioinformatics a "collision of biology and computers." Students learn how to use computers and skills in math and biology to analyze genome and proteome projects to prepare for high-demand jobs in the life sciences. Learn more about Amin and hear from student Medina Baitemirova and alumnus Lukas Simon about the fast-growing field of bioinformatics.]]></description>
	
</item>

</channel>
</rss>