<?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/32633?offset=1360</link>
	<atom:link href="https://bioinformaticsonline.com/related/32633?offset=1360" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27078/homer-software-for-motif-discovery-and-next-gen-sequencing-analysis</guid>
	<pubDate>Tue, 26 Apr 2016 03:48:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27078/homer-software-for-motif-discovery-and-next-gen-sequencing-analysis</link>
	<title><![CDATA[HOMER:  Software for motif discovery and next-gen sequencing analysis]]></title>
	<description><![CDATA[<p><span>This tutorial covers topics independently of HOMER, and represents knowledge which is important to know before diving head first into more advanced analysis tools such as HOMER.</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/computerSetup.html">Setting up your computing environment</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/retrieveFiles.html">Retrieving and storing sequencing files</a>&nbsp;(your own data or from public sources)</li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/fastqFiles.html">Checking sequence quality, trimming, general sequence manipulation</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/mapping.html">Mapping reads to a reference genome</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/samfiles.html">Manipulating SAM/BAM alignment files</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/genomeBrowsers.html">Visualizing data in a genome browser</a></li>
</ol>
<p><br>RNA-Seq</p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/rnaseqCufflinks.html">De novo transcript discovery and differential analysis with Cufflinks</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/rnaseqR.html">Differential expression analysis with R/Bioconductor</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/clustering.html">Clustering of large expression datasets (microarray or RNA-Seq)</a></li>
</ol>
<p><br><span>Microarray</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/affymetrix.html">Basic analysis of Affymetrix Gene Expression Arrays using R/Bioconductor</a></li>
</ol>
<p><span>General Tips for Data Analysis</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/excelTips.html">Excel workarounds, adding gene annotation, X-Y plots tips, etc.</a></li>
</ol><p>Address of the bookmark: <a href="http://homer.salk.edu/homer/basicTutorial/" rel="nofollow">http://homer.salk.edu/homer/basicTutorial/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27099/rasttk-algorithm-for-building-custom-annotation-pipelines-and-annotating-batches-of-genomes</guid>
	<pubDate>Wed, 27 Apr 2016 11:07:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27099/rasttk-algorithm-for-building-custom-annotation-pipelines-and-annotating-batches-of-genomes</link>
	<title><![CDATA[RASTtk : algorithm for building custom annotation pipelines and annotating batches of genomes]]></title>
	<description><![CDATA[<p>The RAST (Rapid Annotation using Subsystem Technology) annotation engine was built in 2008 to annotate bacterial and archaeal genomes. It works by offering a standard software pipeline for identifying genomic features (i.e., protein-encoding genes and RNA) and annotating their functions. Recently, in order to make RAST a more useful research tool and to keep pace with advancements in bioinformatics, it has become desirable to build a version of RAST that is both customizable and extensible. In this paper, we describe the RAST tool kit (RASTtk), a modular version of RAST that enables researchers to build custom annotation pipelines. RASTtk offers a choice of software for identifying and annotating genomic features as well as the ability to add custom features to an annotation job. RASTtk also accommodates the batch submission of genomes and the ability to customize annotation protocols for batch submissions. This is the first major software restructuring of RAST since its inception.</p>
<p>More at http://www.nature.com/articles/srep08365</p><p>Address of the bookmark: <a href="http://rast.nmpdr.org/" rel="nofollow">http://rast.nmpdr.org/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29343/accnet</guid>
	<pubDate>Fri, 07 Oct 2016 05:22:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29343/accnet</link>
	<title><![CDATA[AccNET]]></title>
	<description><![CDATA[<p><span>AccNET is a Perl application that presents a new way to study the accessory genome of a given set of organisms. Using the proteomes of these organisms, AccNET create a bipartite network compatible with common network analysis platforms. AccNET collects phylogenetic and functional information in a network improving the analysis capability. Networks offer a new perspective of organism organization through elements acquired by horizontal gene transfers and not constricted by hierarchical structures.</span></p>
<p><span>More at&nbsp;https://www.youtube.com/watch?v=vdGuy1GAJrQ</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/accnet/" rel="nofollow">https://sourceforge.net/projects/accnet/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27240/bioinformatics-tutor-at-pgimer</guid>
  <pubDate>Wed, 04 May 2016 08:40:26 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Tutor at PGIMER]]></title>
  <description><![CDATA[
<p>Postgraduate Institute of Medical Education and Research (PGIMER) - Chandigarh, Chandigarh<br />₹9,300 - ₹34,800 a month<br />Postgraduate Institute of Medical Education and Research (PGIMER), Chandigarh invites Online Applications for recruitment of following Group 'A', 'B' and 'C' posts. The closing date for submission of online applications is up to 12th May 2016.</p>

<p>No of Vacancies: 01<br />Pay Scale: Rs. 9300-34800 + Grade Pay Rs. 4600/-</p>

<p>Educational Qualification and Experience: (From Recognized University / Institute) M.Sc. in Biotechnology, Molecular Biology, Human Genomics / Biochemistry / Biophysics.</p>

<p>Age Limit: 18-50 years</p>

<p>Please see Detailed Advertisement Link for full info: https://drive.google.com/file/d/0Bz3xO6e_7OeeZllINnRyWlN5UFE/view</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27291/summer-internship-positions-at-dupont</guid>
  <pubDate>Wed, 11 May 2016 08:05:54 -0500</pubDate>
  <link></link>
  <title><![CDATA[Summer internship positions at DuPont]]></title>
  <description><![CDATA[
<p>DuPont Industrial Biosciences has several summer internship positions<br />for undergrads available. We are looking for driven and creative interns<br />to conduct research in the following areas:</p>

<p>· Enzyme immobilization supports for select enzyme systems.</p>

<p>· New tools for microbial strain and genome engineering using<br />state-of-the-art methodologies.</p>

<p>· Rapid high throughput assays to screen microorganisms from various<br />sources for enzymatic activities of interest.</p>

<p>· High throughput combinatorial approaches to the formulation of growth<br />media in support of microbial enrichments, strain isolations and growth<br />optimization.</p>

<p>· Meta-transcriptomics for the discovery of new enzymes.</p>

<p>· Strain adaptation techniques in defined chemostat environments for<br />microbial strain development.</p>

<p>The internships are based at the Experimental Station R&amp;D Center in<br />Wilmington, DE.</p>

<p>If interested, apply fast!</p>

<p>For more information and to apply, go to:</p>

<p>http://careers.dupont.com/jobsearch/job-details/industrial-biosciences-summer-internship/008549W-10/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27321/slurm-basics</guid>
	<pubDate>Fri, 13 May 2016 04:42:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27321/slurm-basics</link>
	<title><![CDATA[SLURM basics !]]></title>
	<description><![CDATA[<p><a href="http://bioinformaticsonline.com/bookmarks/view/27238/slurm" target="_blank">SLURM</a> is a queue management system and stands for Simple Linux Utility for Resource Management. SLURM was developed at the Lawrence Livermore National Lab and currently runs some of the largest compute clusters in the world.</p><p>SLURM is similar in many ways to most other queue systems. You write a batch script then submit it to the queue manager. The queue manager then schedules your job to run on the queue (or partition in SLURM parlance) that you designate. Below we will provide an outline of how to submit jobs to SLURM, how SLURM decides when to schedule your job and how to monitor progress.</p><p>SLURM has a number of valuable features compared to other job management systems:</p><ul>
<li><em>Kill and Requeue</em> SLURM&rsquo;s ability to kill and requeue is superior to that of other systems. It waits for jobs to be cleared before scheduling the high priority job. It also does kill and requeue on memory rather than just on core count.</li>
<li><em>Memory</em> Memory requests are sacrosanct in SLURM. Thus the amount of memory you request at run time is guaranteed to be there. No one can infringe on that memory space and you cannot exceed the amount of memory that you request.</li>
<li><em>Accounting Tools</em> SLURM has a back end database which stores historical information about the cluster. This information can be queried by the users who are curious about how much resources they have used.</li>
</ul><p><strong>Summary of SLURM commands</strong></p><p>The table below shows a summary of SLURM commands. These commands are described in more detail below along with links to the SLURM doc site.</p><table>
<tbody>
<tr><th>&nbsp;</th><th>SLURM</th><th>SLURM Example</th></tr>
<tr>
<td>Submit a batch serial job</td>
<td><a href="http://slurm.schedmd.com/sbatch.html">sbatch</a></td>
<td><code>sbatch runscript.sh</code></td>
</tr>
<tr>
<td>Run a script interatively</td>
<td><a href="http://slurm.schedmd.com/srun.html">srun</a></td>
<td><code>srun --pty -p interact -t 10 --mem 1000 /bin/bash /bin/hostname</code></td>
</tr>
<tr>
<td>Kill a job</td>
<td><a href="http://slurm.schedmd.com/scancel.html">scancel</a></td>
<td><code>scancel 999999</code></td>
</tr>
<tr>
<td>View status of queues</td>
<td><a href="http://slurm.schedmd.com/squeue.html">squeue</a></td>
<td><code>squeue -u akitzmiller</code></td>
</tr>
<tr>
<td>Check current job by id</td>
<td><a href="http://slurm.schedmd.com/squeue.html">sacct</a></td>
<td><code>sacct -j 999999</code></td>
</tr>
</tbody>
</table>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/27412/navin-lab</guid>
  <pubDate>Wed, 18 May 2016 16:40:14 -0500</pubDate>
  <link></link>
  <title><![CDATA[Navin Lab]]></title>
  <description><![CDATA[
<p>NAvin laboratory has pioneered the development of single cell sequencing technologies.  They apply these tools to study complex biological processes that occur in human cancers including tumor initation, clonal evolution, invasion, metastasis and chemoresistance.  These processes have previously been difficult to study with genomic technologies using bulk tissues</p>

<p>More at http://www.navinlab.com/navinlab/home.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27432/gkno</guid>
	<pubDate>Fri, 20 May 2016 18:56:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27432/gkno</link>
	<title><![CDATA[GKNO]]></title>
	<description><![CDATA[<p><span>gkno opens the world of complex bioinformatic analysis to people of all level of computational expertise. This site contains documentation, tutorials and information on all the tools that comprise gkno.</span></p>
<p><span>http://gkno.me/how-to/install.html</span></p>
<p><span>http://gkno.me/software.html</span></p><p>Address of the bookmark: <a href="http://gkno.me/" rel="nofollow">http://gkno.me/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27459/tools-for-searching-repeats-and-palindromic-sequences</guid>
	<pubDate>Sat, 21 May 2016 22:32:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27459/tools-for-searching-repeats-and-palindromic-sequences</link>
	<title><![CDATA[Tools for Searching Repeats And Palindromic Sequences]]></title>
	<description><![CDATA[<p>What are genomic interspersed repeats?</p><p>In the mid 1960's scientists discovered that many genomes contain stretches of highly repetitive DNA sequences ( see Reassociation Kinetics Experiments, and C-Value Paradox ). These sequences were later characterized and placed into five categories:</p><p><strong>Simple Repeats</strong> - Duplications of simple sets of DNA bases (typically 1-5bp) such as A, CA, CGG etc.<br /><strong>Tandem Repeats</strong> - Typically found at the centromeres and telomeres of chromosomes these are duplications of more complex 100-200 base sequences.<br /><strong>Segmental Duplications</strong> - Large blocks of 10-300 kilobases which are that have been copied to another region of the genome.<br /><strong>Interspersed Repeats</strong><br />Processed Pseudogenes, Retrotranscripts, SINES - Non-functional copies of RNA genes which have been reintegrated into the genome with the assitance of a reverse transcriptase.<br />DNA Transposons<br />Retrovirus Retrotransposons<br />Non-Retrovirus Retrotransposons ( LINES )</p><p>Currently up to 50% of the human genome is repetitive in nature and as improvements are made in detection methods this number is expected to increase.</p><p>On the other hand; In genetics, the term palindrome refers to a sequence of nucleotides along a DNA (deoxyribonucleic acid) or RNA (ribonucleic acid) strand that contains the same series of nitrogenous bases regardless from which direction the strand is analyzed. Akin to a language palindrome&mdash;wherein a word or phrase is spelled the same left-to-right as right-to-left (e.g., the word RADAR or the phrase "able was I ere I saw elba")&mdash;with genetic palindromes it does not matter whether the nucleic acid strand is read starting from the 3' (three prime) end or the 5' (five prime) end of the strand.</p><p>Recent research on palindromes centers on understanding palindrome formation during gene amplification. Other studies have attempted to relate palindrome formation to molecular mechanisms involved in double stranded breaks and in the formation of inverted repeats. Assisted by high speed computers, other groups of scientists link palindrome formation to the conservation of genetic information.</p><p>Related to the direction of transcription by RNA polymerase, DNA strands have upstream and downstream terminus defined by differing chemical groups at each end. The ends of each strand of DNA or RNA are termed the 5' (phosphate bound to the 5' position carbon) and 3' (phosphate bound to the 3' carbon) ends to indicate a polarity within the molecule. Using the letters A, T, C, G, to represent the nitrogenous bases adenine, thymine, cytosine, and guanine found in DNA, and the letters A, U, C, G to represent the nitrogenous bases adenine, uracil, cytosine, guanine found in RNA (Note that uracil in RNA replaces the thymine found in DNA), geneticists usually represent DNA by a series of base codes (e.g., 5' AATCGGATTGCA 3'). The base codes are usually arranged from the 5' end to the 3' end.</p><p>Because of specific base pairing in DNA (i.e., adenine (A) always bonds with (thymine (T) and cytosine (C) always bonds with guanine (G)) the complimentary stand to the sequence 5' AATCGGATTGCA 3' would be 3' TTAGCCTAACGT 5'.</p><p>With palindromes the sequences on the complimentary strands read the same in either direction. For example, a sequence of 5' GAATTC3' on one strand would be complimented by a 3' CTTAAG 5' strand. In either case, when either strand is read from the 5' prime end the sequence is GAATTC. Another example of a palindrome would be the sequence 5' CGAAGC 3' that, when reversed, still reads CGAAGC.</p><p>Palindromes are important sequences within nucleic acids. Often they are the site of binding for specific enzymes (e.g., restriction endobucleases) designed to cut the DNA strands at specific locations (i.e., at palindromes).</p><p>Palindromes may arise from brakeage and chromosomal inversions that form inverted repeats that compliment each other. When a palindrome results from an inversion, it is often referred to as an inverted repeat. For example, the sequence 5' CGAAGC 3', if inverted (reversed 180&deg;), still reads CGAAGC.</p><p>The <a href="http://emboss.open-bio.org/">European Molecular Biology Open Software Suite (EMBOSS)</a> includes some basic tools for finding tandem repeats and inverted repeats (see <a href="http://emboss.open-bio.org/html/use/apbs06.html#GroupsAppsTableNucleicrepeatsR6">B.6.22. Applications in group Nucleic:repeats</a>). There are many on-line services providing the EMBOSS tools, for example:</p><ul>
<li>Wageningen Bioinformatics Webportal <a href="http://emboss.bioinformatics.nl/">EMBOSS explorer</a></li>
<li><a href="http://mobyle.pasteur.fr/">Mobyle@Pasteur</a></li>
<li><a href="http://wsembnet.vital-it.ch/">Soaplab2 Web Services at Vital-IT</a></li>
</ul><p>For more sophisticated repeat finding you will want to look at tools using <a href="http://www.girinst.org/repbase/">Repbase</a> for example:</p><ul>
<li>CENSOR
<ul>
<li><a href="http://www.girinst.org/censor/">CENSOR@GIRI</a></li>
<li><a href="http://www.ebi.ac.uk/Tools/so/censor/">CENSOR@EMBL-EBI</a></li>
</ul>
</li>
<li><a href="http://www.repeatmasker.org/">RepeatMasker</a></li>
<li><a href="http://mummer.sourceforge.net/">MUMmer</a>&nbsp;(scan_for_match)</li>
<li><a href="http://emboss.bioinformatics.nl/cgi-bin/emboss/palindrome">Emboss Palindrome</a></li>
</ul><p>Other nucleotide repeat finding methods found by a couple of web searches:</p><ul>
<li><a href="http://tandem.bu.edu/trf/trf.html">Tandem Repeats Finder</a></li>
<li><a href="http://selab.janelia.org/recon.html">RECON</a></li>
<li><a href="http://www.yandell-lab.org/software/repeatrunner.html">RepeatRunner</a></li>
<li><a href="http://bibiserv.techfak.uni-bielefeld.de/reputer/">REPuter</a></li>
<li><a href="http://210.212.215.200/IMEX/index.html">Imperfect Microsatellite Extractor (IMEx)</a></li>
<li><a href="http://www.imtech.res.in/raghava/srf/">Spectral Repeat Finder (SRF)</a></li>
<li><a href="http://zlab.bu.edu/repfind/form.html">REPFIND</a></li>
<li><a href="http://crispr.u-psud.fr/Server/CRISPRfinder.php">CRISPRfinder</a></li>
<li><a href="http://grail.lsd.ornl.gov/grailexp/">GrailEXP</a></li>
<li><a href="http://alggen.lsi.upc.edu/recerca/search/frame-search.html">CONREPP</a></li>
<li><a href="http://www.biophp.org/minitools/find_palindromes/demo.php%20"><span>find_palindromes</span></a></li>
<li><a href="http://insilico.ehu.eus/palindromes/"><span>Palindrome</span></a></li>
<li><a href="http://emboss.bioinformatics.nl/cgi-bin/emboss/palindrome">EMBOSS Palindrome</a></li>
<li><a href="http://bioinfo.cs.technion.ac.il/projects/Engel-Freund/new.html">Palindrome Search</a></li>
</ul>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27473/project-assistantjunior-research-fellow-position-at-centre-of-biomedical-research-sanjay-gandhi-postgraduate-institute-of-medical-sciences-campus-lucknow</guid>
  <pubDate>Mon, 23 May 2016 01:31:29 -0500</pubDate>
  <link></link>
  <title><![CDATA[Project Assistant/Junior Research Fellow Position at  Centre of Biomedical Research, Sanjay Gandhi Postgraduate Institute of Medical Sciences Campus, Lucknow.]]></title>
  <description><![CDATA[
<p>Applications are invited from eligible candidates willing to join in a Department of Science and Technology (DST) project entitled “"Mapping neural regions involved in reading process in skilled adult Deaf reader: From neuroimaging perspective (functional Magnetic Resonance Imaging (fMRI) and Diffuse Tensor Imaging (DTI.)" as a Project Assistant/Junior Research Fellow (JRF) at Centre of Biomedical Research, Sanjay Gandhi Postgraduate Institute of Medical Sciences Campus, Lucknow.</p>

<p>Essential Qualification:</p>

<p>1. Master's degree in Bioinformatics / Computer Applications / Cognitive Science /Neuroscience/ Neuropsychology or equivalent. (Advantage will be given to NET JRF qualified candidate) Additional</p>

<p>Desirable Skills:</p>

<p>1) Programming skills (e.g., C++, Matlab, Python) 2) Experience/competent in working Window and Linux based programme.</p>

<p>Please mail your CV and covering letter to dr.uttam.kumar@gmail.com.</p>

<p>To know more about lab works please visit http://uttambrainlab.co.in/lab/.</p>

<p>Last date: 15/06/16</p>

<p>Advertisement: http://cbmr.res.in/wp-content/uploads/2016/05/Advertisement-19-5-2016.pdf</p>
]]></description>
</item>

</channel>
</rss>