<?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/26911?offset=1350</link>
	<atom:link href="https://bioinformaticsonline.com/related/26911?offset=1350" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/10749/memories-can-be-passed-down-through-dna</guid>
	<pubDate>Sat, 10 May 2014 21:24:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/10749/memories-can-be-passed-down-through-dna</link>
	<title><![CDATA[Memories Can Be Passed Down Through DNA]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/tbPwzII_g6o" frameborder="0" allowfullscreen></iframe>The premise of Assassin's Creed is the reliving of other people's memories stored inside DNA. Well scientists have found that in mice, it actually happens! Anthony is joined by special guest and our friend Tara Long from Hard Science to explain how this process works, and if it might apply to humans as well.

Read More: 
Parental olfactory experience influences behavior and neural structure in subsequent generations
http://www.nature.com/neuro/journal/vaop/ncurrent/abs/nn.3594.html
"Using olfactory molecular specificity, we examined the inheritance of parental traumatic exposure, a phenomenon that has been frequently observed, but not understood."

What Is Epigenetics?
http://www.sciencemag.org/content/330/6004/611
"The cells in a multicellular organism have nominally identical DNA sequences (and therefore the same genetic instruction sets), yet maintain different terminal phenotypes. This nongenetic cellular memory, which records developmental and environmental cues (and alternative cell states in unicellular organisms), is the basis of epi-(above)-genetics."

Epigenetics
http://en.wikipedia.org/wiki/Epigenetics

Watch More:
How to Change Your Genes
https://www.youtube.com/watch?v=B5DU9lgbsSE
TestTube Wild Card
http://testtube.com/dnews/dnews-231-how-too-many-screens-affect-our-brain?utm_source=YT&utm_medium=DNews&utm_campaign=DNWC
Is Sexiness Hereditary?
https://www.youtube.com/watch?v=z6STRCncvM8
____________________

DNews is dedicated to satisfying your curiosity and to bringing you mind-bending stories & perspectives you won't find anywhere else! New videos twice daily. 

Watch More DNews on TestTube http://testtube.com/dnews

Subscribe now! http://www.youtube.com/subscription_center?add_user=dnewschannel

DNews on Twitter http://twitter.com/dnews

Anthony Carboni on Twitter http://twitter.com/acarboni

Laci Green on Twitter http://twitter.com/gogreen18

Trace Dominguez on Twitter http://twitter.com/trace501

DNews on Facebook http://facebook.com/dnews

DNews on Google+ http://gplus.to/dnews

Discovery News http://discoverynews.com]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37561/hercules-a-profile-hmm-based-hybrid-error-correction-algorithm-for-long-reads</guid>
	<pubDate>Mon, 20 Aug 2018 14:14:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37561/hercules-a-profile-hmm-based-hybrid-error-correction-algorithm-for-long-reads</link>
	<title><![CDATA[Hercules: a profile HMM-based hybrid error correction algorithm for long reads]]></title>
	<description><![CDATA[<p><span>Choosing whether to use second or third generation sequencing platforms can lead to trade-offs between accuracy and read length. Several studies require long and accurate reads including de novo assembly, fusion and structural variation detection. In such cases researchers often combine both technologies and the more erroneous long reads are corrected using the short reads. Current approaches rely on various graph based alignment techniques and do not take the error profile of the underlying technology into account. Memory- and time- efficient machine learning algorithms that address these shortcomings have the potential to achieve better and more accurate integration of these two technologies. Results: We designed and developed Hercules, the first machine learning-based long read error correction algorithm. The algorithm models every long read as a profile Hidden Markov Model with respect to the underlying platformtextquoterights error profile. The algorithm learns a posterior transition/emission probability distribution for each long read and uses this to correct errors in these reads. Using datasets from two DNA-seq BAC clones (CH17-157L1 and CH17-227A2), and human brain cerebellum polyA RNA-seq, we show that Hercules-corrected reads have the highest mapping rate among all competing algorithms and highest accuracy when most of the basepairs of a long read are covered with short reads. Availability: </span></p>
<p><span>Hercules source code is available at https://github.com/BilkentCompGen/Hercules</span></p><p>Address of the bookmark: <a href="https://github.com/BilkentCompGen/Hercules" rel="nofollow">https://github.com/BilkentCompGen/Hercules</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10773/bioinformatics-jrfsrf-position-at-national-research-centre-on-plant-biotechnology</guid>
  <pubDate>Sun, 11 May 2014 22:29:12 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics JRF/SRF position at NATIONAL RESEARCH CENTRE ON PLANT BIOTECHNOLOGY]]></title>
  <description><![CDATA[
<p>NATIONAL RESEARCH CENTRE ON PLANT BIOTECHNOLOGY<br />LBS, CENTRE, PUSA CAMPUS, IARI NEW DELHI<br />NEW DELHI – 110 012</p>

<p>WALK- IN –INTERVIEWS</p>

<p>Eligible candidates may appear in Walk-in-Interview on May 23, 2014 at 10 AM for the posts of Research Associates &amp; Senior Research Fellows (SRF) in the following DST/DBT/ICAR funded projects.</p>

<p>1 NPTC Project on Bioinformatics and Comparative Genomics</p>

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

<p>Rs. 24000/- + 30% HRA for masters degree holder with more than 4 years experience</p>

<p>Essential: Ph D in Plant Molecular Biology &amp; Biotechnology/Genetics 0r Candidates who have already submitted their Ph D thesis in above subjects</p>

<p>Desirable: Research experience in Genomics, Molecular biology, Microarrays analysis, Gene cloning, transgenic Techniques , and computational analysis.</p>

<p>Senior Research Fellow ( UGCCSIR/ DBT/ ICAR Net qualified only): (One)</p>

<p>Rs. 16000/- + 30% HRA and Rs. 18000+30 HRA from 3rd year onwards</p>

<p>Essential:</p>

<p>1. ICAR/ UGCCSIR/DBT Net qualified only</p>

<p>2. M. Sc. (with thesis) in Biotechnology, Life Sciences, Biosciences/ Bioinformatics, Genetics/ Plant Pathology with experience in molecular biology.</p>

<p>Or M.Sc with more than 3 years research experiences</p>

<p>3. B.Sc. Agriculture or Biology</p>

<p>Desirable:<br />1. M. Sc. with thesis<br />2. Experience in molecular biology, plant tissue culture<br />3. Bioinformatics knowledge is important</p>

<p>2 DST JC Bose National Fellowship</p>

<p>Research Associate (Bioinformatics) : One</p>

<p>Rs.22000/- + 30% HRA for 1 &amp; 2nd Yr., Rs. 23000+ 30% HRA for 3rd year and Rs. 24000+30% HRA for 4th &amp;5th yr</p>

<p>Essential: M Ph D in Plant Molecular Biology &amp; Biotechnology/Genetics</p>

<p>Desirable: Research experience in Genomics, Molecular biology, Microarrays analysis, Gene cloning, transgenic Techniques , and computational analysis.</p>

<p>Age limit: Max.35 years (Age relaxation of 5 years for SC/ST &amp; women and 3 years for OBC)</p>

<p>The posts are purely temporary in nature and are co-terminus with the project. Initially the offer will be made for one year only and may be further extendable based on performance of the candidate. The interview will be held on May 23 , 2014 at 10:00 AM at NRCPB, LBS Building, Pusa Campus, IARI, New Delhi- 110012. The candidates must bring four copies of biodata (in the prescribed proforma), original certificates, attested photocopies of each of the certificates and an attested copy of recent passport size photograph. No. TA/DA would be given for the appearance in interview. Only the candidates having essential qualification would be entertained for the interviews. Short-listing of candidates based on academic merit and experience will be done in case of large number of applicants.</p>

<p>Advertisement: http://www.nrcpb.org/sites/default/files/Advertisement%20for%20RA%20and%20SRF%20Position.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</guid>
	<pubDate>Thu, 06 Sep 2018 16:21:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</link>
	<title><![CDATA[LoRMA: A tool for correcting sequencing errors in long reads]]></title>
	<description><![CDATA[<p><span>An error correction method that uses long reads only. The method consists of two phases: first, we use an iterative alignment-free correction method based on de Bruijn graphs with increasing length of&nbsp;</span><em>k</em><span>-mers, and second, the corrected reads are further polished using long-distance dependencies that are found using multiple alignments. According to our experiments, the proposed method is the most accurate one relying on long reads only for read sets with high coverage. Furthermore, when the coverage of the read set is at least 75&times;, the throughput of the new method is at least 20% higher.</span></p>
<blockquote>
<p><span>conda install -c atgc-montpellier lorma</span></p>
</blockquote><p>Address of the bookmark: <a href="https://gite.lirmm.fr/lorma/lorma-releases/wikis/home" rel="nofollow">https://gite.lirmm.fr/lorma/lorma-releases/wikis/home</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/12943/a-history-of-bioinformatics-in-the-year-2039</guid>
	<pubDate>Wed, 23 Jul 2014 06:37:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/12943/a-history-of-bioinformatics-in-the-year-2039</link>
	<title><![CDATA[A History of Bioinformatics (in the Year 2039)]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/uwsjwMO-TEA" frameborder="0" allowfullscreen></iframe><p>C. Titus Brown http://video.open-bio.org/video/1/a-history-of-bioinformatics-in-the-year-2039</p>]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37959/rainbow-an-integrated-tool-for-efficient-clustering-and-assembling-rad-seq-reads</guid>
	<pubDate>Fri, 19 Oct 2018 08:23:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37959/rainbow-an-integrated-tool-for-efficient-clustering-and-assembling-rad-seq-reads</link>
	<title><![CDATA[Rainbow: an integrated tool for efficient clustering and assembling RAD-seq reads]]></title>
	<description><![CDATA[<p><span>Rainbow is developed to provide an ultra-fast and memory-efficient solution to clustering and assembling short reads produced by RAD-seq. First, Rainbow clusters reads using a spaced seed method. Then, Rainbow implements a heterozygote calling like strategy to divide potential groups into haplotypes in a top&ndash;down manner. And along a guided tree, it iteratively merges sibling leaves in a bottom&ndash;up manner if they are similar enough. Here, the similarity is defined by comparing the 2nd reads of a RAD segment. This approach tries to collapse heterozygote while discriminate repetitive sequences. At last, Rainbow uses a greedy algorithm to locally assemble merged reads into contigs. Rainbow not only outputs the optimal but also suboptimal assembly results. Based on simulation and a real guppy RAD-seq data, we show that Rainbow is more competent than the other tools in dealing with RAD-seq data</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/bio-rainbow/files/" rel="nofollow">https://sourceforge.net/projects/bio-rainbow/files/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/11144/scientists-map-17294-proteins-produced-in-human-body</guid>
	<pubDate>Thu, 29 May 2014 01:57:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/11144/scientists-map-17294-proteins-produced-in-human-body</link>
	<title><![CDATA[Scientists map 17,294 proteins produced in human body]]></title>
	<description><![CDATA[<p>Indian scientists missed the genomic profiling bus, but they've more than made up for it by creating the first human proteome map which is an extension of the genomic study. Till now, here is no direct equivalent for the human proteome. But recently two groups present mass spectrometry-based analysis of human tissues, body fluids and cells mapping the large majority of the human proteome.</p><p>The Indian scientists working in Bangalore, along with their American counterparts, have mapped more than 17,000 proteins in 30 organs of the human body. Just like the human genome was sequenced around the turn of the millennium, this is an equivalent mapping of the human proteome.<br /><br />The researcher estimated there are around 20,500 proteins in the human body. These scientists have profiled around 17,294, which account for around 84% of the total proteins. Apart from this, the team also traced around 2,500 of 3,000 proteins that had been categorised as "missing proteins".</p><p>The work, done by group of Indian scientists, and Johns Hopkins University, published in the renowned journal Nature ( http://www.nature.com/nature/journal/v509/n7502/full/nature13302.html ). Of the 72 people who worked on the project, 46 are Indians.</p><p>Reference:</p><p>http://www.nature.com/nature/journal/v509/n7502/full/nature13302.html</p><p>http://www.proteinatlas.org/ -The antibody-based Human Protein Atlas programme</p><p>http://www.humanproteomemap.org/ -Proteogenomic analysis by identifying translated proteins from annotated pseudogenes, non-coding RNAs and untranslated regions.</p><p>https://www.proteomicsdb.org/ -Assembled protein evidence for 18,097 genes in ProteomicsDB</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39671/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads</guid>
	<pubDate>Sat, 06 Jul 2019 03:48:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39671/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads</link>
	<title><![CDATA[Flye: Fast and accurate de novo assembler for single molecule sequencing reads]]></title>
	<description><![CDATA[<p><span>Flye is a de novo assembler for single molecule sequencing reads, such as those produced by PacBio and Oxford Nanopore Technologies. It is designed for a wide range of datasets, from small bacterial projects to large mammalian-scale assemblies. The package represents a complete pipeline: it takes raw PB / ONT reads as input and outputs polished contigs. Flye also includes a special mode for metagenome assembly.</span></p><p>Address of the bookmark: <a href="https://github.com/fenderglass/Flye" rel="nofollow">https://github.com/fenderglass/Flye</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<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/videolist/watch/11354/genomics-and-personalized-medicine</guid>
	<pubDate>Sun, 01 Jun 2014 23:38:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/11354/genomics-and-personalized-medicine</link>
	<title><![CDATA[Genomics and Personalized Medicine]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/pgHAXCMMcro" frameborder="0" allowfullscreen></iframe>(October 20, 2009) Michael Snyder, Professor of Genetics and Chair of the Department of Genetics at Stanford, discusses advances in gene sequencing, the impact of genomics on medicine, the potential for personalized medicine. and efforts at Stanford to further study these issues.

Stanford Mini Med School is a series arranged and directed by Stanford's School of Medicine, and presented by the Stanford Continuing Studies program. Featuring more than thirty distinguished, faculty, scientists and physicians from Stanford's medical school, the series offers students a dynamic introduction to the world of human biology, health and disease, and the groundbreaking changes taking place in medical research and health care.

Stanford University
http://www.stanford.edu

Stanford University School of Medicine
http://med.stanford.edu

Stanford Continuing Studies
http://continuingstudies.stanford.edu

Stanford University Channel on YouTube:
http://www.youtube.com/stanford]]></description>
	
</item>

</channel>
</rss>