<?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/40214?offset=70</link>
	<atom:link href="https://bioinformaticsonline.com/related/40214?offset=70" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44630/genofig-a-user-friendly-application-for-the-visualization-and-comparison-of-genomic-regions</guid>
	<pubDate>Mon, 05 Aug 2024 23:06:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44630/genofig-a-user-friendly-application-for-the-visualization-and-comparison-of-genomic-regions</link>
	<title><![CDATA[GenoFig: a user-friendly application for the visualization and comparison of genomic regions]]></title>
	<description><![CDATA[<p>Tool for graphical vizualisation of annotated genetic regions, and homologous regions comparison. It is an independent recoding of Easyfig 2 initially developped by at the S. Beatson Lab [<a href="https://mjsull.github.io/Easyfig/" target="_blank">https://mjsull.github.io/Easyfig/</a>]</p>
<p dir="auto">Download the GenoFig source code using the 'Download' button on top of this page. Cloning is currently not available for people not member of the INRAE French Institution. After decompression, open a terminal in the folder containing the decompressed files and run:</p>
<div>
<pre id="code-47"><code><span>conda env create -f extras/requirements.yml</span>
<span>extras/SETUP.sh</span></code></pre>
</div><p>Address of the bookmark: <a href="https://forgemia.inra.fr/public-pgba/genofig" rel="nofollow">https://forgemia.inra.fr/public-pgba/genofig</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34380/chsminer-a-gui-tool-to-identify-chromosomal-homologous-segments</guid>
	<pubDate>Sat, 18 Nov 2017 16:55:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34380/chsminer-a-gui-tool-to-identify-chromosomal-homologous-segments</link>
	<title><![CDATA[CHSMiner: a GUI tool to identify chromosomal homologous segments]]></title>
	<description><![CDATA[<div id="ASec1">
<h3>Background</h3>
<p>The identification of chromosomal homologous segments (CHS) within and between genomes is essential for comparative genomics. Various processes including insertion/deletion and inversion could cause the degeneration of CHSs.</p>
</div>
<div id="ASec2">
<h3>Results</h3>
<p>Here we present a Java software CHSMiner that detects CHSs based on shared gene content alone. It implements fast greedy search algorithm and rigorous statistical validation, and its friendly graphical interface allows interactive visualization of the results. We tested the software on both simulated and biological realistic data and compared its performance with similar existing software and data source.</p>
</div>
<div id="ASec3">
<h3>Conclusion</h3>
<p>CHSMiner is characterized by its integrated workflow, fast speed and convenient usage. It will be useful for both experimentalists and bioinformaticians interested in the structure and evolution of genomes.</p>
<p>&nbsp;</p>
<p>https://github.com/zhenwang100/CHSMiner</p>
</div><p>Address of the bookmark: <a href="https://almob.biomedcentral.com/articles/10.1186/1748-7188-4-2" rel="nofollow">https://almob.biomedcentral.com/articles/10.1186/1748-7188-4-2</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33006/avid-a-global-alignment-program</guid>
	<pubDate>Wed, 24 May 2017 05:19:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33006/avid-a-global-alignment-program</link>
	<title><![CDATA[AVID: A Global Alignment Program]]></title>
	<description><![CDATA[<p>A new global alignment method called AVID. The method is designed to be fast, memory efficient, and practical for sequence alignments of large genomic regions up to megabases long. We present numerous applications of the method, ranging from the comparison of assemblies to alignment of large syntenic genomic regions and whole genome human/mouse alignments. We have also performed a quantitative comparison of AVID with other popular alignment tools. To this end, we have established a format for the representation of alignments and methods for their comparison. These formats and methods should be useful for future studies. The tools we have developed for the alignment comparisons, as well as the AVID program, are publicly available. See Web Site References section for AVID Web address and Web addresses for other programs discussed in this paper.</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC430967/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC430967/</a></p>]]></description>
	<dc:creator>Archana Malhotra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39683/gffcompare-program-for-processing-gtfgff-files</guid>
	<pubDate>Tue, 09 Jul 2019 13:35:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39683/gffcompare-program-for-processing-gtfgff-files</link>
	<title><![CDATA[GffCompare: Program for processing GTF/GFF files]]></title>
	<description><![CDATA[<p>The program gffcompare can be used to compare, merge, annotate and estimate accuracy of one or more GFF files (the &ldquo;query&rdquo; files), when compared with a reference annotation (also provided as GFF).</p><p>Address of the bookmark: <a href="https://ccb.jhu.edu/software/stringtie/gffcompare.shtml" rel="nofollow">https://ccb.jhu.edu/software/stringtie/gffcompare.shtml</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34443/opera-an-optimal-genome-scaffolding-program</guid>
	<pubDate>Mon, 27 Nov 2017 10:18:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34443/opera-an-optimal-genome-scaffolding-program</link>
	<title><![CDATA[Opera: An optimal genome scaffolding program]]></title>
	<description><![CDATA[<p><span>Opera (Optimal Paired-End Read Assembler) is a sequence assembly program (</span><a href="http://en.wikipedia.org/wiki/Sequence_assembly" target="_blank">http://en.wikipedia.org/wiki/Sequence_assembly&nbsp;<img src="https://a.fsdn.com/con/img/icons/external_asset.png" alt="image" style="border: 0px;"></a><span>). It uses information from paired-end or long reads to optimally order and orient contigs assembled from shotgun-sequencing reads.</span><br><br><span>An updated version called OPERA-LG has been re-engineered with features for the assembly of large and complex genomes.</span><br><br><span>Song Gao, Denis Bertrand, Burton K. H. Chia and Niranjan Nagarajan. OPERA-LG: efficient and exact scaffolding of large, repeat-rich eukaryotic genomes with performance guarantees. Genome Biology, May 2016, doi: 10.1186/s13059-016-0951-y.</span><br><br><span>Song Gao, Wing-Kin Sung, Niranjan Nagarajan. Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. Journal of Computational Biology, Sept. 2011, doi:10.1089/cmb.2011.0170.</span></p>
<p><span>https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0951-y</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/operasf/" rel="nofollow">https://sourceforge.net/projects/operasf/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36852/mcmctree-a-phylogenetic-program-for-bayesian-estimation-of-species-divergence-times</guid>
	<pubDate>Sat, 02 Jun 2018 07:40:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36852/mcmctree-a-phylogenetic-program-for-bayesian-estimation-of-species-divergence-times</link>
	<title><![CDATA[MCMCTREE: a phylogenetic program for Bayesian estimation of species divergence times]]></title>
	<description><![CDATA[<p><a href="http://abacus.gene.ucl.ac.uk/software/paml.html" target="_blank">MCMCTREE</a><span>&nbsp;is a phylogenetic program for Bayesian estimation of species divergence times using soft fossil constraints under various molecular clock models. This is part of the&nbsp;</span><a href="http://abacus.gene.ucl.ac.uk/software/paml.html" target="_blank">PAML</a><span>&nbsp;package. In this tutorial I will analyze an easy example modified from dataset of&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/20551041" target="_blank">Inoue et al. (2010)</a><span>. Here we conduct a commonly used time estimation method, "Approximate Likelihood Method", for the datasets including more than 10 species.</span></p><p>Address of the bookmark: <a href="http://www.fish-evol.com/mcmctreeExampleVert6/text1Eng.html" rel="nofollow">http://www.fish-evol.com/mcmctreeExampleVert6/text1Eng.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38623/kallisto-a-program-for-quantifying-abundances-of-transcripts-from-bulk-and-single-cell-rna-seq-data</guid>
	<pubDate>Mon, 07 Jan 2019 10:35:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38623/kallisto-a-program-for-quantifying-abundances-of-transcripts-from-bulk-and-single-cell-rna-seq-data</link>
	<title><![CDATA[kallisto: a program for quantifying abundances of transcripts from bulk and single-cell RNA-Seq data]]></title>
	<description><![CDATA[<p><strong>kallisto</strong>&nbsp;is a program for quantifying abundances of transcripts from bulk and single-cell RNA-Seq data, or more generally of target sequences using high-throughput sequencing reads. It is based on the novel idea of&nbsp;<em>pseudoalignment</em>&nbsp;for rapidly determining the compatibility of reads with targets, without the need for alignment. On benchmarks with standard RNA-Seq data,&nbsp;<strong>kallisto</strong>&nbsp;can quantify 30 million human reads in less than 3 minutes on a Mac desktop computer using only the read sequences and a transcriptome index that itself takes less than 10 minutes to build. Pseudoalignment of reads preserves the key information needed for quantification, and&nbsp;<strong>kallisto</strong>&nbsp;is therefore not only fast, but also as accurate as existing quantification tools. In fact, because the pseudoalignment procedure is robust to errors in the reads, in many benchmarks&nbsp;<strong>kallisto</strong>&nbsp;significantly outperforms existing tools.&nbsp;<strong>kallisto</strong>&nbsp;is described in detail in:</p>
<p>Nicolas L Bray, Harold Pimentel, P&aacute;ll Melsted and Lior Pachter,&nbsp;<a href="http://www.nature.com/nbt/journal/v34/n5/full/nbt.3519.html">Near-optimal probabilistic RNA-seq quantification</a>, Nature Biotechnology&nbsp;<strong>34</strong>, 525&ndash;527 (2016), doi:10.1038/nbt.3519</p><p>Address of the bookmark: <a href="https://pachterlab.github.io/kallisto/about" rel="nofollow">https://pachterlab.github.io/kallisto/about</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39837/cactus-a-reference-free-whole-genome-multiple-alignment-program</guid>
	<pubDate>Mon, 12 Aug 2019 07:52:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39837/cactus-a-reference-free-whole-genome-multiple-alignment-program</link>
	<title><![CDATA[Cactus: a reference-free whole-genome multiple alignment program]]></title>
	<description><![CDATA[<p>Cactus is a reference-free whole-genome multiple alignment program. The principal algorithms are described here:&nbsp;<a href="https://doi.org/10.1101/gr.123356.111">https://doi.org/10.1101/gr.123356.111</a></p>
<p><span>Cactus uses substantial resources. For primate-sized genomes (3 gigabases each), you should expect Cactus to use approximately 120 CPU-days of compute per genome, with about 120 GB of RAM used at peak. The requirements scale roughly quadratically, so aligning two 1-megabase bacterial genomes takes only 1.5 CPU-hours and 14 GB RAM.</span>&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/ComparativeGenomicsToolkit/cactus" rel="nofollow">https://github.com/ComparativeGenomicsToolkit/cactus</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42357/irscope-an-online-program-to-visualize-the-junction-sites-of-chloroplast-genomes</guid>
	<pubDate>Wed, 25 Nov 2020 19:44:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42357/irscope-an-online-program-to-visualize-the-junction-sites-of-chloroplast-genomes</link>
	<title><![CDATA[IRscope: an online program to visualize the junction sites of chloroplast genomes]]></title>
	<description><![CDATA[<p><span>eMPRess, a software program for phylogenetic tree reconciliation under the duplication-transfer-loss model that systematically addresses the problems of choosing event costs and selecting representative solutions, enabling users to make more robust inferences.</span></p><p>Address of the bookmark: <a href="https://sites.google.com/g.hmc.edu/empress/home" rel="nofollow">https://sites.google.com/g.hmc.edu/empress/home</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/871/postdoctoral-position-in-bioinformatics-sweden</guid>
  <pubDate>Sun, 14 Jul 2013 13:49:57 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoctoral position in bioinformatics @ Sweden]]></title>
  <description><![CDATA[
<p>Information about the department<br />The Department of Mathematical Sciences at Chalmers University of Technology and the University of Gothenburg has about 170 faculty and staff and is the largest department of mathematical sciences in the Nordic countries. The department belongs to both Chalmers University of Technology and the University of Gothenburg (for more information see http://www.chalmers.se/math/).</p>

<p>Job description<br />We are looking for a motivated, self-driven post-doctoral researcher to work with large-scale sequence data analysis. The position is for 24 months and located at Mathematical Statistics, Department of Mathematical Sciences in Erik Kristiansson’s research group. We are focused on methods development for and analysis of next generation DNA sequencing, in particular comparative metagenomics and gene expression analysis (RNA-seq). We have strong interdisciplinary profile and are actively collaborating with several experimental groups, especially within the environmental sciences, ecology, infectious diseases and cancer genomics. More information is available at http://bioinformatics.math.chalmers.se.</p>

<p>The Post-doctoral position is an appointment that offers an opportunity to qualify for further research positions within academia or industry. The majority of your working time is devoted to your own research, normally as a member of a research group. Included in your work is also to take part in supervision of Ph.D. students and M.Sc thesis students. Teaching of undergraduate students may also be included to a small extent.</p>

<p>The employment is limited to a maximum of 2 years (1+1).</p>

<p>Qualifications<br />The applicant should have Ph.D. degree preferably in bioinformatics, mathematics, statistics, computer science or equivalent by the start of the appointment. Experience from analysis of large-scale data, in particular from next generation DNA sequencing, is highly valued. The applicant should also be proficient in programming (e.g. Python/Java/C) and comfortable with Unix/Linux systems. Interaction with experimental biologists is central and good collaborative skills are therefore important. Fluency in written and spoken English is a strong requirement. As a post-doctoral researcher you are expected to work independently and to be able to supervise/co-supervise PhD and Master’s students.</p>

<p>Application procedure<br />The application should be marked with Ref 20130126 and written in English. The application should be sent electronically via Chalmers webpage.</p>

<p>Application deadline: September 8, 2013.</p>

<p>For questions, please contact: <br />Ass prof. Erik Kristiansson, Matematiska Vetenskaper, erik.kristiansson@chalmers.se, +46 31-772 3521, +46 70-5259751.</p>

<p>Chalmers continuously strive to be an attractive employer. Equality and diversity are substantial foundations in all activities at Chalmers.</p>
]]></description>
</item>

</channel>
</rss>