<?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/32376?offset=890</link>
	<atom:link href="https://bioinformaticsonline.com/related/32376?offset=890" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37645/lsc-improving-pacbio-long-read-accuracy-by-short-read-alignment</guid>
	<pubDate>Thu, 06 Sep 2018 16:27:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37645/lsc-improving-pacbio-long-read-accuracy-by-short-read-alignment</link>
	<title><![CDATA[LSC: Improving PacBio Long Read Accuracy by Short Read Alignment]]></title>
	<description><![CDATA[<ul>
<li>Added Command line argument support.</li>
<li>Multi-stage execution modes.</li>
<li>Support for parallelization. Now execution proceeds in batches of long reads the size of which can be set by --long_read_batch_size N.</li>
<li>Better compressed intermediate files.</li>
<li>Added utilities folder.</li>
<li>Added support for multiple short read files.</li>
<li>Removed use of configuration file.</li>
</ul><p>Address of the bookmark: <a href="https://www.healthcare.uiowa.edu/labs/au/LSC/" rel="nofollow">https://www.healthcare.uiowa.edu/labs/au/LSC/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30889/phd-program-in-computer-science-at-university-of-essex</guid>
  <pubDate>Sat, 11 Feb 2017 13:11:36 -0600</pubDate>
  <link></link>
  <title><![CDATA[PhD program in Computer Science at University of Essex]]></title>
  <description><![CDATA[
<p>As part of the PhD program in Computer Science at University of Essex, I am looking for a PhD student in computational and synthetic biology.<br />The ideal candidate is interested in designing new biological design automation methods for genome scale projects and/or network modelling of genomic, transcriptomic and proteomic data.<br />Candidates interested in developing optimization algorithms for biological problems are encouraged to apply as well.<br />A summary of the research work in the lab can be found on o this page.</p>

<p>Candidates interested in the position should contact me in advance by email to: g.stracquadanio@essex.ac.uk</p>

<p>The deadline for the application is 28/02/2017; info about the application can be found on the Essex CSEE website.</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43799/kast</guid>
	<pubDate>Wed, 23 Feb 2022 08:28:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43799/kast</link>
	<title><![CDATA[KAST]]></title>
	<description><![CDATA[<p><span>Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.</span></p><p>Address of the bookmark: <a href="https://github.com/martinjvickers/KAST" rel="nofollow">https://github.com/martinjvickers/KAST</a></p>]]></description>
	<dc:creator>Neel</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/bookmarks/view/31123/biodownloader</guid>
	<pubDate>Sat, 25 Feb 2017 17:52:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31123/biodownloader</link>
	<title><![CDATA[BioDownloader]]></title>
	<description><![CDATA[<p><strong><em>BioDownloader</em></strong> is a program for downloading and/or updating files from ftp/http servers. The program has unique features that are specifically designed to deal with bioinformatics data files and servers:</p>
<ul>
<li>optimized to work with vast amount of data and very large file sets (~ 10,000 - 100,000).</li>
<li>allows the selective retrieval of only the required files (file masks, ls-lR parsing, recursive search, updates)</li>
<li>has a built-in repository containing the settings for the most common bioinformatics download needs</li>
<li>built-in wizard for batch post-processing of downloaded files (archive extraction, file conversion, etc.)</li>
<li>capable of performing multiple download or update tasks simultaneously</li>
</ul>
<p>BioDownloader has a built-in repository containing the settings for common bioinformatics file-synchronization needs, including the Protein Data Bank (PDB) and National Center for Biotechnology Information (NCBI) databases. It can post-process downloaded files, including archive extraction and file conversions.</p>
<p>http://dunbrack.fccc.edu/BioDownloader/</p><p>Address of the bookmark: <a href="http://dunbrack.fccc.edu/BioDownloader/" rel="nofollow">http://dunbrack.fccc.edu/BioDownloader/</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34038/quota-synteny-alignment</guid>
	<pubDate>Mon, 31 Jul 2017 04:11:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34038/quota-synteny-alignment</link>
	<title><![CDATA[Quota synteny alignment]]></title>
	<description><![CDATA[<p><span>Typically in comparative genomics, we can identify anchors, chain them into syntenic blocks and interpret these blocks as derived from a common descent. However, when comparing two genomes undergone ancient genome duplications (plant genomes in particular), we have large number of blocks that are not orthologous, but are paralogous. This has forced us sometimes to use&nbsp;</span><em>ad-hoc</em><span>&nbsp;rules to screen these blocks. So the question is:&nbsp;</span><span>given the expected depth (quota) along both x- and y-axis, select a subset of the anchors with maximized total score</span><span>.</span></p><p>Address of the bookmark: <a href="https://github.com/tanghaibao/quota-alignment" rel="nofollow">https://github.com/tanghaibao/quota-alignment</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31209/dial</guid>
	<pubDate>Wed, 01 Mar 2017 08:42:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31209/dial</link>
	<title><![CDATA[DIAL]]></title>
	<description><![CDATA[<p>A computational pipeline for identifying single-base substitutions between two closely related genomes without the help of a reference genome. DIAL works even when the depth of coverage is insufficient for de novo assembly, and it can be extended to determine small insertions/deletions. Our main motivation is to use this tool to survey the genetic diversity of endangered species as the identified sequence differences can be used to design genotyping arrays to assist in the species' management.</p>
<p>http://www.bx.psu.edu/~ratan/</p><p>Address of the bookmark: <a href="http://www.bx.psu.edu/miller_lab/" rel="nofollow">http://www.bx.psu.edu/miller_lab/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34571/mugsy-multiple-whole-genome-alignment-tool</guid>
	<pubDate>Fri, 08 Dec 2017 17:41:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34571/mugsy-multiple-whole-genome-alignment-tool</link>
	<title><![CDATA[Mugsy: multiple whole genome alignment tool]]></title>
	<description><![CDATA[<p><span>Mugsy is a multiple whole genome aligner. Mugsy uses Nucmer for pairwise alignment, a custom graph based segmentation procedure for identifying collinear regions, and the segment-based progressive multiple alignment strategy from Seqan::TCoffee. Mugsy accepts draft genomes in the form of multi-FASTA files and does not require a reference genome.</span></p>
<p>To cite Mugsy, use:</p>
<p>Angiuoli SV and Salzberg SL.&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/27/3/334">Mugsy: Fast multiple alignment of closely related whole genomes.</a><em>Bioinformatics</em>&nbsp;2011 27(3):334-4</p><p>Address of the bookmark: <a href="http://mugsy.sourceforge.net/" rel="nofollow">http://mugsy.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31156/splitbam-splits-a-bam-by-chromosomes</guid>
	<pubDate>Tue, 28 Feb 2017 09:01:28 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31156/splitbam-splits-a-bam-by-chromosomes</link>
	<title><![CDATA[splitbam: splits a BAM by chromosomes]]></title>
	<description><![CDATA[<p><strong>splitbam</strong>&nbsp;splits a BAM by chromosomes.</p>
<p>Using the reference sequence dictionary (<code>*.dict</code>), it also creates some empty BAM files if no sam record was found for a chromosome. A pair of 'mock' SAM-Records can also be added to those empty BAMs to avoid some tools (like samtools) to crash.</p>
<h1>Usage</h1>
<p><code>java -jar splitbam.jar -p OUT/__CHROM__/__CHROM__.bam -R ref.fasta (bam|sam|stdin)</code></p>
<h1>Options</h1>
<ul>
<li>-h help; This screen.</li>
<li>-R (indexed reference file) REQUIRED.</li>
<li>-u (unmapped chromosome name): default:Unmapped</li>
<li>-e | --empty : generate EMPTY bams for chromosome having no read mapped</li>
<li>-m | --mock : if option '-e', add a mock pair of sam records to the empty bam</li>
<li>-p (output file/bam pattern) REQUIRED. MUST contain&nbsp;<strong><code>__CHROM__</code></strong>&nbsp;and end with .bam</li>
<li>-s assume input is sorted.</li>
<li>-x | --index create index.</li>
<li>-t | --tmp (dir) tmp file directory</li>
<li>-G (file) chrom-group file (see below)</li>
</ul><p>Address of the bookmark: <a href="https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki" rel="nofollow">https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36512/hisat2-a-fast-and-sensitive-alignment-program-for-mapping-next-generation-sequencing-reads</guid>
	<pubDate>Tue, 08 May 2018 04:27:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36512/hisat2-a-fast-and-sensitive-alignment-program-for-mapping-next-generation-sequencing-reads</link>
	<title><![CDATA[HISAT2: a fast and sensitive alignment program for mapping next-generation sequencing reads]]></title>
	<description><![CDATA[<p><strong>HISAT2</strong><span>&nbsp;is a fast and sensitive alignment program for mapping next-generation sequencing reads (both DNA and RNA) to a population of human genomes (as well as to a single reference genome). Based on an extension of BWT for graphs&nbsp;</span><a href="http://dl.acm.org/citation.cfm?id=2674828">[Sir&eacute;n et al. 2014]</a><span>, we designed and implemented a graph FM index (GFM), an original approach and its first implementation to the best of our knowledge. In addition to using one global GFM index that represents a population of human genomes, HISAT2 uses a large set of small GFM indexes that collectively cover the whole genome (each index representing a genomic region of 56 Kbp, with 55,000 indexes needed to cover the human population). These small indexes (called local indexes), combined with several alignment strategies, enable rapid and accurate alignment of sequencing reads. This new indexing scheme is called a Hierarchical Graph FM index (HGFM).&nbsp;</span></p>
<p><span>more at&nbsp;https://ccb.jhu.edu/software/hisat2/index.shtml</span></p><p>Address of the bookmark: <a href="https://github.com/infphilo/hisat2" rel="nofollow">https://github.com/infphilo/hisat2</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>