<?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/32719?offset=870</link>
	<atom:link href="https://bioinformaticsonline.com/related/32719?offset=870" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45273/a-subway-map-for-the-genome</guid>
	<pubDate>Fri, 04 Sep 2026 04:14:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45273/a-subway-map-for-the-genome</link>
	<title><![CDATA[A Subway Map for the Genome]]></title>
	<description><![CDATA[<p>Maya was looking at a genome graph on her computer. There were nodes, branches, and paths going in every direction.</p><p>&ldquo;It&rsquo;s like a subway map,&rdquo; she said, &ldquo;but for DNA.&rdquo;</p><p>That idea is exactly what Sequence Tube Map brings to life.</p><p>Instead of showing a genome as one long, confusing sequence, it displays different genomic paths like routes on a metro map. Where sequences are shared, the paths travel together. Where genetic variation occurs, they branch into different routes and may join again later.</p><p>This makes complex genome graphs much easier to explore.</p><p>Maya could now see how different haplotypes moved through the same genomic region and where they took different paths. She could even view sequencing reads mapped onto the graph, helping her understand what was happening in regions with genetic variation.</p><p>What once looked like a tangled network now looked like a journey.</p><p>Sequence Tube Map turns the complexity of graph genomes into a visual story&mdash;making it easier for scientists to see how DNA can take different routes.</p><p>Read more at&nbsp; https://github.com/vgteam/sequencetubemap&nbsp;</p><p>and</p><p>https://academic.oup.com/bioinformatics/article/35/24/5318/5542397</p><p>Demo at&nbsp;https://vgteam.github.io/sequenceTubeMap/</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/10409/check-linux-server-configuration</guid>
	<pubDate>Tue, 06 May 2014 01:10:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/10409/check-linux-server-configuration</link>
	<title><![CDATA[Check Linux server configuration !!]]></title>
	<description><![CDATA[<p>Bioinformatician uses servers for computational analysis. Sometime we need to check the server details before running our programs or tools. Here I am showing some basic commands using them you can gather the system/server information.<br /><br />To check what version of Operating System is installed on the server you can use the following commands:-<br />&nbsp;=================================================================<br />1.cat /etc/issue<br />[root@localhost ~]# cat /etc/issue<br />Red Hat Enterprise Linux Server release 5.5 (Tikanga)<br />Kernel \r on an \m<br /><br />2.cat /etc/redhat-release<br />[root@localhost ~]# cat /etc/redhat-release<br />Red Hat Enterprise Linux Server release 5.5 (Tikanga)<br /><br /><br />3.lsb_release -a<br />[root@localhost ~]# lsb_release -a<br />LSB Version:&nbsp;&nbsp;&nbsp; :core-3.1-ia32:core-3.1-noarch:graphics-3.1-ia32:graphics-3.1-noarch<br />Distributor ID: RedHatEnterpriseServer<br />Description:&nbsp;&nbsp;&nbsp; Red Hat Enterprise Linux Server release 5.5 (Tikanga)<br />Release:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 5.5<br />Codename:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Tikanga<br /><br /><br /><br />To check whether the operating system is 32 or 64bit:-<br />================================<br /># uname -i<br />[root@localhost ~]# uname -i<br />i386<br />(i386 represents that server is having 32bit operating system)<br /><br />[root@localhost ~]# uname -i<br />x86_64<br />(x86_64 represents that server is having 64bit operating system)<br /><br />To see the processor/CPU information:-<br />=============================<br /># cat /proc/cpuinfo<br />[root@localhost ~] cat /proc/cpuinfo<br />processor&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 0<br />vendor_id&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : GenuineIntel<br />cpu family&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 6<br />model&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 15<br />model name&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : Intel(R) Xeon(R) CPU&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 5130&nbsp; @ 2.00GHz<br />stepping&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 6<br />cpu MHz&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 1995.087<br />cache size&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 4096 KB<br />physical id&nbsp;&nbsp;&nbsp;&nbsp; : 0<br />siblings&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 2<br />core id&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 0<br />cpu cores&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 2<br />apicid&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 0<br />fdiv_bug&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : no<br />hlt_bug&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : no<br />f00f_bug&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : no<br />coma_bug&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : no<br />fpu&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : yes<br />fpu_exception&nbsp;&nbsp; : yes<br />cpuid level&nbsp;&nbsp;&nbsp;&nbsp; : 10<br />wp&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : yes<br />flags&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe nx lm constant_tsc pni monitor ds_cpl vmx tm2 ssse3 cx16 xtpr lahf_lm<br />bogomips&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; : 3990.17<br />(Here processor number 0 indicates that the system is having one process(processor number starts with zero))<br /><br /><br /><br /><br />To check memory information:-<br />===========================<br /># free -m<br />[root@localhost ~]# free -m<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; total&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; used&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; free&nbsp;&nbsp;&nbsp;&nbsp; shared&nbsp;&nbsp;&nbsp; buffers&nbsp;&nbsp;&nbsp;&nbsp; cached<br />Mem:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 5066&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 3513&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1552&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 612&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2319<br />-/+ buffers/cache:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 582&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 4484<br />Swap:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1983&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1983<br /><br /><br /><br /># cat /proc/meminfo<br />[root@localhost ~]# cat /proc/meminfo<br />MemTotal:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 5187752 kB<br />MemFree:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1639300 kB<br />Buffers:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 627024 kB<br />Cached:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2374944 kB<br />SwapCached:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0 kB<br />Active:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2458788 kB<br />Inactive:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 920964 kB<br />HighTotal:&nbsp;&nbsp;&nbsp;&nbsp; 4325164 kB<br />HighFree:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 1561936 kB<br />LowTotal:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 862588 kB<br />LowFree:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 77364 kB<br />SwapTotal:&nbsp;&nbsp;&nbsp;&nbsp; 2031608 kB<br />SwapFree:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2031608 kB<br />Dirty:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 704 kB<br />Writeback:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0 kB<br />AnonPages:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 377892 kB<br />Mapped:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 35328 kB<br />Slab:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 153036 kB<br />PageTables:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 6316 kB<br />NFS_Unstable:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0 kB<br />Bounce:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0 kB<br />CommitLimit:&nbsp;&nbsp; 4625484 kB<br />Committed_AS:&nbsp;&nbsp; 977132 kB<br />VmallocTotal:&nbsp;&nbsp; 116728 kB<br />VmallocUsed:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 4492 kB<br />VmallocChunk:&nbsp;&nbsp; 112124 kB<br />HugePages_Total:&nbsp;&nbsp;&nbsp;&nbsp; 0<br />HugePages_Free:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0<br />HugePages_Rsvd:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 0<br />Hugepagesize:&nbsp;&nbsp;&nbsp;&nbsp; 2048 kB<br /><br /><br />To check the model and serial name of the server:-<br />=======================================<br />[root@localhost ~]#&nbsp; dmidecode | egrep -i "product name|Serial number"<br />Product Name: PowerEdge R710<br />Serial Number: AB8CDE1<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;<br /><br />To check the host name:-<br />=====================<br />[root@localhost ~]# uname -n<br />localhost<br /><br />[root@localhost ~]# hostname<br />localhost<br /><br />To check the kernel version:-<br />========================<br />[root@localhost ~]# uname -r<br />2.6.18-238.9.1.el5PAE</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45306/the-genes-that-travel-together-a-genomic-detective-story</guid>
	<pubDate>Fri, 11 Sep 2026 13:00:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45306/the-genes-that-travel-together-a-genomic-detective-story</link>
	<title><![CDATA[The Genes That Travel Together: A Genomic Detective Story]]></title>
	<description><![CDATA[<p>Imagine looking through thousands of microbial genomes and discovering two genes that repeatedly appear together. The obvious conclusion is that they must somehow be connected&mdash;that perhaps they work together, participate in the same pathway, or depend on each other. But evolution has a way of leaving misleading clues. What if these two genes are found together simply because they were inherited from the same ancient ancestor? In that case, their apparent association may have little to do with their biological function; it may simply be a reflection of shared evolutionary history. This is the intriguing problem addressed by CORGIAS (https://github.com/ynishimuraLv/corgias), a computational framework developed to distinguish genuine gene associations from correlations created by common ancestry.</p><p>Instead of asking only whether two genes occur together across genomes, CORGIAS asks a deeper question: did these genes actually evolve together, repeatedly gaining or losing their presence in concert, or are they merely travelling together because of their inherited history? The framework introduces two complementary approaches, Ancestral State Adjustment (ASA) and the Simultaneous EVolution test (SEV), which incorporate evolutionary information into the search for gene associations. This distinction becomes increasingly important as genome sequencing continues to uncover enormous numbers of microbial genomes, many from organisms that have never been cultured and whose genes remain functionally mysterious. In this growing genomic landscape, simply finding a gene is no longer enough&mdash;we need clues about what that gene might be doing. CORGIAS approaches this problem almost like a genomic detective: rather than treating every association as evidence, it reconstructs the evolutionary story behind the association and asks whether the evidence survives that history. By doing so, it offers a way to separate coincidence from biological connection and potentially uncover functional relationships hidden within the vast microbial genomic landscape. The broader message is beautifully simple: genes do not evolve in isolation, and understanding what they do may require us to look beyond where they are today and reconstruct how they arrived there. Sometimes, the most important clue in a genome is not the gene itself, but the evolutionary journey it has taken.</p><p>More at&nbsp;https://academic.oup.com/nargab/article/7/4/lqaf182/8377910?</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/10460/assistant-professor-at-jawaharlal-nehru-university-in-delhi</guid>
  <pubDate>Wed, 07 May 2014 00:29:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor at Jawaharlal Nehru University in Delhi]]></title>
  <description><![CDATA[
<p>Advt. No. RC/48/2014</p>

<p>SCHOOL OF COMPUTATIONAL AND INTEGRATIVE SCIENCES (SC&amp;IS)</p>

<p>ESSENTIAL QUALIFICATION : - M.Sc./M.Tech. in Physics/ Chemistry/ Biology/ Mathematics/ Statistics/ Bioinformatics/ Computational Biology. Ph.D. in the broad areas of Bioinformatics/ Computational Biology. Candidates must have demonstrated capabilities in terms of high impact research publications in either of the above mentioned areas.</p>

<p>Scale of Pay : - 15600-39100/- (PB-III) AGP Rs. 6000/-</p>

<p>For more details on Centre/School, Specializations etc. please visit JNU website www.jnu.ac.in or contact Section Officer, Room Nos. 131-132, Recruitment Cell, Administrative Block, JNU, New Delhi – 110067, Email: recruitmentjnu2013@gmail.com The last date for the receipt of application is 15 May, 2014.</p>

<p>http://www.jnu.ac.in/Career/</p>

<p>http://www.jnu.ac.in/Career/ADVTNo_RC_48_2014.pdf<br />Last Apply Date:</p>

<p>15 May 2014</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/2791/ncbi-psi-blast-tutorial</guid>
	<pubDate>Fri, 23 Aug 2013 02:25:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/2791/ncbi-psi-blast-tutorial</link>
	<title><![CDATA[NCBI PSI-BLAST Tutorial]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/T3kHEieyylk" frameborder="0" allowfullscreen></iframe>http:--www.biotechnology.jhu.edu-
Tutorial for PSI-BLAST, an extension of BLAST that uses matrix algebra. BLAST is a cornerstone bioinformatics tool at NCBI. BLAST is the
Basic Local Alignment Search tool and will protein and DNA sequences that
are related to a sequence that the user provides.]]></description>
	
</item>
<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/videolist/watch/16685/webinar-blast-in-the-cloud</guid>
	<pubDate>Mon, 15 Sep 2014 17:29:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/16685/webinar-blast-in-the-cloud</link>
	<title><![CDATA[Webinar: BLAST in the Cloud]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/wLm-RfdcvnU" frameborder="0" allowfullscreen></iframe>Presented July 30, 2014 and covering: an NCBI BLAST AMI at Amazon Web Services; introduction to AWS and setting up an instance; running command line BLAST and using the BLAST URL API via the AMI; and answers to attendee questions.]]></description>
	
</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/news/view/39865/blast-nr-version-5-database-nr-v5</guid>
	<pubDate>Fri, 23 Aug 2019 11:35:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/39865/blast-nr-version-5-database-nr-v5</link>
	<title><![CDATA[BLAST nr version 5 database, (nr_v5)]]></title>
	<description><![CDATA[<p>NCBI have made changes the nr version 5 database, (nr_v5), to facilitate better search results and improved performance by reducing the number of redundant titles in the nr_v5 database used by webBLAST, which is also available for&nbsp;BLAST+ users.</p><p><span style="text-decoration: underline;"></span></p><p>The changes in nr preserve the taxonomic diversity of the entries in the database while reducing the number of titles for identical sequences. GenPept accessions are still accessible via&nbsp;<a href="http://www.ncbi.nlm.nih.gov/protein/$GENBANK_ACCESSION" target="_blank">www.ncbi.nlm.nih.gov/protein/$GENBANK_ACCESSION</a>&nbsp;or the IPG website&nbsp;<a href="https://www.ncbi.nlm.nih.gov/ipg/" target="_blank">https://www.ncbi.nlm.nih.gov/ipg/</a>.<span style="text-decoration: underline;"></span><span style="text-decoration: underline;"></span></p><p>The "Identical Proteins" link in the alignments section of the webBLAST results takes you to a full list of all accessions associated with a sequence.</p><p><span style="text-decoration: underline;"></span></p><p>For&nbsp;BLAST+ users downloading nr_v5: the database is now approximately 50% smaller, resulting in faster downloads and&nbsp;BLAST&nbsp;searches, and smaller disk space requirements. The database is downloadable at: &nbsp;<a href="ftp://ftp.ncbi.nlm.nih.gov/blast/db/v5/" target="_blank">ftp://ftp.ncbi.nlm.nih.gov/blast/db/v5/</a></p><p><span style="text-decoration: underline;"></span></p><p>For&nbsp;BLAST+ there is a cleanup script to help you manage the transition to this smaller database. The script removes unused database volumes:&nbsp;<a href="ftp://ftp.ncbi.nlm.nih.gov/blast/temp/cleanup-blastdb-volumes.py" target="_blank">ftp://ftp.ncbi.nlm.nih.gov/blast/temp/cleanup-blastdb-volumes.py</a></p><p><span style="text-decoration: underline;"></span></p><p>Here are the new rules on how we keep titles in nr_v5:</p><p><span style="text-decoration: underline;"></span></p><p>1.&nbsp;&nbsp;&nbsp; We keep all refseq, swissprot, pir and PDB titles.<span style="text-decoration: underline;"></span><span style="text-decoration: underline;"></span></p><p>2.&nbsp; &nbsp;&nbsp;We keep any GenPept titles with a TAXID that has not already been seen in the record.<span style="text-decoration: underline;"></span><span style="text-decoration: underline;"></span></p><p>3.&nbsp; &nbsp;&nbsp;We keep at least five GenPept titles regardless of whether the TAXIDS have been seen before or not in this record.</p>]]></description>
	<dc:creator>Jit</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>

</channel>
</rss>