<?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/7986?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/7986?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/bookmarks/view/30336/finding-patterns-in-biological-sequences</guid>
	<pubDate>Thu, 22 Dec 2016 10:30:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30336/finding-patterns-in-biological-sequences</link>
	<title><![CDATA[Finding Patterns in Biological Sequences]]></title>
	<description><![CDATA[<p>In this report we provide an overview of known techniques for discovery of patterns of biological sequences (DNA and proteins). We also provide biological motivation, and methods of biological verification of such patterns. Finally we list publicly available tools and databases for pattern discovery. On-line supplement is available through http://genetics.uwaterloo.ca/&sim;tvinar/cs798g/motif.</p><p>Address of the bookmark: <a href="http://engr.case.edu/li_jing/papers/00798gpattern.pdf" rel="nofollow">http://engr.case.edu/li_jing/papers/00798gpattern.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30966/maftools</guid>
	<pubDate>Thu, 16 Feb 2017 11:16:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30966/maftools</link>
	<title><![CDATA[MafTools]]></title>
	<description><![CDATA[<p>maftools - An R package to summarize, analyze and visualize MAF files. <a href="https://github.com/PoisonAlien/maftools#introduction"></a>Introduction.</p>
<p>With advances in Cancer Genomics, Mutation Annotation Format (MAF) is being widley accepted and used to store variants detected. <a href="http://cancergenome.nih.gov">The Cancer Genome Atlas</a> Project has seqenced over 30 different cancers with sample size of each cancer type being over 200. The <a href="https://wiki.nci.nih.gov/display/TCGA/TCGA+MAF+Files">resulting data</a> consisting of genetic variants is stored in the form of <a href="https://wiki.nci.nih.gov/display/TCGA/Mutation+Annotation+Format+%28MAF%29+Specification">Mutation Annotation Format</a>. This package attempts to summarize, analyze, annotate and visualize MAF files in an efficient manner either from TCGA sources or any in-house studies as long as the data is in MAF format. Maftools can also handle ICGC Simple Somatic Mutation format.</p>
<p>maftools is on <img src="https://assets-cdn.github.com/images/icons/emoji/unicode/1f449.png" alt=":point_right:" width="20" height="20" style="border: 0px;"> <a href="http://biorxiv.org/content/early/2016/05/11/052662">bioRxiv</a> <img src="https://assets-cdn.github.com/images/icons/emoji/bowtie.png" alt=":bowtie:" title=":bowtie:" width="20" height="20" style="border: 0px; text-align: absmiddle;"></p>
<p>Please cite the below if you find this tool useful for you.</p>
<p>Mayakonda, A. and H.P. Koeffler, Maftools: Efficient analysis, visualization and summarization of MAF files from large-scale cohort based cancer studies. bioRxiv, 2016. doi: <a href="http://dx.doi.org/10.1101/052662">http://dx.doi.org/10.1101/052662</a></p><p>Address of the bookmark: <a href="https://github.com/PoisonAlien/maftools" rel="nofollow">https://github.com/PoisonAlien/maftools</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/31566/software-and-tools-to-detect-structure-variation-with-long-reads</guid>
	<pubDate>Wed, 15 Mar 2017 14:31:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/31566/software-and-tools-to-detect-structure-variation-with-long-reads</link>
	<title><![CDATA[Software and Tools to detect structure variation with long reads !!]]></title>
	<description><![CDATA[<p>Uncovering the connection between genetics and heritable diseases requires an approach that looks at all the variant bases and types in a genome. While a PacBio&nbsp;<em>de novo</em>&nbsp;assembly resolves the most novel SV variants. 8-10X PacBio coverage of single genomes or trios reveals triple the SVs detectable by short-read data.</p><p>With&nbsp;<span style="text-decoration: underline;"><a href="http://www.pacb.com/smrt-science/">Single Molecule, Real-Time (SMRT) Sequencing</a></span>, you can access structural variations having a broad range of sizes, types, and GC content with the ability to:</p><ul>
<li>Uncover missing heritability linked to structural variation</li>
<li>Unambiguously identify genomic context and variant breakpoints at the sequence level to unravel the genetic etiology of disease</li>
<li>Resolve structural variation across the complete size spectrum with basepair resolution</li>
</ul><p>Following are the SV tools, which can assist you to achieve your goal.</p><p><strong>Sniffles:</strong>&nbsp;Structural variation caller using third generation sequencing</p><p>Sniffles is a structural variation caller using third generation sequencing (PacBio or Oxford Nanopore). It detects all types of SVs using evidence from split-read alignments, high-mismatch regions, and coverage analysis. Please note the current version of Sniffles requires sorted output from BWA-MEM (use -M and -x parameter) or NGM-LR with the optional SAM attributes enabled!&nbsp;</p><p>More at&nbsp;https://github.com/fritzsedlazeck/Sniffles</p><p><strong style="font-size: 12.8px;"><br />MultiBreak-SV:</strong> It identifies structural variants from next-generation paired end data, third-generation long read data, or data from a combination of sequencing platforms.</p><p>There are two pieces of software in this release: (1) a pre-processor that takes machineformat (.m5) BLASR files, and (2) MultiBreak-SV. For installation and usage instructions, see doc/MultiBreakSV-Manual.txt.</p><p>More at&nbsp;https://github.com/raphael-group/multibreak-sv</p><p><strong style="font-size: 12.8px;"><br />Parliament:</strong>&nbsp;A Structural Variation Tool. Why ask a single sv-detection approach to find every variant when you can have a parliament of tools deciding?</p><p>Publication about the algorithm and &ldquo;&hellip;the first long-read characterization of structural variation in a diploid human personal genome&hellip;&rdquo; (HS1011) -&nbsp;<a href="http://www.biomedcentral.com/1471-2164/16/286">&ldquo;Assessing structural variation in a personal genome&mdash;towards a human reference diploid genome&rdquo;</a></p><p>More at&nbsp;https://sourceforge.net/projects/parliamentsv/</p><p>https://www.dnanexus.com/papers/Parliament_Info_Sheet.pdf</p><p><br /><strong>PBHoney:</strong>&nbsp;the structural variation discovery tool&nbsp;<br /><br />PBHoney is an implementation of two variant-identification approaches designed to exploit the high mappability of long reads (i.e., greater than 10,000 bp). PBHoney considers both intra-read discordance and soft-clipped tails of long reads to identify structural variants.</p><p>Read The Paper&nbsp;<a href="http://www.biomedcentral.com/1471-2105/15/180/abstract" target="_blank">http://www.biomedcentral.com/1471-2105/15/180/abstract</a></p><p>More at&nbsp;https://sourceforge.net/projects/pb-jelly/</p><p><strong><br />SMRT-SV:</strong> Structural variant and indel caller for PacBio reads</p><p>Structural variant (SV) and indel caller for PacBio reads based on methods from&nbsp;<a href="http://www.nature.com/nature/journal/vaop/ncurrent/full/nature13907.html">Chaisson et al. 2014</a>.</p><p>SMRT-SV provides an official software package for tools described in&nbsp;<a href="http://www.nature.com/nature/journal/vaop/ncurrent/full/nature13907.html">Chaisson et al. 2014</a>&nbsp;and adds several key features including the following.</p><ul>
<li>Unified variant calling user interface with built-in cluster compute support</li>
<li>Small indel calling (2-49 bp)</li>
<li>Improved inversion calling (<code>screenInversions</code>)</li>
<li>Quality metric for SV calls based on number of local assemblies supporting each call</li>
<li>Higher sensitivity for SV calls using tiled local assemblies across the entire genome instead of "signature" regions</li>
<li>Genotyping of SVs with Illumina paired-end reads from WGS samples</li>
</ul><p>More at&nbsp;https://github.com/EichlerLab/pacbio_variant_caller</p>]]></description>
	<dc:creator>Archana Malhotra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/926/list-of-popular-bioinformatics-softwaretools</guid>
	<pubDate>Tue, 16 Jul 2013 14:30:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/926/list-of-popular-bioinformatics-softwaretools</link>
	<title><![CDATA[List of popular bioinformatics software/tools]]></title>
	<description><![CDATA[<p><a href="http://samtools.sourceforge.net/swlist.shtml">I</a>n current genome era, our day to day work is to handle the huge geneome sequences, expression data, several other datasets. This link provide a comprehensive list of commonly used sofware/tools.</p><p>Address of the bookmark: <a href="http://samtools.sourceforge.net/swlist.shtml" rel="nofollow">http://samtools.sourceforge.net/swlist.shtml</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/34916/bioinformatics-tools-developed-for-oxford-nanopore-data-analysis</guid>
	<pubDate>Wed, 27 Dec 2017 20:47:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/34916/bioinformatics-tools-developed-for-oxford-nanopore-data-analysis</link>
	<title><![CDATA[Bioinformatics tools developed for Oxford Nanopore data analysis !]]></title>
	<description><![CDATA[<p><span>MinION is the only portable real-time device for DNA and RNA&nbsp;</span><span>sequencing</span><span>. Each consumable flow cell can now generate 10&ndash;20 Gb of DNA&nbsp;</span><span>sequence</span><span>&nbsp;data. Ultra-</span><span>long read lengths are possible (hundreds of kb) as you can choose your fragment length.&nbsp;</span>One of the technical advantages of ONT data is the read length, which offers great prospects for genome assembly. Generally, assemblers are based on several different types of algorithms, such as greedy, overlap-layout-consensus (OLC), de Bruijn graph (DBG), and string graph.</p><p><span>List of analysis tools developed for Oxford Nanopore data</span></p><p>BWA <br />Fast nanopore data tuned alignment tool <br />https://github.com/lh3/bwa</p><p>GraphMap<br />Mapper for long and error-prone reads<br />https://github.com/isovic/graphmap</p><p>LAST<br />Nanopore tuned alignment tool<br />http://last.cbrc.jp/</p><p>LINKS<br />Software tool for long read scaffolding <br />https://github.com/warrenlr/LINKS/</p><p>marginAlign<br />Tools to align nanopore reads to a reference<br />https://github.com/benedictpaten/marginAlign</p><p>minoTour<br />Real time analysis tools<br />http://minotour.nottingham.ac.uk/</p><p>nanoCORR<br />Error-correction tool for nanopore sequence data<br />https://github.com/jgurtowski/nanocorr</p><p>NanoOK<br />Software for nanopore data, quality and error profiles<br />https://documentation.tgac.ac.uk/display/NANOOK/NanoOK</p><p>Nanopolish<br />Nanopore analysis and genome assembly software<br />https://github.com/jts/nanopolish</p><p>nanopore<br />Variant-detection tool for nanopore sequence data<br />https://github.com/mitenjain/nanopore</p><p>Nanocorrect<br />Error-correction tool for nanopore sequence data<br />https://github.com/jts/nanocorrect/</p><p>npReader<br />Real-time conversion and analysis of nanopore reads<br />https://github.com/mdcao/npReader</p><p>poRe<br />Tool for analyzing and visualizing nanopore data<br />https://sourceforge.net/p/rpore/wiki/Home/</p><p>PoreSeq<br />Error-correction and variant-calling software<br />https://github.com/tszalay/poreseq</p><p>Poretools<br />Nanopore sequence analysis and visualization software <br />https://github.com/arq5x/poretools</p><p>SSPACE-LongRead<br />Genome scaffolding tool <br />http://www.baseclear.com/genomics/bioinformatics/basetools/SSPACE-longread</p><p>SMIS<br />Genome scaffolding tool <br />https://sourceforge.net/projects/phusion2/files/smis/</p><p>&nbsp;</p><p>List of assemblers for Oxford Nanopore MinION long reads</p><p>LQS<br />DALIGNER, Celera OLC Nanocorrect, <br />Nanopolish corrector<br />https://github.com/jts/nanopolish</p><p>PBcR<br />HGAP or BLASR, Celera OLC <br />PBcR corrector<br />http://wgs-assembler.sourceforge.net/wiki/index.php/PBcR<br /> &ndash;<br />Canu<br />MHAP, Celera OLC <br />Canu corrector<br />https://github.com/marbl/canu</p><p>Falcon<br />String graph, Celera OLC <br />Falcon corrector<br />https://github.com/PacificBiosciences/falcon</p><p>Miniasm <br />OLC<br />https://github.com/lh3/miniasm</p><p>ra-integrate<br />OLC<br />https://github.com/mariokostelac/ra-integrate/</p><p>ALLPATHS-LG<br />de Bruijn graph <br />ALLPATHS-L corrector<br />https://www.broadinstitute.org/software/allpaths-lg/blog/?page_id=12</p><p>SPAdes <br />de Bruijn graph <br />SPAdes corrector<br />http://bioinf.spbau.ru/spades</p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36384/binding-site-prediction-in-protein</guid>
	<pubDate>Wed, 25 Apr 2018 04:35:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36384/binding-site-prediction-in-protein</link>
	<title><![CDATA[Binding Site Prediction in Protein !]]></title>
	<description><![CDATA[<p><span>The interaction between proteins and other molecules is fundamental to all biological functions. In this section we include tools that can assist in prediction of interaction sites on protein surface and tools for predicting the structure of the intermolecular complex formed between two or more molecules (docking).</span></p><h4>Pockets Identification</h4><p><a href="http://sts.bioengr.uic.edu/castp/" target="_blank">CASTp</a></p><div style="text-align: justify;">Automatic Identification of pockets and cavities in proteins structure, and quantitation of their volumes using Delaunay triangulation. Available also as PyMOL plugin</div><p><a href="http://www.bioinformatics.leeds.ac.uk/pocketfinder/" target="_blank">Pocket-Finder</a></p><div style="text-align: justify;">Automatic identification of pockets and cavities in proteins structure, and quantitation of their volumes.</div><p><a href="http://gecco.org.chemie.uni-frankfurt.de/pocketpicker/index.html" target="_blank">PocketPicker</a></p><div style="text-align: justify;">Grid-based technique for the analysis of protein pockets. PocketPicker available as a plugin for&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/pymol.htm">PyMOL</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><h4>Binding Site Prediction</h4>
<p><a href="http://consurf.tau.ac.il/" target="_blank">ConSurf</a></p>
</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Identification of functional regions in proteins by surface-mapping of phylogenetic information</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://www-cryst.bioc.cam.ac.uk/~crescendo/crescendo.php" target="_blank">CRESCENDO</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Identification protein interaction sites. It uses sequence conservation patterns in homologous proteins to distinguish between residues that are conserved due to structural restraints from those due to functional restraints.&nbsp;&nbsp;</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><strong>Ligand Binding Sites</strong></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://www.sbg.bio.ic.ac.uk/~3dligandsite/" target="_blank">3DLigandSite</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">The server utilizes protein-structure prediction to provide structural models of the binding site. Ligands bound to structures are superimposed onto the model and use to predict the binding site.</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">F<a href="http://cssb.biology.gatech.edu/skolnick/files/FINDSITE/" target="_blank">INDSITE</a></div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">A threading-based method for ligand-binding site prediction and functional annotation based on binding-site similarity across superimposed groups of threading templates.</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">
<p><a href="http://scoppi.biotec.tu-dresden.de/pocket/" target="_blank">LIGSITE<sup>csc</sup></a></p>
<div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;">Prediction of binding site by pocket identification using the Connolly surface and degree of conservation</div>
<p><a href="http://metapocket.eml.org/" target="_blank"></a></p>
</div><div style="text-align: justify;">&nbsp;</div><div style="text-align: justify;"><a href="http://metapocket.eml.org/" target="_blank">metaPocket</a>A meta server for ligand-binding site prediction. metaPocket use&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#ligsite">LIGSITE<sup>csc</sup></a>,&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#pass">PASS</a>,&nbsp;<a href="https://bip.weizmann.ac.il/toolbox/structure/binding.htm#qsite">Q-SiteFinder</a>&nbsp;and&nbsp;<a href="http://www.biochem.ucl.ac.uk/~roman/surfnet/surfnet.html" target="_blank">SURFNET</a></div>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/41905/research-associate-bioinformatics-in-iisc-recruitment-2020</guid>
  <pubDate>Tue, 23 Jun 2020 21:53:34 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Associate Bioinformatics in IISc Recruitment 2020]]></title>
  <description><![CDATA[
<p>Research Associate Bioinformatics in IISc Recruitment 2020</p>

<p>Essential Qualifications: Ph.D. (Bioinformatics/ Biophysics/ Biotechnology or any other stream of biological/ physical sciences) with a minimum of two publications in reputed peer reviewed journals in the area of structural bioinformatics or biophysics or biomolecular modeling/ simulation.</p>

<p>Job description: Development of bioinformatics tools and algorithms/software for structure based analysis of biomolecular systems. Programmatic access to major biomolecular databases using APIs Knowledge based prediction and analysis of biomolecular structure, function and interactions. Docking/simulations for inhibitor design.</p>

<p>Desirable Qualifications (Research Associate/s): i)  Strong computer programming skills (in Python/PERL/PHP or C++ or object oriented database management systems like MySQL etc or scripting languages under LINUX/UNIX environment). </p>

<p>ii) Extensive experience in computational analysis of biomolecular structure/interactions and usage of advanced biomolecular simulation softwares. iii) Adequate knowledge of major databases, webservers and softwares in the area of biomolecular structure/function and drug design. iv)  Familiarity with Parallel Programming environments and experience in usage of high-end HPC clusters.</p>

<p>The candidates must highlight their experience in above mentioned fields/topics in their CV. Initial appointment will be for a period of 1 year, subject to extension after review of performance.</p>

<p>Emoluments: As per DST, GOI norms and commensurate with experience.</p>

<p>More at https://www.iisc.ac.in/positions-open/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4162/4273%CF%80-bioinformatics-education-on-low-cost-arm-hardware</guid>
	<pubDate>Mon, 02 Sep 2013 07:02:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4162/4273%CF%80-bioinformatics-education-on-low-cost-arm-hardware</link>
	<title><![CDATA[4273π: Bioinformatics education on low cost ARM hardware]]></title>
	<description><![CDATA[<p>Are you teaching bioinformatics at universities and found it complicated by typical computer classroom settings. As well as running software locally and online, students should gain experience of systems administration. Hmm don't worry there is one new OS for the rescue. 4273<em>&pi;</em>, an operating system image for Raspberry Pi based on Raspbian Linux. It provides an attractive, general-purpose computing environment, within which the course 4273&pi; Bioinformatics for Biologists is embedded.<br /><br />Though far slower than current desktop and laptop computers, the Raspberry Pi is notably faster than the Cray 1 supercomputer, a marvel of computer speed in its day. The Raspberry Pi approach includes all the benefits of the laptop approach, above, but at lower cost. In addition, the Raspberry Pi is a new and exciting computer system, which in itself can add interest to the course.<br /><br />As the Raspbian operating system, Raspberry Pi firmware and hardware and 4273&pi; Bioinformatics for Biologists teaching material develop, further releases of 4273&pi; will be made available. It is anticipated that there will be a minimum of two releases per year during the next four years.</p><p>4273<em>&pi;</em> is a means to teach bioinformatics, including systems administration tasks, to undergraduates at low cost.</p><p>Descriptive paper @ http://www.biomedcentral.com/1471-2105/14/243</p><p>Image source: BMC Bioinformatics</p><p><img src="http://www.biomedcentral.com/content/download/figures/1471-2105-14-243-1.png" alt="image" style="border: 0px; border: 0px;"></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44002/interesting-bioinformatics-resources</guid>
	<pubDate>Fri, 11 Nov 2022 06:30:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44002/interesting-bioinformatics-resources</link>
	<title><![CDATA[Interesting Bioinformatics Resources !]]></title>
	<description><![CDATA[<p>1. a reproducible workflow.&nbsp;<a href="https://www.youtube.com/watch?v=s3JldKoA0zw">https://www.youtube.com/watch?v=s3JldKoA0zw</a>&nbsp;This two minute video will change your mind on reproducible research&nbsp;</p><p>2. Parallel sequencing lives, or what makes large sequencing projects successful&nbsp;<a href="https://academic.oup.com/gigascience/article/6/11/gix100/4557140?login=false">https://academic.oup.com/gigascience/article/6/11/gix100/4557140?login=false</a></p><p>3. Common-sense approaches to sharing tabular data alongside publication&nbsp;<a href="https://www.sciencedirect.com/science/article/pii/S2666389921002300">https://www.sciencedirect.com/science/article/pii/S2666389921002300</a></p><p>4. A Reproducible Data Analysis Workflow with R Markdown, Git, Make, and Docker&nbsp;<a href="https://psyarxiv.com/8xzqy/">https://psyarxiv.com/8xzqy/</a></p><p>5. Practical Computational Reproducibility in the Life Sciences&nbsp;<a href="https://www.cell.com/cell-systems/fulltext/S2405-4712(18)30140-6">https://www.cell.com/cell-systems/fulltext/S2405-4712(18)30140-6</a></p><p>6. A video by Dr.Keith A. Baggerly from MD Anderson [The Importance of Reproducible Research in High-Throughput Biology](<a href="https://www.youtube.com/watch?v=7gYIs7uYbMo">https://www.youtube.com/watch?v=7gYIs7uYbMo</a>) highly recommended.</p><p>7. Ten Simple Rules for Reproducible Computational Research&nbsp;<a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1003285">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1003285</a>)</p><p>8. Good Enough Practices in Scientific Computing&nbsp;<a href="http://arxiv.org/abs/1609.00037">http://arxiv.org/abs/1609.00037</a>&nbsp;</p><p>9. Best Practices for Scientific Computing&nbsp;<a href="https://journals.plos.org/plosbiology/article?id=10.1371/journal.pbio.1001745">https://journals.plos.org/plosbiology/article?id=10.1371/journal.pbio.1001745</a></p><p>10. A Quick Guide to Organizing Computational Biology Projects&nbsp;<a href="http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.100042">http://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.100042</a>&nbsp; A must read for computational biologists!</p><p>11. Reproducibility of computational workflows is automated using continuous analysis&nbsp;<a href="https://www.nature.com/articles/nbt.3780">https://www.nature.com/articles/nbt.3780</a></p><p>12. Five selfish reasons to work reproducibly&nbsp;<a href="https://genomebiology.biomedcentral.com/articles/10.1186/s13059-015-0850-7">https://genomebiology.biomedcentral.com/articles/10.1186/s13059-015-0850-7</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

</channel>
</rss>