<?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/26975?offset=910</link>
	<atom:link href="https://bioinformaticsonline.com/related/26975?offset=910" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/19820/rstudio</guid>
	<pubDate>Sat, 27 Dec 2014 06:50:58 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/19820/rstudio</link>
	<title><![CDATA[RStudio]]></title>
	<description><![CDATA[<p>RStudio IDE is a powerful and productive user interface for R. It&rsquo;s free and open source, and works great on Windows, Mac, and Linux.</p>
<p>The developers and expert trainers are the authors of several popular R packages, including ggplot2, plyr, lubridate, and others.</p>
<p>More at http://www.rstudio.com/</p>
<p>http://www.rstudio.com/products/RStudio/</p><p>Address of the bookmark: <a href="http://www.rstudio.com/" rel="nofollow">http://www.rstudio.com/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44234/steps-to-find-palindrome-in-genomes</guid>
	<pubDate>Thu, 09 Mar 2023 02:56:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44234/steps-to-find-palindrome-in-genomes</link>
	<title><![CDATA[Steps to find palindrome in genomes !]]></title>
	<description><![CDATA[<div><div><div><div><div><div><div><div><div><div><p>Palindromes are sequences of nucleotides that read the same backward as forward. They can be present in genomes and have various biological functions. Here are some methods for discovering palindromes in genomes:</p><ol>
<li>
<p>Direct sequence search: One of the simplest ways to discover palindromes is to search the genome sequence directly for palindromic sequences using pattern matching tools, such as regular expressions or string algorithms. This approach can be useful for discovering simple palindromes, but may miss more complex palindromic structures.</p>
</li>
<li>
<p>Dot plot analysis: Dot plot analysis is a graphical method that can be used to identify palindromic regions in a genome. It involves plotting the genome sequence against itself and examining the diagonal patterns that emerge. Palindromic regions will appear as symmetrical patterns along the diagonal.</p>
</li>
<li>
<p>Restriction enzyme analysis: Some restriction enzymes, such as EcoRI and HindIII, recognize palindromic sequences and cleave DNA at these sites. By digesting the genome with these enzymes and examining the resulting fragments, palindromic regions can be identified.</p>
</li>
<li>
<p>Next-generation sequencing: High-throughput sequencing technologies, such as PacBio and Oxford Nanopore, can generate long reads that can span entire palindromic regions. By mapping these reads to the genome, palindromic regions can be identified and characterized.</p>
</li>
<li>
<p>Comparative genomics: Comparing the genomes of related species can also reveal palindromic regions that are conserved across evolutionarily divergent lineages. This approach can help identify functional palindromes that are under selective pressure.</p>
</li>
</ol><p>Overall, the discovery of palindromic sequences in genomes can be accomplished using a variety of methods, each with their own advantages and limitations. A combination of these methods can provide a comprehensive understanding of the palindromic landscape of a genome.</p></div></div></div></div></div></div></div></div></div></div>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/19980/seqloc-06</guid>
	<pubDate>Sun, 28 Dec 2014 12:51:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/19980/seqloc-06</link>
	<title><![CDATA[seqloc 0.6]]></title>
	<description><![CDATA[<p>The <code>Bio.SeqLoc</code> modules in <code>seqloc</code> are designed to represent positions and locations (ranges of positions) on sequences, particularly nucleotide sequences. My original motivation for writing these packages was handing the locations of genes in eukaryotic genomes.</p>
<p>Handle sequence locations for bioinformatics http://www.ingolia-lab.org/seqloc-tutorial.html</p><p>Address of the bookmark: <a href="http://www.stackage.org/snapshot/nightly-2014-12-28/package/seqloc-0.6" rel="nofollow">http://www.stackage.org/snapshot/nightly-2014-12-28/package/seqloc-0.6</a></p>]]></description>
	<dc:creator>Gudiya Pal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35055/jabba-hybrid-error-correction-for-long-sequencing-reads</guid>
	<pubDate>Fri, 05 Jan 2018 03:58:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35055/jabba-hybrid-error-correction-for-long-sequencing-reads</link>
	<title><![CDATA[Jabba: Hybrid Error Correction for Long Sequencing Reads]]></title>
	<description><![CDATA[<p>Jabba is a hybrid error correction tool to correct third generation (PacBio / ONT) sequencing data, using second generation (Illumina) data.</p>
<p>Input</p>
<p>Jabba takes as input a concatenated de Bruijn graph and a set of sequences:</p>
<p>the de Bruijn graph should appear in fasta format with 1 entry per node, the meta information should be in the format:<br>&gt;NODE <br>the set of sequences should be in fasta or fastq format. These sequences will be corrected (e.g. PacBio reads). The corrections will be written to a file Jabba fasta.<br>The output is a file in fasta format with corrections of the long reads, and additionally a file in the input format containing uncorrected reads.</p>
<p>https://github.com/biointec/jabba/wiki</p>
<p>https://almob.biomedcentral.com/articles/10.1186/s13015-016-0075-7</p><p>Address of the bookmark: <a href="https://github.com/biointec/jabba" rel="nofollow">https://github.com/biointec/jabba</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/20271/research-associate-tata-memorial-centre-advanced-centre-for-treatment-research-and-education-in-cancer-kharghar-navi-mumbai</guid>
  <pubDate>Thu, 08 Jan 2015 20:53:57 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Associate	@ TATA MEMORIAL CENTRE ADVANCED CENTRE FOR TREATMENT, RESEARCH AND EDUCATION IN CANCER KHARGHAR, NAVI MUMBAI]]></title>
  <description><![CDATA[
<p>TATA MEMORIAL CENTRE ADVANCED CENTRE FOR TREATMENT, RESEARCH AND EDUCATION IN CANCER KHARGHAR, NAVI MUMBAI – 410210</p>

<p>Website: www.actrec.gov.in; Ph: 27405000</p>

<p>No. ACTREC/Advt./ 66 /2014 23rd December, 2014<br />Research Associate	</p>

<p>International Cancer Genome Consortium (ICGC) - India Project (IRB Project No. 3 A/c. No. 2408)</p>

<p>Dr. Rajiv Sarin</p>

<p>Duration of the Project: One year Extendable up to Three years.</p>

<p>Consolidated Salary: Rs. 42,000/- p.m.</p>

<p>Application last date: 8th January, 2015.</p>

<p>Interview Date &amp; Time: 21st January, 2015, at 11.00 a.m.</p>

<p>Venue: Conference Room, 3rd floor, Khanolkar Shodhika, ACTREC.</p>

<p>Essential Qualifications and Experience:</p>

<p>Ph.D (any branch of Life Sciences)</p>

<p>The candidate must have at least one year experience after Ph.D., preferably in Genomics and Molecular Biology.</p>

<p>Candidates fulfilling these requirements should pre register themselves by sending their application in the prescribed format with recent CV and contact details of 2 referees by e-mail to icgc@actrec.gov.in latest 8th January, 2015 by 10.00 a.m.</p>

<p>Candidates shortlisted for the interview will be intimated by email on or before 9th January, 2015.</p>

<p>The interviews would be held on 21st January 2015 and will be only for the pre registered candidates who have been shortlisted.<br />No T.A./D.A. will be admissible for attending the interview.</p>

<p>At the time of Interview the candidate should bring original certificates along with CV with contact details of 2 referees and submit the photocopies (attested) of the certificates, with a recent passport size photograph.</p>

<p>Advertisement: www.actrec.gov.in/data%20files/2014/Walk-in-Research-Fellow-26-12-14.doc</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40940/consed-a-finishing-package-bam-file-viewer-assembly-editor-autofinish-autoreport-autoedit-and-align-reads-to-reference-sequence</guid>
	<pubDate>Fri, 07 Feb 2020 07:16:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40940/consed-a-finishing-package-bam-file-viewer-assembly-editor-autofinish-autoreport-autoedit-and-align-reads-to-reference-sequence</link>
	<title><![CDATA[Consed--A Finishing Package (BAM File Viewer, Assembly Editor, Autofinish, Autoreport, Autoedit, and Align Reads To Reference Sequence)]]></title>
	<description><![CDATA[<ul>
<li>Supports Illumina, 454, other Next-Gen and Sanger Reads and allows mixtures of these read types</li>
<li>Consed includes BamScape which can view bam files with unlimited numbers of reads. BamScape can bring up consed to edit reads and the reference sequence in targeted regions.</li>
<li>Consed is compatible with Newbler, Cross_match, Phrap, MIRA, Velvet and PCAP output.</li>
<li>Quickly takes the user to each variant site for viewing (also available as an automated report)</li>
<li>Overview of assembly can help detect and fix misassemblies</li>
<li>Editing time reduced by the program's ability to pin-point problem areas</li>
<li>Editing is guided by error probabilities</li>
</ul><p>Address of the bookmark: <a href="http://www.phrap.org/consed/consed.html" rel="nofollow">http://www.phrap.org/consed/consed.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/20454/comparative-genomics-in-ensembl</guid>
	<pubDate>Wed, 21 Jan 2015 08:31:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/20454/comparative-genomics-in-ensembl</link>
	<title><![CDATA[Comparative Genomics in Ensembl]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/dDRdCnZOMCM" frameborder="0" allowfullscreen></iframe>The Ensembl browser provides viewable whole-genome alignments, homologues and phylogenetic gene trees, protein families, and ancestral sequences.  Learn how to view and export these data in this video.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/20471/bioinformatics-scripts</guid>
	<pubDate>Thu, 22 Jan 2015 22:29:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/20471/bioinformatics-scripts</link>
	<title><![CDATA[Bioinformatics Scripts]]></title>
	<description><![CDATA[<p>Some of the useful bioinformatics scripts.</p>
<p>For example ... contig-stats.pl is a Perl script that will automatically describe features of a sequence assembly.</p>
<p>http://milkweedgenome.org/?q=scripts</p><p>Address of the bookmark: <a href="http://milkweedgenome.org/?q=scripts" rel="nofollow">http://milkweedgenome.org/?q=scripts</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/20504/chromevol</guid>
	<pubDate>Sun, 25 Jan 2015 00:33:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/20504/chromevol</link>
	<title><![CDATA[ChromEvol]]></title>
	<description><![CDATA[<p>Chromosome number is a remarkably dynamic feature of eukaryotic evolution. Chromosome numbers can change by a duplication of the whole genome (a process termed polyploidy), or by single chromosome changes (ascending dysploidy via, e.g., chromosome fission or descending dysploidy via, e.g., chromosome fusion).<br> Of the various mechanisms of chromosome number change, polyploidy has received significant attention because of the impact such an event may have on the organism.<br> ChromEvol implements a series of likelihood models for the evolution of chromosome numbers. By comparing the fit of the different models to biological data, it may be possible to gain insight regarding the pathways by which the evolution of chromosome number proceeds. For each model, the program estimates the rates for the possible transitions assumed by the model, infers the set of ancestral chromosome numbers, and estimates the location along the tree for which polyploidy events (and other chromosome number changes) occurred. For further methodological details, see the publications and manual on the Downloads page.</p>
<p>http://www.tau.ac.il/~itaymay/cp/chromEvol/about.html</p><p>Address of the bookmark: <a href="http://www.tau.ac.il/~itaymay/cp/chromEvol/downloads.html" rel="nofollow">http://www.tau.ac.il/~itaymay/cp/chromEvol/downloads.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/20672/jrfra-structuralcomputational-biology-at-icgeb</guid>
  <pubDate>Thu, 29 Jan 2015 11:52:40 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF/RA Structural/Computational Biology at ICGEB]]></title>
  <description><![CDATA[
<p>Research Associate and JRF positions in the Structural and Computational Biology Group starting 1st March 2015. Collaborative projects include work on:</p>

<p>a) bioinformatics, systems and computational biology <br />b) malaria <br />c) drug discovery <br />d) genomics <br />e) microbiology <br />f) metabolic disorders <br />g) molecular medicine</p>

<p>Eligibility: Applicants must have one of the following :</p>

<p>1) INSPIRE award for undertakig either PhD or Postdoctoral research; <br />2) SPM award for PhD; <br />3) JRF for pursuing PhD from CSIR/DBT/ICMR</p>

<p>Interest and experience in Biochemistry/Bioinformatics/Biophysics/ Chemistry/Genomics/Molecular Biology/ is essential.</p>

<p>Submit curriculum vitae to sb.icgeb@gmail.com by 20 February 2015</p>
]]></description>
</item>

</channel>
</rss>