<?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/30149?offset=900</link>
	<atom:link href="https://bioinformaticsonline.com/related/30149?offset=900" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30198/faculty-at-indian-institute-of-science-education-and-research-berhampur</guid>
  <pubDate>Mon, 19 Dec 2016 03:34:26 -0600</pubDate>
  <link></link>
  <title><![CDATA[Faculty at Indian Institute of Science Education and Research Berhampur]]></title>
  <description><![CDATA[
<p>Advt. No: IISERBPR/DoFA/2016/2</p>

<p>Advertisement for Faculty Positions</p>

<p>The IISER Berhampur, an Institute of national importance, established through an act of Parliament is an autonomous organization under the Ministry of HRD, Govt. of India, to promote quality education and cutting edge research in basic sciences and to provide a platform for the faculty to engage in high quality education, at undergraduate and postgraduate levels. The Institute invites applications for faculty positions at the level of Assistant Professor (C) /Assistant Professor in the following disciplines:</p>

<p>1. Biological Sciences</p>

<p>2. Chemistry</p>

<p>3. Computer Sciences</p>

<p>4. Mathematics</p>

<p>5. Physics</p>

<p>Only hard copy of application in the prescribed format, via Speed Post should be sent to the Dean, Faculty Affairs, IISER Berhampur, Industrial Training Institute (ITI) Berhampur, Engineering School Road, Berhampur - 760 010, Ganjam District, Odisha, before 1700 hrs., December 30, 2016.</p>

<p>http://www.iiserbpr.ac.in</p>

<p>More Info : http://www.iiserbpr.ac.in/vacancies/Advertisement%20for%20Faculty%20Positions%20at%20IISER%20Berhampur.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30355/meme-suite</guid>
	<pubDate>Fri, 23 Dec 2016 08:49:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30355/meme-suite</link>
	<title><![CDATA[MEME suite]]></title>
	<description><![CDATA[<p>Motif based sequence analysis suits&nbsp;</p>
<p>The MEME Suite allows the biologist to discover novel motifs in collections of unaligned nucleotide or protein sequences, and to perform a wide variety of other motif-based analyses.</p>
<p>The MEME Suite supports motif-based analysis of DNA, RNA and protein sequences. It provides motif discovery algorithms using both probabilistic (MEME) and discrete models (MEME), which have complementary strengths. It also allows discovery of motifs with arbitrary insertions and deletions (GLAM2). In addition to motif discovery, the MEME Suite provides tools for scanning sequences for matches to motifs (FIMO, MAST and GLAM2Scan), scanning for clusters of motifs (MCAST), comparing motifs to known motifs (Tomtom), finding preferred spacings between motifs (SpaMo), predicting the biological roles of motifs (GOMo), measuring the positional enrichment of sequences for known motifs (CentriMo), and analyzing ChIP-seq and other large datasets (MEME-ChIP).</p>
<p>The MEME Suite is comprised of a collection of tools that work together, as shown below. Not all the tools are available as webservices, so to get the full power of the MEME Suite you will need to&nbsp;<a href="http://meme-suite.org/doc/download.html">download</a>&nbsp;and&nbsp;<a href="http://meme-suite.org/doc/install.html">install</a>&nbsp;a local copy of the software. To see what has changed recently you can peruse the&nbsp;<a href="http://meme-suite.org/doc/release-notes.html">release notes</a>.</p>
<p>http://meme-suite.org/</p><p>Address of the bookmark: <a href="http://meme-suite.org/" rel="nofollow">http://meme-suite.org/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</guid>
	<pubDate>Thu, 29 Dec 2016 03:26:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30459/prodigal-prokaryotic-dynamic-programming-genefinding-algorithm</link>
	<title><![CDATA[Prodigal (Prokaryotic Dynamic Programming Genefinding Algorithm)]]></title>
	<description><![CDATA[<p><span>Prodigal (</span><strong>Pro</strong><span>karyotic&nbsp;</span><strong>Dy</strong><span>namic Programming&nbsp;</span><strong>G</strong><span>enefinding&nbsp;</span><strong>Al</strong><span>gorithm) is a microbial (bacterial and archaeal) gene finding program developed at Oak Ridge National Laboratory and the University of Tennessee. Key features of Prodigal include:</span></p>
<ul>
<li><strong>Speed</strong>: Prodigal is an extremely fast gene recognition tool (written in very vanilla C). It can analyze an entire microbial genome in 30 seconds or less.</li>
<li><strong>Accuracy</strong>: Prodigal is a highly accurate gene finder. It correctly locates the 3' end of every gene in the experimentally verified Ecogene data set (except those containing introns). It possesses a very sophisticated ribosomal binding site scoring system that enables it to locate the translation initiation site with great accuracy (96% of the 5' ends in the Ecogene data set are located correctly).</li>
<li><strong>Specificity</strong>: Prodigal's false positive rate compares favorably with other gene identification programs, and usually falls under 5%.</li>
<li><strong>GC-Content Indifferent</strong>: Prodigal performs well even in high GC genomes, with over a 90% perfect match (5'+3') to the&nbsp;<em>Pseudomonas aeruginosa</em>&nbsp;curated annotations.</li>
<li><strong>Metagenomic Version</strong>: Prodigal can run in metagenomic mode and analyze sequences even when the organism is unknown.</li>
<li><strong>Ease of Use</strong>: Prodigal can be run in one step on a single genomic sequence or on a draft genome containing many sequences. It does not need to be supplied with any knowledge of the organism, as it learns all the properties it needs to on its own.</li>
<li><strong>Open Source</strong>: Prodigal source code is freely available under the General Public License.</li>
</ul>
<p>&nbsp;</p>
<div style="text-align: center;"><strong>Download the latest version of Prodigal at&nbsp;<a href="http://github.com/hyattpd/prodigal/releases/">the Prodigal github page.</a></strong>&nbsp;<br>or&nbsp;<br><strong>Browse the&nbsp;<a href="http://github.com/hyattpd/prodigal/wiki">wiki documenation.</a></strong>&nbsp;</div><p>Address of the bookmark: <a href="http://prodigal.ornl.gov/" rel="nofollow">http://prodigal.ornl.gov/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30555/yaha</guid>
	<pubDate>Fri, 20 Jan 2017 05:38:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30555/yaha</link>
	<title><![CDATA[YAHA]]></title>
	<description><![CDATA[<p>YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints.</p>
<p><strong>Availability:</strong> YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from <a href="http://faculty.virginia.edu/irahall/YAHA" target="pmc_ext">http://faculty.virginia.edu/irahall/YAHA</a>.</p>
<p><strong>Contact:</strong></p>
<p>http://genome.wustl.edu/people/groups/detail/hall-lab/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30657/studentship</guid>
  <pubDate>Tue, 24 Jan 2017 04:26:14 -0600</pubDate>
  <link></link>
  <title><![CDATA[Studentship]]></title>
  <description><![CDATA[
<p>Advt. No. ACBR/BTBI/BIF/Manpower/ADV/16-17<br />Research Associate/ Studentship/ Traineeship Jobs opportunity in  University of Delhi - Dr. B.R. Ambedkar Center for Biomedical Research (ACBR) on temporary basis<br />Studentship<br />No. of Post : 01<br />Qualifications : Applicants who are pursuing Post Graduate Degree course/ Diploma in Bioinformatics/ Biomedical Sciences/ Biotechnology/Life Sciences/Chemistry/ Biochemistry with a programme in Bioinformatics to carry out the project.<br />Remuneration : Rs. 8,000/-<br />Traineeship<br />No. of Post : 01<br />Qualifications : Applicants who have completed their Post Graduate degree in Bioinformatics /Biomedical Sciences/Biotechnology/Life Sciences/Chemistry/Biochemistry or any other branch of Life Sciences with knowledge in Bioinformatics<br />Remuneration : Rs. 8,000/-<br />Research Associate<br />No. of Post : 01<br />Qualifications : Ph.D. in Bio-Medical Sciences/Bioinformatics/ Biotechnology/Life Sciences/ Chemistry/ Bio-Chemistry and related areas<br />Remuneration : Rs. 36,000/-</p>

<p>Applicant are required to bring 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 etc. at the time of Interview. Applications should also be sent by Entail to Dr. Madhu Chopra, Coordinator, BIF Facility. Email: acbrdu.blisnet@nic.in;  mchopradu@gmail.com.<br />Interview Date : 13.02.2017<br />Time : 10:00 am-12:00 noon<br />Venue : ACBR</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/8798/list-of-gene-ontology-software-and-tools</guid>
	<pubDate>Sun, 09 Mar 2014 14:48:19 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/8798/list-of-gene-ontology-software-and-tools</link>
	<title><![CDATA[List of gene ontology software and tools]]></title>
	<description><![CDATA[<p>The Gene Ontology (GO) is a set of associations from biological phrases to specific genes that are either chosen by trained curators or generated automatically. GO is designed to rigorously encapsulate the known relationships between biological terms and and all genes that are instances of these terms. These Gene Ontology has become an extremely useful tool for the analysis of genomic data and structuring of biological knowledge. Several excellent software tools for navigating the gene ontology have been developed.</p><p><img src="http://ohnosequences.com/images/GoSlimBlog.svg" alt="image" width="500" height="380" style="border: 0px; border: 0px;"></p><p>The GO provides core biological knowledge representation for modern biologists, whether computationally or experimentally based. GO resources include biomedical ontologies that cover molecular domains of all life forms as well as extensive compilations of gene product annotations to these ontologies that provide largely species-neutral, comprehensive statements about what gene products do. Although extensively used in data analysis workflows, and widely incorporated into numerous data analysis platforms and applications, the general user of GO resources often misses fundamental distinctions about GO structures, GO annotations, and what can and can not be extrapolated from GO resources. Here are ten quick tips for using the Gene Ontology.</p><p>Read "Ten Quick Tips for Using the Gene Ontology" at http://www.ploscompbiol.org/article/info%3Adoi%2F10.1371%2Fjournal.pcbi.1003343</p><p>Following are the most commonly used old and new GO term enrichment determination tools. These tools are recommended to people working in a wet-lab.</p><p><strong>CLASSIFI (Department of Pathology, UT Southwestern Medical Center)</strong></p><p>CLASSIFI (Cluster Assignment for Biological Inference) is a data-mining tool that can be used to identify significant co-clustering of genes with similar functional properties (e.g. cellular response to DNA damage). Briefly, CLASSIFI uses the Gene OntologyTM (GO) gene annotation scheme to define the functional properties of all genes/probes in a microarray data set, and then applies a cumulative hypergeometric distribution analysis to determine if any statistically significant gene ontology co-clustering has occurred.</p><p><a href="http://pathcuric1.swmed.edu/pathdb/classifi.html">http://pathcuric1.swmed.edu/pathdb/classifi.html</a></p><p><strong>EasyGO (China Agricultural University)</strong></p><p>EasyGO is designed to automate enrichment job for experimental biologists to identify enriched Gene Ontology (GO) terms in a list of microarray probe sets or gene identifiers (with expression information for PAGE analysis). Also EasyGO is also a GO annotation database, especially focus on agronomical species, supporting 30 species. It is user friendly, with advanced result browsing format and in-time update.</p><p><a href="http://bioinformatics.cau.edu.cn/neweasygo/">http://bioinformatics.cau.edu.cn/neweasygo/</a></p><p><a href="http://bioinformatics.cau.edu.cn/easygo/">http://bioinformatics.cau.edu.cn/easygo/</a></p><p><strong>g:GOSt (Institute of Computer Science, University of Tartu)</strong></p><p>g:GOSt retrieves most significant Gene Ontology (GO) terms, KEGG and REACTOME pathways, and TRANSFAC motifs to a user-specified group of genes, proteins or microarray probes. g:GOSt also allows analysis of ranked or ordered lists of genes, visual browsing of GO graph structure, interactive visualisation of retrieved results, and many other features. Multiple testing corrections are applied to extract only statistically important results.</p><p><a href="http://biit.cs.ut.ee/gprofiler/">http://biit.cs.ut.ee/gprofiler/</a></p><p><strong>DAVID</strong> : Gene Functional Classification (Laboratory of Immunopathogenesis and Bioinformatics, NIAID)</p><p>The Functional Classification Tool provides a rapid means to organize large lists of genes into functionally related groups to help unravel the biological content captured by high throughput technologies.</p><p><a href="http://david.abcc.ncifcrf.gov/gene2gene.jsp">http://david.abcc.ncifcrf.gov/gene2gene.jsp</a></p><p><a href="http://david.abcc.ncifcrf.gov/">http://david.abcc.ncifcrf.gov/</a></p><p>API <a href="https://github.com/chrisamiller/davidapi">https://github.com/chrisamiller/davidapi</a></p><p><strong>GOEAST</strong> (Institute of Genetics and Developmental Biology, Chinese Academy of Sciences)</p><p>GOEAST is web based software toolkit providing easy to use, visualizable, comprehensive and unbiased Gene Ontology (GO) analysis for high-throughput experimental results, especially for results from microarray hybridization experiments. The main function of GOEAST is to identify significantly enriched GO terms among give lists of genes using accurate statistical methods.</p><p><a href="http://omicslab.genetics.ac.cn/GOEAST/">http://omicslab.genetics.ac.cn/GOEAST/</a></p><p><strong>GOstat</strong> (Walter and Eliza Hall Institute of Medical Research)</p><p>Find statistically overrepresented GO terms within a group of genes</p><p><a href="http://gostat.wehi.edu.au/">http://gostat.wehi.edu.au/</a></p><p><strong>GOrilla</strong> (Technion - Laboratory of Computational Biology , Israel Institute of Technology)</p><p>GOrilla is a tool for identifying and visualizing enriched GO terms in ranked lists of genes.<br /> It uses two approaches, first by searching for enriched GO terms that appear densely at the top of a ranked list of genes&nbsp; or by searching for enriched GO terms in a target list of genes compared to a background list of genes.</p><p><a href="http://cbl-gorilla.cs.technion.ac.il/">GOrilla</a> makes nice pictures !!!!</p><p><a href="http://cbl-gorilla.cs.technion.ac.il/">http://cbl-gorilla.cs.technion.ac.il/</a></p><p><strong>Gene Ontology for Functional Analysis (GOFFA)</strong></p><p>GOFFA is a tool developed for ArrayTrack&trade; that takes a list of genes and identifies terms in Gene Ontology (GO) disclaimer icon associated with those genes.</p><p>It provides several tools to view/access the GO term hierarchy, full listing of GO terms annotated with the genes associated with a given term with statically useful report.</p><p><a href="http://www.fda.gov/ScienceResearch/BioinformaticsTools/ucm233315.htm">http://www.fda.gov/ScienceResearch/BioinformaticsTools/ucm233315.htm</a></p><p><strong>GOAT</strong> (The University of Manchester)</p><p>The aim of the GOAT project is to create an application that will guide users, especially biomedical researchers, in the annotation of gene products with terms from the <a href="http://www.geneontology.org">Gene Ontology</a>.</p><p><a href="http://goat.man.ac.uk/">http://goat.man.ac.uk/</a></p><p>Script <a href="https://github.com/tanghaibao/goatools/">https://github.com/tanghaibao/goatools/</a></p><p><strong>REVIGO</strong> ( Rudjer Boskovic Institute, Croatia)</p><p>REViGO is a web server that can take long lists of Gene Ontology terms and summarize them by removing redundant GO terms. The remaining terms can be visualized in semantic similarity-based scatterplots, interactive graphs, or tag clouds.</p><p><a href="http://revigo.irb.hr/">http://revigo.irb.hr/</a></p><p><strong>QuickGo</strong> (EMBL-EBI Institute)</p><p>It uses extensive computational filters to allow the generation of specific subsets of GO annotations, mapped to sequence identifiers of your choice. Then GO slims are used which is collective list of GO full set of terms available from the Gene Ontology project.</p><p><a href="http://www.ebi.ac.uk/QuickGO/">http://www.ebi.ac.uk/QuickGO/</a></p><p><strong>GOLEM</strong></p><p>An interactive graph-based gene-ontology navigation and analysis tool. GOLEM is a userful tool which allows the viewer to navigate and explore a local portion of the <a href="http://www.geneontology.org/">Gene Ontology</a> (GO) hierarchy.</p><p><a href="http://reducio.princeton.edu/GOLEM/">http://reducio.princeton.edu/GOLEM/</a></p><p><strong>BGI Web Gene Ontology (WEGO)</strong> Annotation Plot (Beijing Genomics Institute)</p><p>WEGO () is a useful tool for plotting GO annotation results. It has been widely used in many important biological research projects, such as the rice genome project [<a href="http://wego.genomics.org.cn/pubs/rice_indica.pdf">Yu, J. et al. Science 296, 79-92 (2002);</a> <a href="http://wego.genomics.org.cn/pubs/rice_finish.pdf">Yu, J. et al. PLoS Biol 3, e38 (2005)</a>] and the silkworm genome project [<a href="http://wego.genomics.org.cn/pubs/combine_silkworm.pdf">Xia, Q. et al. Science 306, 1937-40 (2004)</a>]. It has become one of the daily tools for downstream gene annotation analysis, especially when performing comparative genomics tasks. WEGO along with two other tools, namely <a href="http://wego.genomics.org.cn/cgi-bin/wego/External2GO.pl">External to GO Query</a> and <a href="http://wego.genomics.org.cn/cgi-bin/wego/GOArchive.pl">GO Archive Query</a>, are freely available for all users. Any suggestions are welcome at <a href="mailto:%20wego@genomics.org.cn">wego@genomics.org.cn</a>. Here is a sample output generated by WEGO</p><p><a href="http://wego.genomics.org.cn/cgi-bin/wego/index.pl">http://wego.genomics.org.cn/cgi-bin/wego/index.pl</a></p><p><strong>GeneGO MetaCore</strong> (MIT)</p><p>GeneGo is a leading provider of data mining &amp; analysis solutions in systems biology. MetaCore, GeneGo's flapship product, is an integrated software suite for functional analysis of experimental data. MetaCore is based on a curated database of human protein-protein, protein-DNA interactions, transcription factors, signaling and metabolic pathways, disease and toxicity, and the effects of bioactive molecules.</p><p><a href="https://portal.genego.com/">https://portal.genego.com/</a></p><p><strong>GOEx</strong> (Stony Brook University)</p><p>GOEx facilitates organism-specific studies by leveraging GO and providing a rich graphical user interface. It is a simple to use tool, specialized for biologists who wish to analyze spectral counting data from shotgun proteomics.</p><p><a href="http://pcarvalho.com/patternlab">http://pcarvalho.com/patternlab</a></p><p><strong>GOssTo</strong></p><p>GOssTo and GOssToWeb are tools to calculate the <a href="https://en.wikipedia.org/wiki/Semantic_similarity#Biomedical_Informatics">semantic similarity</a> between genes or terms in the <a href="http://www.geneontology.org/">Gene Ontology</a>.</p><p><a href="http://www.paccanarolab.org/gosstoweb/">http://www.paccanarolab.org/gosstoweb/</a></p><p><strong>GO Workbench</strong></p><p>The Gene Ontology Analysis Viewer allows direct browsing of the Gene Ontology, and also the visualization of GO Term analysis results.</p><p><a href="http://wiki.c2b2.columbia.edu/workbench/index.php/Gene_Ontology_Viewer">http://wiki.c2b2.columbia.edu/workbench/index.php/Gene_Ontology_Viewer</a></p><p>Some other useful list of GO software and tools is available at <a href="http://www.geneontology.org/GO.tools.shtml#browser">http://www.geneontology.org/GO.tools.shtml#browser</a></p><p>Yet another useful webpage with list of GO tools at <a href="http://neurolex.org/wiki/Category:Resource:Gene_Ontology_Tools">http://neurolex.org/wiki/Category:Resource:Gene_Ontology_Tools</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30698/itol-interactive-tree-of-life</guid>
	<pubDate>Tue, 31 Jan 2017 05:56:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30698/itol-interactive-tree-of-life</link>
	<title><![CDATA[iTOL: interactive Tree Of Life]]></title>
	<description><![CDATA[<p><strong>Interactive Tree Of Life</strong><span>&nbsp;is an online tool for the display and manipulation of phylogenetic trees. It provides most of the features available in other tree viewers, and offers a novel circular tree layout, which makes it easy to visualize mid-sized tree (up to several thousand leaves). Trees can be exported to several graphical formats, both bitmap and vector based.</span></p>
<p><img src="http://itol.embl.de/img/home/ex3.png" alt="image" style="border: 0px;"><br><span>There are several pre-computed trees available for display, including the main Tree Of Life, described in&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/16513982">Ciccarelli, et al., 2006</a><span>. In addition to the precomputed trees, users can upload and display personal trees and data, using the 'Data upload' page or through a personal user account.</span></p><p>Address of the bookmark: <a href="http://itol.embl.de/" rel="nofollow">http://itol.embl.de/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30833/dnasp-v5-a-software-for-comprehensive-analysis-of-dna-polymorphism-data</guid>
	<pubDate>Mon, 06 Feb 2017 04:45:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30833/dnasp-v5-a-software-for-comprehensive-analysis-of-dna-polymorphism-data</link>
	<title><![CDATA[DnaSP v5: a software for comprehensive analysis of DNA polymorphism data]]></title>
	<description><![CDATA[<p><span>DnaSP is a software package for a comprehensive analysis of DNA polymorphism data. Version 5 implements a number of new features and analytical methods allowing extensive DNA polymorphism analyses on large datasets. Among other features, the newly implemented methods allow for: (i) analyses on multiple data files; (ii) haplotype phasing; (iii) analyses on insertion/deletion polymorphism data; (iv) visualizing sliding window results integrated with available genome annotations in the UCSC browser.</span></p><p>Address of the bookmark: <a href="http://www.ub.edu/dnasp/" rel="nofollow">http://www.ub.edu/dnasp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30901/ideoplot</guid>
	<pubDate>Mon, 13 Feb 2017 09:47:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30901/ideoplot</link>
	<title><![CDATA[Ideoplot]]></title>
	<description><![CDATA[<p>Simple ideogram plotting and annotation in R.</p>
<p>Basic usage:</p>
<p>Rscript Ideoplot.R --heatmap hm.bed --annotate annotations.bed --out ideogram.pdf<br> -or-<br> Rscript Ideoplot.R --annotate annotations.bed</p>
<pre>Options
  --ideobed, i      A bed file of reference contig lengths/chromosome names
  --heatmap, -h     Fill chromosomes with normalized heatmap
                   (described below)
  --annotate, -a    Add character annotations.
  --out, -o         PDF output name.
  --stripes, -s     Specify a file containing the layout of the
                    annotations (description below)
  --bars, -b        Add track annotations
  --reference, -f   Either hg19, or hg38
  --topdown, r      Flag, when set, flips the orientation (P arms
                    drawn on top).
</pre><p>Address of the bookmark: <a href="https://github.com/mchaisso/Ideoplot" rel="nofollow">https://github.com/mchaisso/Ideoplot</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34862/pasa-gene-structure-annotation-and-analysis</guid>
	<pubDate>Tue, 26 Dec 2017 21:14:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34862/pasa-gene-structure-annotation-and-analysis</link>
	<title><![CDATA[PASA: Gene Structure Annotation and Analysis]]></title>
	<description><![CDATA[<p><span>PASA, acronym for Program to Assemble Spliced Alignments, is a eukaryotic genome annotation tool that exploits spliced alignments of expressed transcript sequences to automatically model gene structures, and to maintain gene structure annotation consistent with the most recently available experimental sequence data. PASA also identifies and classifies all splicing variations supported by the transcript alignments.</span></p><p>Address of the bookmark: <a href="http://pasapipeline.github.io/" rel="nofollow">http://pasapipeline.github.io/</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>

</channel>
</rss>