<?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/26972?offset=400</link>
	<atom:link href="https://bioinformaticsonline.com/related/26972?offset=400" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/10260/%E2%80%9Con%E2%80%9D-and-%E2%80%9Coff%E2%80%9D-the-neuron</guid>
	<pubDate>Fri, 25 Apr 2014 19:31:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/10260/%E2%80%9Con%E2%80%9D-and-%E2%80%9Coff%E2%80%9D-the-neuron</link>
	<title><![CDATA[“On” and “Off” the neuron !!!]]></title>
	<description><![CDATA[<p><span>Optogenetics is a recent innovation in neuroscience that gives researchers the ability to control the activity of neurons with light. With this powerful tool, researchers are teasing apart the biological basis of memory, behavior, and disease (see &ldquo;<a href="http://www.technologyreview.com/news/517226/scientists-make-mice-remember-things-that-didnt-happen/"><span>Scientists Make Mice &lsquo;Remember&rsquo; Things That Didn&rsquo;t Happen</span></a>&rdquo; and &ldquo;<a href="http://www.technologyreview.com/news/423254/an-on-off-switch-for-anxiety/"><span>An On-Off Switch for Anxiety</span></a>,&rdquo;). But for the first several years of this technology&rsquo;s existence, the proteins that scientists added to neurons to make them react to light were only good at activating neurons. That limited researchers&rsquo; ability to understand neuronal circuits, sets of interconnected neurons that are thought to control behavior and, when misfiring, to underlie many brain conditions. Problems can arise from any imbalance in circuit activity, whether too much or too little.&nbsp;</span></p><p><span>Now, two research groups have engineered new optogenetic proteins that can be used to efficiently silence neurons.&nbsp;<span><span>One of the two new proteins comes from the lab of<span>&nbsp;</span><a href="http://www.stanford.edu/group/dlab/about_pi.html" target="_blank">Karl Deisseroth</a>, a psychiatrist and neuroscientist at Stanford University who helped develop optogenetics as a research tool.&nbsp;His group&rsquo;s new &ldquo;off&rdquo; switch for neurons was created by changing 10 of the 333 amino acids in an existing optogenetic protein, which itself had been engineered by combining natural proteins from<span>&nbsp;</span></span></span><a href="http://genome.jgi-psf.org/Chlre3/Chlre3.home.html" target="_blank"><span>green algae</span></a><span><span>. That advance&nbsp;</span><span>&ldquo;creates a powerful tool that allows neuroscientists to apply a brake in any specific circuit with millisecond precision,&rdquo; said Thomas&nbsp;Insel, director of the National Institute of Mental Health, in a released statement.&nbsp;</span><a href="http://www.sciencemag.org/content/344/6182/409" target="_blank"><span>The other new silencing protein</span></a>, developed by scientists at the H</span><span>umboldt University of Berlin and collaborators, was created by changing amino acids in the same existing optogenetic protein.&nbsp;</span></span></p><p><span><span>Some researchers are also looking to optogenetics as a potential treatment for patients with a variety of conditions (see &ldquo;</span></span><span><a href="http://www.technologyreview.com/news/524771/for-mice-and-maybe-men-pain-is-gone-in-a-flash/"><span>For Mice, and Maybe Men, Pain Is Gone in a Flash</span></a><span><span>,&rdquo; and &ldquo;</span></span><a href="http://www.technologyreview.com/news/506981/flipping-on-the-lights-to-halt-seizures/"><span>Flipping on the Lights to Halt Seizures</span></a><span><span>&rdquo;) but there are huge challenges to overcome. The method requires genetic modification of cells to make them light-sensitive. It also requires implanted light sources for all but the shallowest of nerve endings. <br /></span></span></span></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36736/checkmassessing-the-quality-of-microbial-genomes-recovered-from-isolates-single-cells-and-metagenomes</guid>
	<pubDate>Wed, 23 May 2018 04:39:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36736/checkmassessing-the-quality-of-microbial-genomes-recovered-from-isolates-single-cells-and-metagenomes</link>
	<title><![CDATA[CheckM:Assessing the quality of microbial genomes recovered from isolates, single cells, and metagenomes]]></title>
	<description><![CDATA[<p><span>CheckM provides a set of tools for assessing the quality of genomes recovered from isolates, single cells, or metagenomes. It provides robust estimates of genome completeness and contamination by using collocated sets of genes that are ubiquitous and single-copy within a phylogenetic lineage. Assessment of genome quality can also be examined using plots depicting key genomic characteristics (e.g., GC, coding density) which highlight sequences outside the expected distributions of a typical genome. CheckM also provides tools for identifying genome bins that are likely candidates for merging based on marker set compatibility, similarity in genomic characteristics, and proximity within a reference genome tree.</span></p><p>Address of the bookmark: <a href="http://ecogenomics.github.io/CheckM/" rel="nofollow">http://ecogenomics.github.io/CheckM/</a></p>]]></description>
	<dc:creator>Rahul Nayak</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/bookmarks/view/41669/filtlong-quality-filtering-tool-for-long-reads</guid>
	<pubDate>Wed, 13 May 2020 10:23:55 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41669/filtlong-quality-filtering-tool-for-long-reads</link>
	<title><![CDATA[Filtlong: quality filtering tool for long reads]]></title>
	<description><![CDATA[<p>Filtlong is a tool for filtering long reads by quality. It can take a set of long reads and produce a smaller, better subset. It uses both read length (longer is better) and read identity (higher is better) when choosing which reads pass the filter.</p>
<p>Filtlong builds into a stand-alone executable:</p>
<pre><code>git clone https://github.com/rrwick/Filtlong.git
cd Filtlong
make -j
bin/filtlong -h
</code></pre><p>Address of the bookmark: <a href="https://github.com/rrwick/Filtlong" rel="nofollow">https://github.com/rrwick/Filtlong</a></p>]]></description>
	<dc:creator>Radha Agarkar</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/pages/view/923/phylogenetic-for-bioinformatics</guid>
	<pubDate>Tue, 16 Jul 2013 03:50:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/923/phylogenetic-for-bioinformatics</link>
	<title><![CDATA[Phylogenetic for Bioinformatics]]></title>
	<description><![CDATA[<p>Biologists estimate that there are about 5 to 100 million species of organisms living on Earth today. Evidence from morphological, biochemical, and gene sequence data suggests that all organisms on Earth are genetically related, and the genealogical relationships of living things can be represented by a vast evolutionary tree, the Tree of Life. The Tree of Life then represents the phylogeny of organisms, i. e., the history of organismal lineages as they change through time.<br />Every living organism contains DNA, RNA, and proteins. Closely related organisms generally have a high degree of agreement in the molecular structure of these substances, while the molecules of organisms distantly related usually show a pattern of dissimilarity. Molecular phylogeny uses such data to build a "relationship tree" that shows the probable evolution of various organisms. Not until recent decades, however, has it been possible to isolate and identify these molecular structures.&nbsp;<br />phylogenetics is the study of evolutionary relatedness among various groups of organisms (for example, species or populations), which is discovered through molecular sequencing data and morphological data matrices. In other word, Phylogenetics, the science of phylogeny, is one part of the larger field of systematics, which also includes taxonomy. Taxonomy is the science of naming and classifying the diversity of organisms Molecular phylogeny is the use of the structure of molecules to gain information on an organism's evolutionary relationships. The result of a molecular phylogenetic analysis is expressed in a so-called phylogenetic tree.</p><p>The evolutionary connections between organisms are represented graphically through phylogenetic trees. Due to the fact that evolution takes place over long periods of time that cannot be observed directly, biologists must reconstruct phylogenies by inferring the evolutionary relationships among present-day organisms.&nbsp;<br />Application of the techniques that make this possible can be seen in the very limited field of human genetics, such as the ever more popular use of genetic testing to determine a child's paternity, as well as the emergence of a new branch of criminal forensics focused on genetic evidence.<br />The effect on traditional scientific classification schemes in the biological sciences has been dramatic as well. Work that was once immensely labor- and materials-intensive can now be done quickly and easily, leading to yet another source of information becoming available for systematic and taxonomic appraisal. This particular kind of data has become so popular that taxonomical schemes based solely on molecular data may be encountered. Proponents even claim that taxonomy was previously based on morphology alone, which of course is utter fable.<br /><br /><strong>For additional information on phylogenetics, see list of Phylogenetics Resources on the Internet.</strong></p><p>Phylogeny and Reconstructing Phylogenetic Trees:&nbsp;<a href="http://aleph0.clarku.edu/~djoyce/java/Phyltree/cover.html"></a><a href="http://aleph0.clarku.edu/~djoyce/java/Phyltree/cover.html">http://aleph0.clarku.edu/~djoyce/java/Phyltree/cover.html</a><br />the CBRG and Department of Statistics Phylogeny tutorial:&nbsp;<a href="http://www.compbio.ox.ac.uk/tutorials/phylogeny/"></a><a href="http://www.compbio.ox.ac.uk/tutorials/phylogeny/">http://www.compbio.ox.ac.uk/tutorials/phylogeny/</a><br />TUTORIAL: PHYLOGENETIC ANALYSIS USING PARSIMONY:<a href="http://home.cc.umanitoba.ca/~psgendb/GDE/phylogeny/parsimony/phylip.parsimony.html"></a><a href="http://home.cc.umanitoba.ca/~psgendb/GDE/phylogeny/parsimony/phylip.parsimony.html">http://home.cc.umanitoba.ca/~psgendb/GDE/phylogeny/parsimony/phylip.parsimony.html</a></p><p>PHYLIP:&nbsp;<a href="http://www.umanitoba.ca/afs/plant_science/psgendb/doc/Phylip/main.html"></a><a href="http://www.umanitoba.ca/afs/plant_science/psgendb/doc/Phylip/main.html">http://www.umanitoba.ca/afs/plant_science/psgendb/doc/Phylip/main.html</a><br />An Introduction to Molecular Phylogeny:&nbsp;<a href="http://bibiserv.techfak.uni-bielefeld.de/gcb04/tutorials/hoef-emden/GCB04Tut.pdf"></a><a href="http://bibiserv.techfak.uni-bielefeld.de/gcb04/tutorials/hoef-emden/GCB04Tut.pdf">http://bibiserv.techfak.uni-bielefeld.de/gcb04/tutorials/hoef-emden/GCB04Tut.pdf</a></p><p>How to make a phylogenetic tree:&nbsp;<a href="http://www.hiv.lanl.gov/content/sequence/TUTORIALS/TREE_TUTORIAL/Tree"></a><a href="http://www.hiv.lanl.gov/content/sequence/TUTORIALS/TREE_TUTORIAL/Tree">http://www.hiv.lanl.gov/content/sequence/TUTORIALS/TREE_TUTORIAL/Tree</a>tutorial.html<br />Phylogenetic Trees:&nbsp;<a href="http://cnx.org/content/m11052/latest/"></a><a href="http://cnx.org/content/m11052/latest/">http://cnx.org/content/m11052/latest/</a><br />Phylogeny by Ron Shamir:&nbsp;<a href="http://www.cs.tau.ac.il/~rshamir/algmb/01/scribe08/lec08.pdf"></a><a href="http://www.cs.tau.ac.il/~rshamir/algmb/01/scribe08/lec08.pdf">http://www.cs.tau.ac.il/~rshamir/algmb/01/scribe08/lec08.pdf</a><br />Introduction to Phylogeny:&nbsp;<a href="http://www.utm.edu/departments/cens/biology/rirwin/391/391Phylog.htm"></a><a href="http://www.utm.edu/departments/cens/biology/rirwin/391/391Phylog.htm">http://www.utm.edu/departments/cens/biology/rirwin/391/391Phylog.htm</a><br />Lecturer notes on Phylogeny:&nbsp;<a href="http://www.sbc.su.se/~bens/course_material/phylocourse1/lecture2.pdf"></a><a href="http://www.sbc.su.se/~bens/course_material/phylocourse1/lecture2.pdf">http://www.sbc.su.se/~bens/course_material/phylocourse1/lecture2.pdf</a><br />Principles and Practice of Phylogenetic Systematics:<a href="http://www.faculty.biol.ttu.edu/Strauss/Phylogenetics/LectureNotes.htm"></a><a href="http://www.faculty.biol.ttu.edu/Strauss/Phylogenetics/LectureNotes.htm">http://www.faculty.biol.ttu.edu/Strauss/Phylogenetics/LectureNotes.htm</a></p><p>Inferring phylogenetic trees:&nbsp;<a href="http://www.cis.hut.fi/Opinnot/T-61.6070/slides2008/pres_6070.pdf"></a><a href="http://www.cis.hut.fi/Opinnot/T-61.6070/slides2008/pres_6070.pdf">http://www.cis.hut.fi/Opinnot/T-61.6070/slides2008/pres_6070.pdf</a></p><p><strong>Lecture Notes</strong></p><p>Chapter 1 - The Diversity, Classification, and Evolution of Vertebrates:<a href="http://academic.emporia.edu/mooredwi/nathist/chap1.htm"></a><a href="http://academic.emporia.edu/mooredwi/nathist/chap1.htm">http://academic.emporia.edu/mooredwi/nathist/chap1.htm</a></p><p>Algorithms for Phylogenetic Reconstructions:<a href="http://lectures.molgen.mpg.de/Algorithmische_Bioinformatik_WS0405/phylogeny_script.pdf"></a><a href="http://lectures.molgen.mpg.de/Algorithmische_Bioinformatik_WS0405/phylogeny_script.pdf">http://lectures.molgen.mpg.de/Algorithmische_Bioinformatik_WS0405/phylogeny_script.pdf</a></p><p>Phylogeny.fr is a free, simple to use web service dedicated to reconstructing and analysing phylogenetic relationships between molecular sequences. Phylogeny.fr runs and connects various bioinformatics programs to reconstruct a robust phylogenetic tree from a set of sequences. For more detail :&nbsp;<a href="http://www.phylogeny.fr/version2_cgi/index.cgi"></a><a href="http://www.phylogeny.fr/version2_cgi/index.cgi">http://www.phylogeny.fr/version2_cgi/index.cgi</a></p><p>A Brief Tutorial on Phylogenetics<br /><a href="http://bioss.ac.uk/~dirk/talks/tutorial_phylogenetics.pdf"></a><a href="http://bioss.ac.uk/~dirk/talks/tutorial_phylogenetics.pdf">http://bioss.ac.uk/~dirk/talks/tutorial_phylogenetics.pdf</a></p><p>A Brief Tutorial on Phylogenetics Human Rabbit Chicken<br /><a href="http://bioss.ac.uk/~dirk/talks/psnup_tutorial_phylogenetics.pdf"></a><a href="http://bioss.ac.uk/~dirk/talks/psnup_tutorial_phylogenetics.pdf">http://bioss.ac.uk/~dirk/talks/psnup_tutorial_phylogenetics.pdf</a></p><p>Phylogenetic Tree Computation Tutorial Overview<br /><a href="http://pga.lbl.gov/Workshop/April2002/lectures/Olken.pdf"></a><a href="http://pga.lbl.gov/Workshop/April2002/lectures/Olken.pdf">http://pga.lbl.gov/Workshop/April2002/lectures/Olken.pdf</a></p><p>MrBayes: A program for the Bayesian inference of phylogeny<br /><a href="http://golab.unl.edu/teaching/SBseminar/manual.pdf"></a><a href="http://golab.unl.edu/teaching/SBseminar/manual.pdf">http://golab.unl.edu/teaching/SBseminar/manual.pdf</a></p><p><strong>Web sites providing software for the construction of phylogenetic trees</strong></p><ul>
<li><a href="http://www.mbio.ncsu.edu/BioEdit/bioedit.html">BioEdit</a></li>
</ul><ul>
<li><a href="http://www.dinofish.com/">Coelocanth-Fish Out of Time</a></li>
</ul><ul>
<li><a href="http://cbrg.inf.ethz.ch/">Computational Biochemistry Research Group</a></li>
</ul><ul>
<li><a href="http://www.geocities.com/RainForest/Vines/8695/software.html">Digital Taxonomy</a></li>
</ul><ul>
<li><a href="http://www.cladistics.org/education/hennig86.html">Hennig 86</a></li>
</ul><ul>
<li><a href="http://www.bioinformaticssolutions.com/">Hyperclean</a>&nbsp;from Bioinformatics Solutions, Inc.</li>
</ul><ul>
<li><a href="http://www.mun.ca/biology/scarr/Directory.html">Memorial University of Newfoundland</a></li>
</ul><ul>
<li><a href="http://morphbank.ebc.uu.se/mrbayes/">Mr. Bayes</a></li>
</ul><ul>
<li><a href="http://www.cladistics.com/about_nona.htm">NONA</a></li>
</ul><ul>
<li><a href="http://evolve.zoo.ox.ac.uk/">Oxford University Evolutionary Biology Group</a></li>
</ul><ul>
<li><a href="http://flatpebble.nceas.ucsb.edu/public/">Paleobiology Database</a></li>
</ul><ul>
<li><a href="http://paup.csit.fsu.edu/index.html">PAUP</a></li>
</ul><ul>
<li><a href="http://evolution.genetics.washington.edu/phylip.html">Phylip Homepage</a></li>
</ul><ul>
<li><a href="http://research.amnh.org/scicomp/projects/poy.php">Poy</a></li>
</ul><ul>
<li><a href="http://www.sinauer.com/">Sinauer Associates</a></li>
</ul><ul>
<li><a href="http://www.cladistics.org/downloads/webtnt.html">TNT</a>-Tree Analysis Using New Technology</li>
</ul><ul>
<li><a href="http://www.treebase.org/treebase/index.html">Tree Base</a></li>
</ul><ul>
<li><a href="http://www.treefinder.de/">Treefinder</a></li>
</ul><ul>
<li><a href="http://www.tree-puzzle.de/">Tree-Puzzle</a></li>
</ul><ul>
<li><a href="http://taxonomy.zoology.gla.ac.uk/rod/treeview.html">Tree View</a>-Taxonomy and Systematics Group at Glasgow</li>
</ul><ul>
<li><a href="http://evolution.genetics.washington.edu/phylip/software.html">Washington University</a>-List of Phylogeny Software</li>
</ul>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</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/bookmarks/view/4037/perl-and-bioperl-tutorials</guid>
	<pubDate>Wed, 28 Aug 2013 05:51:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/4037/perl-and-bioperl-tutorials</link>
	<title><![CDATA[Perl and BioPerl Tutorials]]></title>
	<description><![CDATA[<p>This bookmark is created to store the useful Perl and BioPerl tutorial links at one place. Feel free to share and add more useful tutorial links here ....&nbsp;</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://cbb.sjtu.edu.cn/course/database/beginning.pdf" rel="nofollow">http://cbb.sjtu.edu.cn/course/database/beginning.pdf</a></p>]]></description>
	<dc:creator>Jitendra Narayan</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/44200/dashboard-designing-tutorial</guid>
	<pubDate>Thu, 02 Mar 2023 06:48:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44200/dashboard-designing-tutorial</link>
	<title><![CDATA[Dashboard designing tutorial !]]></title>
	<description><![CDATA[<p>Dashboard Design Tutorial</p><p>Address of the bookmark: <a href="https://github.com/dthill196/SARS-2-Dashboard-Tutorial" rel="nofollow">https://github.com/dthill196/SARS-2-Dashboard-Tutorial</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>