<?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/30236?offset=380</link>
	<atom:link href="https://bioinformaticsonline.com/related/30236?offset=380" 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/27477/cytoscape</guid>
	<pubDate>Mon, 23 May 2016 02:32:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27477/cytoscape</link>
	<title><![CDATA[Cytoscape]]></title>
	<description><![CDATA[<p>Cytoscape is an <a href="http://www.cytoscape.org/download.php">open source</a> software platform for visualizing complex networks and integrating these with any type of attribute data. A lot of <a href="http://apps.cytoscape.org/"><em>Apps</em></a> are available for various kinds of problem domains, including bioinformatics, social network analysis, and semantic web.</p><p>Address of the bookmark: <a href="http://www.cytoscape.org/" rel="nofollow">http://www.cytoscape.org/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27549/ra-at-university-of-hyderabad</guid>
  <pubDate>Sun, 29 May 2016 11:50:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA at UNIVERSITY OF HYDERABAD]]></title>
  <description><![CDATA[
<p>UNIVERSITY OF HYDERABAD</p>

<p>School of Life Sciences</p>

<p>Department of Animal Biology</p>

<p>Applications are invited on a plane paper (along with copies of educational qualifications and experience) from eligible candidates for the selection of following position to work under a collaborative research project entitled “Development and application of high resolution genome conformation capture technology to investigate genome architecture in space and time” between University of Hyderabad and CR Rao advanced Institute of Mathematics, Statistics and Computer Sciences, sponsored by Department of Biotechnology, Government of India, New Delhi</p>

<p>Name and No. of positions JRF‐ONE</p>

<p>Emoluments for the position Rs. 25,000/p.m. + Eligible HRA</p>

<p>Qualifications MSc or M.Tech in any branch of biology/bioinformatics/computational biology/computer sciences/Mathematics/Physics</p>

<p>Duration Appointments are made initially for ONE year and can be extended further TWO years or until the duration of project</p>

<p>Our laboratory is interested in understanding signalling and spatiotemporal dynamics of 3‐Dimensional genome architecture and gene expression during embryonic stem cell differentiation by utilizing a combination of cellular, molecular genetics, Biochemical and computational tools in combination with next generation sequencing based chromatin structure analysing methods. Successful candidates shall pursue project related to either experimental or computational analysis of genome and Epigenomics data derived from human and mouse cells. Experience in Computational biology, bioinformatics, statistics, machine learning and algorithmic development is required. Knowledge of programming languages (e.g. C, C++, Perl, Python, Ruby etc.) and statistical framework (e.g. R, matlab, etc.) is preferable. Basic understanding of molecular biology will be an added advantage.</p>

<p>Interested candidates with the above mentioned qualification can send their curriculum vitae to   Dr. K. Sreenivasulu, Department of Animal Biology, School of Life Sciences, South campus, University of Hyderabad or via email at positionssklab@gmail.com or svksl@uohyd.ernet.in.</p>

<p>Candidates with CSIR/UGC/ICMR/DBT/BINC qualifications if interested in above mentioned area of research are welcomed to approch principal investigator for a position leading to PhD. Last date for submission of applications is 17/06/2016. Eligible candidates will be called for an interview and they should carry all original certificates of the qualifying exam. No TA/ DA will be paid for attending the interview or at the time of joining the post.</p>

<p>Advertisement: http://www.uohyd.ac.in/images/recruitment/jrf_260516.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27691/histonedb-20-%E2%80%93-with-variants</guid>
	<pubDate>Fri, 03 Jun 2016 05:06:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27691/histonedb-20-%E2%80%93-with-variants</link>
	<title><![CDATA[HistoneDB 2.0 – with variants]]></title>
	<description><![CDATA[<p><span>This histone database can be used to explore the diversity of histone proteins and their sequence variants in many organisms. The resource was established to better understand how sequence variation may affect functional and structural features of nucleosomes. To get started, select a histone type to explore its variants.</span></p>
<p><span>More at&nbsp;http://www.ncbi.nlm.nih.gov/projects/HistoneDB2.0/index.fcgi/browse/</span></p><p>Address of the bookmark: <a href="http://www.ncbi.nlm.nih.gov/projects/HistoneDB2.0/index.fcgi/browse/" rel="nofollow">http://www.ncbi.nlm.nih.gov/projects/HistoneDB2.0/index.fcgi/browse/</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/27713/mutabind</guid>
	<pubDate>Mon, 06 Jun 2016 13:34:09 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/27713/mutabind</link>
	<title><![CDATA[MutaBind]]></title>
	<description><![CDATA[<p><span>MutaBind is a new computational method and server created through NCBI research efforts that maps mutations on a protein structural complex, calculates changes in binding affinity, identifies deleterious mutations and produces a downloadable mutant structural model.&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/" target="_blank">http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/</a></p><p><img src="http://www.ncbi.nlm.nih.gov/projects/mutabind/prj-sunddg/static/myimgs/CirclesDiamondBlueThiner.png" width="471" height="258" alt="image" style="border: 0px;"></p><p><span>MutaBind guides you through this process, step by step, starting with selecting a protein complex and inputting PDB code or uploading PDB files. You can also retrieve results with a job ID number, view help documents, and review the MutaBind method and references.</span></p><p><span>More at&nbsp;http://www.ncbi.nlm.nih.gov/projects/mutabind/index.fcgi/</span></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</guid>
	<pubDate>Wed, 15 Jun 2016 18:08:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</link>
	<title><![CDATA[CovCal: Coverage / Read Count Calculator]]></title>
	<description><![CDATA[<h2>Coverage / Read Count Calculator</h2>
<h4>Calculate how much sequencing you need to hit a target depth of coverage (or vice versa).</h4>
<p><span>Instructions:</span> set the read length/configuration and genome size, then select what you want to calculate.</p>
<p>Written by <a href="http://stephenturner.us/" target="blank">Stephen Turner</a>, based on the <a href="http://www.ncbi.nlm.nih.gov/pubmed/3294162" target="_blank">Lander-Waterman formula</a>, inspired by <a href="http://core-genomics.blogspot.com/2016/05/how-many-reads-to-sequence-genome.html" target="_blank">a similar calculator</a> written by James Hadfield. Coverage is calculated as <em>C=LN/G</em> and reads as <em>N=CG/L</em> where <em>C</em> = Coverage (X),<em>L</em> = Read length (bp), <em>G</em> = Haploid genome size (bp), and <em>N</em> = Number of reads. Source code <a href="https://github.com/stephenturner/covcalc" target="_blank">on GitHub</a>.</p><p>Address of the bookmark: <a href="http://apps.bioconnector.virginia.edu/covcalc/" rel="nofollow">http://apps.bioconnector.virginia.edu/covcalc/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28879/projects-opening-at-nbagr</guid>
  <pubDate>Wed, 24 Aug 2016 04:13:13 -0500</pubDate>
  <link></link>
  <title><![CDATA[Projects opening at NBAGR]]></title>
  <description><![CDATA[
<p>ICAR - NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES</p>

<p>Karnal -132001 (Haryana)</p>

<p>A walk-in-Interview is proposed to be held at National Bureau of Animal Genetic Resources, Karnal (Haryana)-132001 at 10:30 AM on 05.09.2016 for the selection of Three Research Associate &amp; One Young Professional - II as per details given below:</p>

<p>Name of the Scheme / Project: Center for Agricultural Bioinformatics. The post duration is Upto 31.032017 or earlier &amp; Co-terminus with the project.</p>

<p>Research Associate (Three posts)</p>

<p>Date &amp; Time of Interview: 10.30 A.M. on 05.09.2016</p>

<p>Essential Qualifications: PhD degree in any one of discipline/Subject Biotechnology/ Animal Genetics and Breeding/ Biochemistry/ Bioinformatics/Molecular Genetics OR Master’s degree in any one of above mentioned discipline/Subject with 4 years/5 years of Bachelor’s degree having 1st division or 60% marks or equivalent overall grade point average, with at least two years of research experience as evidenced from Fellowship/Associateship</p>

<p>Desirable Qualifications: Experience in Database/Next Generation Sequencing Data analysis for 02 RA posts or working experience in molecular biology, gene expression data analysis, SNP genotyping and sequence data analysis, functional gene characterization for 01 RA post.</p>

<p>Young Professionals II One position</p>

<p>Date &amp; Time of Interview: 10.30 A.M. on 05.09.2016</p>

<p>Essential: B. Tech or M.Tech. in Bioinformatics / Computer Science / Computer Application.</p>

<p>Desirable: Experience in Linux, MySQL, Java, C++/ PHP/ PERL R based data analysis and application development in Bioinformatics.</p>

<p>More Info : http://14.139.252.116/ADvertisementforCabinScheme.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/27927/research-assistant-bioinformatics-at-andhra-university</guid>
  <pubDate>Sat, 18 Jun 2016 18:39:09 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Assistant Bioinformatics at Andhra University]]></title>
  <description><![CDATA[
<p>Advt. No. AUMLR/BIF/ RA /6-2016 <br />Research Assistant Job Position in Andhra University on temporary basis <br />No. of Post : 01<br />Eligibility : Applicants who have completed their Post Graduate degree in Bioinformatics.<br />Desirable : Undergone traineeship in BIF; at least one publication in Bioinformatics. <br />Stipend : A monthly stipend of Rs. 22,000/- + HRA (HRA is applicable only for NET qualified candidates)<br />How to apply<br />Applications on plain paper, stating the name, address, date of birth, educational qualifications and experiences, and Institute, along with attested photocopies of mark sheets and certificates, should be submitted to K. UMADEVI, Coordinator, BIF Programme, Department of Marine Living Resources, Andhra University, Visakhapatnam-530 003, Andhra Pradesh, on or before 15th July, 2016. </p>

<p>Candidates are required to appear for an interview, with all the necessary certificates in original along with a set of attested copies in the office of the Principal, AU College of Science &amp; Technology, Andhra University, Visakhapatnam. Applications may be sent by Email to andhrauniv.btisnet@nic.in / katruumadevi@gmail.com.</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28272/bioinformatics-openings-at-icgeb-new-delhi-india</guid>
  <pubDate>Mon, 04 Jul 2016 01:04:05 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics openings at ICGEB NEW DELHI, INDIA]]></title>
  <description><![CDATA[
<p>Applications are invited for:</p>

<p>ICGEB NEW DELHI, INDIA</p>

<p>Biotechnology research positions</p>

<p>Projects include:</p>

<p>a) protein structure determination<br />b) malaria parasite biology<br />c) genomics and metagenomics<br />d) molecular and cellular biology<br />e) bioinformatics and computational biology</p>

<p>Minimum eligibility for students who have already obtained a MSc:</p>

<p>1) INSPIRE award for PhD<br />2) SPM award for PhD<br />3) CSIR/DBT/DST JRF for PhD</p>

<p>Applicants should submit their curriculum vitae by email to: sb.icgeb@gmail.com by 30 August 2016</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/28449/aravind-j-shankar-gets-all-india-rank-1-in-binc-2016</guid>
	<pubDate>Tue, 19 Jul 2016 05:19:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/28449/aravind-j-shankar-gets-all-india-rank-1-in-binc-2016</link>
	<title><![CDATA[Aravind J Shankar gets all India rank 1 in BINC, 2016]]></title>
	<description><![CDATA[<p>Aravind J Shankar, a bioinformatics graduate of SASTRA University, has secured the all India rank 1 in the Bioinformatics National Certification (BINC) 2016, organised by the Department of Biotechnology, Government of India.</p><p>The BINC is a nationwide examination aimed at certifying professionals in bioinformatics and tests their theoretical and practical knowledge across three phases of examination. He is entitled to receive a DBT research fellowship leading to a Ph.D. from any premier research institute in India.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>