<?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/28303?offset=260</link>
	<atom:link href="https://bioinformaticsonline.com/related/28303?offset=260" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/27799/bbmapbbtools-package-multipurpose-tool-designed-for-converting-reads-or-other-nucleotide-data-between-different-formats</guid>
	<pubDate>Mon, 13 Jun 2016 05:47:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/27799/bbmapbbtools-package-multipurpose-tool-designed-for-converting-reads-or-other-nucleotide-data-between-different-formats</link>
	<title><![CDATA[BBMap/BBTools package: Multipurpose tool designed for converting reads or other nucleotide data between different formats.]]></title>
	<description><![CDATA[<div id="post_message_148585"><a href="https://sourceforge.net/projects/bbmap/" target="_blank">Reformat</a>is a member of the <a href="https://sourceforge.net/projects/bbmap/" target="_blank">BBMap/BBTools package</a>. It is a multipurpose tool designed for converting reads or other nucleotide data between different formats. It supports, and can inter-convert:<br /> <br /> fastq<br /> fasta<br /> fasta+qual<br /> sam<br /> scarf (an old Illumina format)<br /> bam (if samtools is installed)<br /> gzip<br /> zip<br /> ascii-33 (sanger)<br /> ascii-64 (old Illumina)<br /> paired files<br /> interleaved files<br /> <br /> It is multithreaded and can process data at over 500 megabytes per second, and can accept streams from standard in and write to standard out, allowing it to be easily dropped into the middle of a pipeline for format conversion. Reformat autodetects formats based on file extensions and content, making it very easy to use; and the autodetection can be overridden, allowing flexibility for people who don't like to follow naming conventions, or out-of-spec fastq files with qualities values like -17 or 120.<br /> <br /> The program has been gradually expanded, and can now perform various other functions. None of these will break pairing, if the input is paired.<br /> <br /> Quality trimming (either or both ends)<br /> Quality filtering<br /> Fixed-length trimming<br /> Generation of histograms (base composition, quality, etc)<br /> Subsampling (to a fraction of input reads, or an exact number of reads or bases)<br /> Changing fasta line-wrapping length<br /> Reverse-complementing (all reads or only read 2)<br /> Adding /1 and /2 suffix to read names<br /> GC-content filtering<br /> Length-filtering<br /> Testing for corrupted interleaved files<br /> <br /> Reformat is compatible with any platform that supports Java 1.7 or higher. It also has a bash shellscript for simpler invocation. Typical usage examples:<br /> <br /> Reformat fastq into fasta:<br /> <strong>reformat.sh in=x.fq out=y.fa</strong><br /> <br /> Interleave paired reads:<br /> <strong>reformat.sh in1=x1.fq in2=x2.fq out=y.fq</strong><br /> <br /> Note - you can actually use a shortcut if paired read files have the same name with a 1 and a 2. This is equivalent to the above command:<br /> <strong>reformat.sh in=x#.fq out=y.fq</strong><br /> <br /> De-interleave reads:<br /> <strong>reformat.sh in=x.fq out1=y1.fq out2=y2.fq</strong><br /> <br /> Verify that interleaving appears correct, assuming Illumina namimg conventions:<br /> <strong>reformat.sh in=x.fq vint</strong><br /> <br /> Convert ASCII-33 to ASCII-64:<br /> <strong>reformat.sh in=x.fq out=y.fq qin=33 qout=64</strong><br /> <br /> Quality-trim paired reads to Q10 on the left and right ends and discard reads shorter than 50bp after trimming:<br /> <strong>reformat.sh in1=x1.fq in2=x2.fq out1=y1.fq out2=y2.fq outsingle=singletons.fq qtrim=rl trimq=10 minlength=50</strong><br /> <br /> Subsample 10% of the first 20000 pairs in an interleaved file:<br /> <strong>reformat.sh in=x.fq out=y.fq reads=20000 samplerate=0.1 int=t</strong><br /> (in this case "int=t" overrides interleaving autodetection, to ensure reads are treated as pairs)<br /> <br /> Pipe in a gzipped sam file and pipe out fasta:<br /> <strong>reformat.sh in=stdin.sam.gz out=stdout.fa</strong><br /> <br /> Reverse-complement reads:<br /> <strong>reformat.sh in=x.fq out=y.fq rcomp</strong><br /> <br /> For reformatting a file with very long sequences, Reformat will need more memory; just add the additional flag "-Xmx2g". For example, to change the line-wrapping length on the human genome (which has individual sequences over 200Mbp long) to 70 characters:<br /> <strong>reformat.sh -Xmx2g in=HG19.fa.gz out=HG19_wrapped.fa.gz fastawrap=70</strong><br /> <br /> For additional functions, please run the shellscript with no arguments, or just read it with a text editor. If you have any questions, please post them in this thread.<br /> <br /> For people using a non-bash terminal, you may need to type "bash reformat.sh" instead of just "reformat.sh".<br /> For users of Windows or other platforms that do not support bash shellscripts, replace "reformat.sh" with "java -ea -Xmx200m /path/to/bbmap/current/ jgi.ReformatReads"<br /> for example,<br /> <strong>java -ea -Xmx200m C:\bbmap\current\ jgi.ReformatReads in=x.fq out=y.fa</strong><br /> <br /> Reformat can be downloaded with BBTools here:<br /> <a href="https://sourceforge.net/projects/bbmap/" target="_blank">https://sourceforge.net/projects/bbmap/</a></div>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27821/blobsplorer</guid>
	<pubDate>Tue, 14 Jun 2016 10:28:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27821/blobsplorer</link>
	<title><![CDATA[Blobsplorer]]></title>
	<description><![CDATA[<p>Blobsplorer is a tool for interactive visualization of assembled DNA sequence data ("contigs") derived from (often unintentionally) mixed-species pools. It allows the simultaneous display of GC content, coverage, and taxonomic annotation for collections of contigs with a view to separating out those belonging to different taxa.</p>
<p>Blobsplorer is unlikely to be of use on its own as it requires contig data to be supplied in a format that involves considerable preprocessing (see below for a description). The easiest way to use Blobsplorer is as part of a workflow using scripts from <a href="https://github.com/blaxterlab/blobology">here</a>.</p><p>Address of the bookmark: <a href="http://nematodes.org/martin/blobsplorer/blobsplorer.html" rel="nofollow">http://nematodes.org/martin/blobsplorer/blobsplorer.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27845/cnidaria-fast-reference-free-phylogenomic-clustering</guid>
	<pubDate>Thu, 16 Jun 2016 17:55:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27845/cnidaria-fast-reference-free-phylogenomic-clustering</link>
	<title><![CDATA[CNIDARIA: fast, reference-free phylogenomic clustering]]></title>
	<description><![CDATA[<p>Motivation: Identification of biological specimens is a major requirement for a range of applications. Reference-free methods analyse unprocessed sequencing data without relying on prior knowledge, but these do not scale to arbitrarily large genomes and arbitrarily large phylogenetic distances.</p>
<p>Results: We present Cnidaria, a practical tool for clustering genomic and transcriptomic data with no limitation on ge-nome size or phylogenetic distances. We successfully simultaneously clustered 169 genomic and transcriptomic datasets from 4 kingdoms, achieving 100% accuracy at supra-species level and 78% accuracy for species level.</p>
<p>Availability and Implementation: Cnidaria is written in C++ and Python and is available at http://www.ab.wur.nl/cnidaria.</p>
<p>Contact: Saulo Aflitos - sauloal@gmail.com</p>
<p>Supplementary information: Supplementary data are available at Bioinformatics online.</p><p>Address of the bookmark: <a href="https://github.com/sauloal/cnidaria/wiki" rel="nofollow">https://github.com/sauloal/cnidaria/wiki</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26380/hicdat</guid>
	<pubDate>Fri, 12 Feb 2016 05:23:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26380/hicdat</link>
	<title><![CDATA[HiCdat]]></title>
	<description><![CDATA[<p>HiCdat: a fast and easy-to-use Hi-C data analysis tool</p>
<p>HiCdat is easy-to-use and provides solutions starting from aligned reads up to in-depth analyses. Importantly, HiCdat is focussed on the analysis of larger structural features of chromosomes, their correlation to genomic and epigenomic features, and on comparative studies. It uses simple input and output formats and can therefore easily be integrated into existing workflows or combined with alternative tools.</p>
<p>More at http://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-015-0678-x</p><p>Address of the bookmark: <a href="https://github.com/MWSchmid/HiCdat" rel="nofollow">https://github.com/MWSchmid/HiCdat</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30111/eager</guid>
	<pubDate>Sat, 10 Dec 2016 18:07:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30111/eager</link>
	<title><![CDATA[EAGER]]></title>
	<description><![CDATA[<p><span>The automated reconstruction of genome sequences in ancient genome analysis is a multifaceted process.</span></p>
<p><span>EAGER encompasses both state-of-the-art tools for each step as well as new complementary tools tailored for ancient DNA data within a single integrated solution in an easily accessible format.</span></p>
<p>https://genomebiology.biomedcentral.com/articles/10.1186/s13059-016-0918-z</p><p>Address of the bookmark: <a href="https://github.com/apeltzer/EAGER-GUI" rel="nofollow">https://github.com/apeltzer/EAGER-GUI</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30234/last</guid>
	<pubDate>Mon, 19 Dec 2016 14:07:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30234/last</link>
	<title><![CDATA[LAST]]></title>
	<description><![CDATA[<p>LAST can:</p>
<ul>
<li>Handle&nbsp;<strong>big</strong>&nbsp;sequence data, e.g:
<ul>
<li>Compare two vertebrate genomes</li>
<li>Align billions of DNA reads to a genome</li>
</ul>
</li>
<li>Indicate the&nbsp;<a href="http://lastweb.cbrc.jp/about.html">reliability</a>&nbsp;of each aligned column.</li>
<li>Use sequence quality data&nbsp;<a href="http://nar.oxfordjournals.org/content/38/7/e100.abstract">properly</a>.</li>
<li>Compare DNA to proteins, with frameshifts.</li>
<li>Compare PSSMs to sequences</li>
<li>Calculate the likelihood of chance similarities between random sequences.</li>
<li>Do split and spliced alignment.</li>
<li><a href="http://last.cbrc.jp/doc/last-train.html">Train</a>&nbsp;alignment parameters for unusual kinds of sequence (e.g. nanopore).</li>
</ul><p>Address of the bookmark: <a href="http://last.cbrc.jp/" rel="nofollow">http://last.cbrc.jp/</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/29652/bioistats-ppt</guid>
	<pubDate>Tue, 08 Nov 2016 07:09:01 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/29652/bioistats-ppt</link>
	<title><![CDATA[Bioistats PPT]]></title>
	<description><![CDATA[<p>Basics concepts of&nbsp;Probability: The Study of Randomness</p><p>Biostatistics is the application of statistics to a wide range of topics in biology. The science of biostatistics encompasses the design of biological experiments, especially in medicine, pharmacy, agriculture and fishery; the collection, summarization, and analysis of data from those experiments; and the interpretation of, and inference from, the results. A major branch of this is medical biostatistics, which is exclusively concerned with medicine and health.</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/29652" length="1663809" type="application/pdf" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29683/method-in-comparative-genomics</guid>
	<pubDate>Wed, 09 Nov 2016 16:29:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29683/method-in-comparative-genomics</link>
	<title><![CDATA[Method in Comparative genomics !!]]></title>
	<description><![CDATA[<p>We present methods for the automatic determination of genome correspondence. The algorithms enabled the automatic identification of orthologs for more than 90% of genes and intergenic regions across the four species despite the large number of duplicated genes in the yeast genome. The remaining ambiguities in the gene correspondence revealed recent gene family expansions in regions of rapid genomic change.</p>
<p>We present methods for the identification of protein-coding genes based on their patterns of nucleotide conservation across related species. We observed the pressure to conserve the reading frame of functional proteins and developed a test for gene identification with high sensitivity and specificity. We used this test to revisit the genome of S. cerevisiae, reducing the overall gene count by 500 genes (10% of previously annotated genes) and refining the gene structure of hundreds of genes. We present novel methods for the systematic de novo identification of regulatory motifs. The methods do not rely on previous knowledge of gene function and in that way differ from the current literature on computational motif discovery. Based on the genome-wide conservation patterns of known motifs, we developed three conservation criteria that we used to discover novel motifs. We used an enumeration approach to select strongly conserved motif cores, which we extended and collapsed into a small number of candidate regulatory motifs. These include most previously known regulatory motifs as well as several noteworthy novel motifs. The majority of discovered motifs are enriched in functionally related genes, allowing us to infer a candidate function for novel motifs.</p>
<p>Our results demonstrate the power of comparative genomics to further our understanding of any species. Our methods are validated by the extensive experimental knowledge in yeast, and will be invaluable in the study of complex genomes like that of human.</p><p>Address of the bookmark: <a href="http://web.mit.edu/manoli/www/publications/Kellis_JCB_04.pdf" rel="nofollow">http://web.mit.edu/manoli/www/publications/Kellis_JCB_04.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29992/spines</guid>
	<pubDate>Mon, 28 Nov 2016 05:33:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29992/spines</link>
	<title><![CDATA[Spines]]></title>
	<description><![CDATA[<p><a href="https://www.broadinstitute.org/ftp/distribution/software/spines/"><em>Spines</em></a>&nbsp;is a collection of software tools, developed and used by the Vertebrate Genome Biology Group at the Broad Institute. It provides basic data structures for efficient data manipulation (mostly genomic sequences, alignments, variation etc.), as well as specialized tool sets for various analyses. It also features three sequence alignment packages:&nbsp;<em>Satsuma,</em>&nbsp;a highly parallelized program for high-sensitivity, genome-wide synteny;&nbsp;<em>Papaya,</em>&nbsp;an all-purpose alignment tool for less diverged sequences; and&nbsp;<em>SLAP,</em>&nbsp;a context-sensitive local aligner for diverged sequences with large gaps.</p>
<p>Access&nbsp;<em>Spines</em>&nbsp;<a href="https://www.broadinstitute.org/ftp/distribution/software/spines/">here</a>.</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/genome-sequencing-and-analysis/spines" rel="nofollow">https://www.broadinstitute.org/genome-sequencing-and-analysis/spines</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30557/speedseq</guid>
	<pubDate>Fri, 20 Jan 2017 06:05:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30557/speedseq</link>
	<title><![CDATA[SpeedSeq]]></title>
	<description><![CDATA[<p>A flexible framework for rapid genome analysis and interpretation</p>
<p>C Chiang, R M Layer, G G Faust, M R Lindberg, D B Rose, E P Garrison, G T Marth, A R Quinlan, and I M Hall. SpeedSeq: ultra-fast personal genome analysis and interpretation. Nat Meth (2015). doi:10.1038/nmeth.3505.</p>
<p><a href="http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3505.html">http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3505.html</a></p><p>Address of the bookmark: <a href="https://github.com/hall-lab/speedseq" rel="nofollow">https://github.com/hall-lab/speedseq</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>