<?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/2042?offset=190</link>
	<atom:link href="https://bioinformaticsonline.com/related/2042?offset=190" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27333/satsuma-highly-sensitive-whole-genome-synteny-alignments</guid>
	<pubDate>Fri, 13 May 2016 05:25:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27333/satsuma-highly-sensitive-whole-genome-synteny-alignments</link>
	<title><![CDATA[SATSUMA : Highly sensitive whole-genome synteny alignments.]]></title>
	<description><![CDATA[<p>Satsuma is a whole-genome synteny alignment program. It takes two genomes, computes alignments, and then keeps only the parts that are orthologous, i.e. following the conserved order and orientation of features, such as protein coding genes, non-coding genes, or neutral sequences. Satsuma does not require any pre-processing, such as repeat masking, since it will automatically detect ambiguous mappings.<br> <br> Satsuma has parallelization built-in and is designed to run on multi-core architectures. The run-time for aligning two bird-size genomes (~1.2 Gb) is around two days on 24 CPUs. <br> <br> You can find the manual <a href="http://satsuma.sourceforge.net/manual.html">here</a>.<br> Download the latest source code from <a href="https://sourceforge.net/projects/satsuma/">here.</a><br> Stable versions can also be downloaded from the <a href="https://www.broadinstitute.org/science/programs/genome-biology/spines">Broad Institute's</a> web site.<br> <br> An incomplete list of questions and answers (yes, these have really been asked by our users! Please feel free to add your own by e-mailing us) is <a href="http://satsuma.sourceforge.net/faq.html">here</a>.<br> <br> If you use Satsuma in your research, please cite:<br> <a href="http://bioinformatics.oxfordjournals.org/content/26/9/1145.long">Grabherr, M. G., Russell, P., Meyer, M., Mauceli, E., Alf&ouml;ldi, J., Di Palma, F., &amp; Lindblad-Toh, K. (2010). Genome-wide synteny through highly sensitive sequence alignment: Satsuma. Bioinformatics, 26(9), 1145-51</a>.</p>
<p><strong>Tutorial at http://evomics.org/learning/genomics/satsuma/</strong></p><p>Address of the bookmark: <a href="http://satsuma.sourceforge.net/" rel="nofollow">http://satsuma.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27438/hagfish-assess-an-assembly-through-creative-use-of-coverage-plots</guid>
	<pubDate>Fri, 20 May 2016 19:08:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27438/hagfish-assess-an-assembly-through-creative-use-of-coverage-plots</link>
	<title><![CDATA[Hagfish - assess an assembly through creative use of coverage plots]]></title>
	<description><![CDATA[<p>Hagfish is a tool that is to be used in data analysis of Next Generation Sequencing (NGS) experiments. Hagfish builds on the concept of coverage plots and aims to assist (amongst others) in quality control of&nbsp;<em style="font-size: 12.8px;">de novo</em>&nbsp;genome assembly or identification of structural variation in a genome re-sequencing experiment.</p>
<p>Hagfish requires a reference sequence and a&nbsp;<span>paired end</span>&nbsp;re-sequencing data set. Hagfish has more power the larger the insert size of the paired end library is.</p>
<p>Quick links:&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Install">Installation</a>,<a href="https://github.com/mfiers/hagfish/wiki/Operation">Operation</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/ReadMappers">Read mappers</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Scripts">Hagfish scripts</a>,&nbsp;<a href="https://github.com/mfiers/hagfish/wiki/Plots">Hagfish plots</a></p><p>Address of the bookmark: <a href="https://github.com/mfiers/hagfish" rel="nofollow">https://github.com/mfiers/hagfish</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27440/stampy</guid>
	<pubDate>Fri, 20 May 2016 19:13:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27440/stampy</link>
	<title><![CDATA[Stampy]]></title>
	<description><![CDATA[<p><strong>Stampy&nbsp;</strong><span>is a package for the mapping of short reads from illumina sequencing machines onto a reference genome. It's recommended for most workflows, including those for genomic resequencing, RNA-Seq and Chip-seq. Stampy excels in the mapping of reads containing that contain sequence variation relative to the reference, in particular for those containing insertions or deletions.</span></p><p>Address of the bookmark: <a href="http://www.well.ox.ac.uk/project-stampy" rel="nofollow">http://www.well.ox.ac.uk/project-stampy</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<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/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/27971/samtools-primer</guid>
	<pubDate>Thu, 23 Jun 2016 07:18:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27971/samtools-primer</link>
	<title><![CDATA[Samtools Primer !!]]></title>
	<description><![CDATA[<p>SAMtools: Primer / Tutorial by Ethan Cerami, Ph.D.<br><br>keywords: samtools, next-gen, next-generation, sequencing, bowtie, sam, bam, primer, tutorial, how-to, introduction<br>Revisions<br><br>&nbsp;&nbsp;&nbsp; 1.0: May 30, 2013: First public release on biobits.org.<br>&nbsp;&nbsp;&nbsp; 1.1: July 24, 2013: Updated with Disqus Comments / Feedback section.<br>&nbsp;&nbsp;&nbsp; 1.2: December 19, 2014: Multiple updates, including:<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Updated to use samtools 1.1 and bcftools 1.2.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Updated usage for bcftools.<br><br>About<br><br>SAMtools is a popular open-source tool used in next-generation sequence analysis. This primer provides an introduction to SAMtools, and is geared towards those new to next-generation sequence analysis. The primer is also designed to be self-contained and hands-on, meaning that you only need to install SAMtools, and no other tools, and sample data sets are provided. Terms in bold are also explained in the glossary at the end of the document.</p><p>Address of the bookmark: <a href="http://biobits.org/samtools_primer.html" rel="nofollow">http://biobits.org/samtools_primer.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/28112/ngs-glossary</guid>
	<pubDate>Mon, 27 Jun 2016 08:56:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/28112/ngs-glossary</link>
	<title><![CDATA[NGS Glossary !!]]></title>
	<description><![CDATA[<p><strong>alignment</strong>: the mapping of a raw sequence read to a location within a reference genome. The mapping occurs because the sequences within the raw read match or align to sequences within the reference genome. Alignment information is stored in the <strong>SAM</strong> or <strong>BAM</strong> file formats.</p><p><strong>bcftools</strong>: a set of companion tools, currently bundled with SAMtools, for identifying and filtering genomics variants.</p><p><strong>bowtie</strong>: widely used, open source alignment software for aligning raw sequence reads to a reference genome.</p><p><strong>BAM Format</strong>: binary, compressed format for storing <strong>SAM</strong> data.</p><p><strong>BCF Format</strong>: Binary call format. Binary, compressed format for storing <strong>VCF</strong> data.</p><p><strong>CIGAR String</strong>: Compact Idiosyncratic Gapped Alignment Report. A compact string that (partially) summarizes the alignment of a raw sequence read to the reference genome. Three core abbreviations are used: M for alignment match; I for insertion; and D for Deletion. For example, a CIGAR string of 5M2I63M indicates that the first 5 base pairs of the read align to the reference, followed by 2 base pairs, which are unique to the read, and not in the reference genome, followed by an additional 63 base pairs of alignment.</p><p><strong>FASTA Format</strong>: text format for storing raw sequence data. For example, the FASTA file at: <a href="http://www.ncbi.nlm.nih.gov/nuccore/NC_008253">http://www.ncbi.nlm.nih.gov/nuccore/NC_008253</a> contains entire genome for Escherichia coli 536.</p><p><strong>FASTQ Format</strong>: text format for storing raw sequence data along with quality scores for each base; usually generated by sequencing machines.</p><p><strong>genotype likelihood</strong>: the probability that a specific genotype is present in the sample of interest. Genotype likelihoods are usually expressed as a <strong>Phred-scaled probability</strong>, where P = 10 ^ (-Q/10). For example, if the genotype TT (both alleles are T) at position 1,299,132 in human chromosome 12 (reference G) is 37, this translates to a probability of 10<sup>-37/10</sup> = 0.0001995, meaning that there is very low probability that the reads in your sample support a TT genotype. On the other hand, a genotype of AA at the same position with a score of 0 translates into a probability of 10<sup>-0</sup> = 1, indicating extremely high probability that your sample contains a homozygous mutation of G to A.</p><p><strong>mate-pair</strong>: in paired-end sequencing, both ends of a single DNA or RNA fragment are sequenced, but the intermediate region is not. The two ends which are sequenced form a pair, and are frequently referred to as mate-pairs.</p><p><strong>QNAME</strong>: unique identifier of a raw sequence read (also known as the Query Name). Used in <strong>FASTQ</strong> and <strong>SAM</strong> files.</p><p><strong>paired-end sequencing</strong>: sequencing process where both ends of a single DNA or RNA fragment are sequenced, but the intermediate region is not. Particularly useful for identifying structural rearrangements, including gene fusions.</p><p><strong>Phred-scaled probability</strong>: a scaled value (Q) used to compactly summarize a probability, where P = 10<sup>-Q/10</sup>. For example, a Phred Q score of 10 translates to probability (P) = 10<sup>-10/10</sup> = 0.1. Phred-scaled probabilities are common in next-generation sequencing, and are used to represent multiple types of quality metrics, including quality of base calls, quality of mappings, and probabilities associated with specific genotypes. The name Phred refers to the original Phred base-calling software, which first used and developed the scale.</p><p><strong>Phred quality score</strong>: a score assigned to each base within a sequence, quantifying the probability that the base was called incorrectly. Scores use a <strong>Phred-scaled probability</strong> metric. For example, a Phred Q score of 10 translates to P=10<sup>-10/10</sup> = 0.1, indicating that the base has a 0.1 probability of being incorrect. Higher Phred score correspond to higher accuracy. In the <strong>FASTQ format</strong>, Phred scores are represented as single ASCII letters. For details on translating between Phred scores and ASCII values, refer to <a href="http://www.somewhereville.com/?p=1508">Table 1 of this useful blog post from Damian Gregory Allis</a>.</p><p><strong>read-length</strong>: the number of base pairs that are sequenced in an individual sequence read.</p><p><strong>read-depth</strong>: the number of sequence reads that pile up at the same genomic location. For example, 30X read-depth coverage indicates that the genomic location is covered by 30 independent sequencing reads. Increased read-depth translates into higher confidence for calling genomic variants.</p><p><strong>RNAME</strong>: reference genome identifier (also known as the Reference Name). Within a SAM formatted file, the RNAME identifies the reference genome where the raw read aligns.</p><p><strong>SAM Flag</strong>: a single integer value (e.g. 16), which encodes multiple elements of meta-data regarding a read and its alignment. Elements include: whether the read is one part of a paired-end read, whether the read aligns to the genome, and whether the read aligns to the forward or reverse strand of the genome. A <a href="http://picard.sourceforge.net/explain-flags.html">useful online utility</a> decodes a single SAM flag value into plain English.</p><p><strong>SAM Format</strong>: Text file format for storing sequence alignments against a reference genome. See also <strong>BAM</strong> Format.</p><p><strong>SAMtools</strong>: widely used, open source command line tool for manipulating SAM/BAM files. Includes options for converting, sorting, indexing and viewing SAM/BAM files. The SAMtools distribution also includes bcftools, a set of command line tools for identifying and filtering genomics variants. Created by <a href="http://lh3lh3.users.sourceforge.net/">Heng Li</a>, currently of the Broad Institute.</p><p><strong>single-read sequencing</strong>: sequencing process where only one end of a DNA or RNA fragment is sequenced. Contrast with <strong>paired-end</strong> sequencing.</p><p><strong>VCF Format</strong>: Variant call format. Text file format for storing genomic variants, including single nucleotide polymorphisms, insertions, deletions and structural rearrangements. See also <strong>BCF</strong> format.</p><p><strong>Next</strong><strong>Generation</strong><strong>Sequencing</strong><br /> A high-throughput sequencing method which parallelizes the sequencing process, producing thousands or millions of sequences at once.</p><p><strong>Deep</strong><strong>Sequencing</strong><br /> Techniques of nucleotide sequence analysis that increase the range, complexity, sensitivity, and accuracy of results by greatly increasing the scale of operations and thus the number of nucleotides, and the number of copies of each nucleotide sequenced.</p><p><strong>Paired-End</strong><strong>Sequencing</strong><br /> Sequence both ends of the same fragment and keep track of the paired data.</p><p><strong>Adapter</strong><br /> Short oligonucleotides which are attached to the DNA to be sequenced. An adapter can provide a priming site for both amplification and sequencing of the adjoining, unknown nucleic acid.</p><p><strong>Library</strong><br /> A collection of DNA fragments with adapters ligated to each end.</p><p><strong>Bridge</strong><strong>Amplification</strong><br /> Generation of in situ copies of a specific DNA molecule on an oligo-decorated solid support.</p><p><strong>Emulsion</strong><strong>PCR</strong><br /> A method for bead-based amplification of a library. A single adapter-bound fragment is attached to the surface of a bead, and an oil emulsion containing necessary amplification reagents is formed around the bead/fragment component. Parallel amplification of millions of beads with millions of single strand fragments produces a sequencer-ready library.</p><p><strong>Alignment</strong><br /> Mapping of sequence reads to a known reference sequence</p><p><strong>Reference</strong><strong>sequence</strong><strong>/</strong><strong>genome</strong><strong>&nbsp; </strong><br /> A fully assembled version of a genome that can be used for mapping short DNA sequence reads for comparisons of genomes from various individuals</p><p><strong>Coverage</strong><strong>Depth</strong><br /> The number of nucleotides from reads that are mapped to a given position of reference genome.</p><p><strong>Specificity</strong><strong>&nbsp; </strong><br /> The percentage of sequences that map to the intended targets out of total bases per run.</p><p><strong>Uniformity</strong><strong>&nbsp; </strong><br /> The variability in sequence coverage across target regions.</p><p><strong>Homopolymer</strong><br /> Uninterrupted stretch of a single nucleotide type (e.g., TTT or GGGGGG)</p><p><strong>InDel</strong><br /> InDel stands for Insertion or deletion. A form of structural variation in which a DNA segment is either deleted or inserted.</p><p><strong>SNP</strong><strong>&nbsp; </strong></p><p>SNP stands for Single Nucleotide Polymorphism. A single base difference found when comparing the same DNA sequence from two different individuals.</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28417/wisescaffolder</guid>
	<pubDate>Wed, 13 Jul 2016 08:08:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28417/wisescaffolder</link>
	<title><![CDATA[WiseScaffolder]]></title>
	<description><![CDATA[<p>Function</p>
<p>WiseScaffolder is a stand-alone semi-automatic application for genome scaffolding of pre-assembled contigs using mate-pair data. It also produces editable scaffold maps, allowing either to build gapped scaffolds or usable as a common thread for the manual improvement of scaffolds.</p>
<p>Description&nbsp;</p>
<p>WiseScaffolder includes 4 subcommands: dumpconfig generates a configuration file that notably specifies the average insert size of the mate-pair library preprocess allows the detection and correction of chimerae, the estimation of contigs copy number and produces valuable outputs for the manual improvement of scaffolds scaffold constitutes the central scaffold-builder and comprises two modules:</p>
<p>i) the interative_scaffold_extender, which works with big, unambiguous contigs, or when they run out, single copy contigs, and</p>
<p>ii) the small_contig_inserter, which inserts the small contigs within scaffolds buildfasta converts the scaffold(s) map(s) into Fasta sequences.</p><p>Address of the bookmark: <a href="http://abims.sb-roscoff.fr/wisescaffolder" rel="nofollow">http://abims.sb-roscoff.fr/wisescaffolder</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28884/tgnet</guid>
	<pubDate>Wed, 24 Aug 2016 05:36:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28884/tgnet</link>
	<title><![CDATA[TGNet]]></title>
	<description><![CDATA[<p><span>Recent technological progress has greatly facilitated&nbsp;</span><em>de novo</em><span>&nbsp;genome sequencing. However,&nbsp;</span><em>de novo</em><span>&nbsp;assemblies consist in many pieces of contiguous sequence (contigs) arranged in thousands of scaffolds instead of small numbers of chromosomes. Confirming and improving the quality of such assemblies is critical for subsequent analysis.&nbsp;</span></p>
<p>Visualization and quality assessment of de novo genome assemblies</p>
<p>Citation</p>
<p>This software is fully described in the paper:<br>Riba-Grognuz, Keller, Falquet, Xenarios &amp; Wurm (2011) Visualization and quality assessment of de novo genome assemblies.</p>
<p>In brief, our scripts create Cytoscape files to visualize transcript evidence that suggests adjacency between scaffolds and contigs.</p>
<p>Software requirements</p>
<p>BLAT (tested with Standalone BLAT v. 32&times;1). Source Binaries .<br>Cytoscape (tested with versions 2.7.0, 2.8.2)<br>a UNIX machine (tested on Mac OS X 10.6 and CentOS 4.6)</p><p>Address of the bookmark: <a href="https://github.com/ksanao/TGNet" rel="nofollow">https://github.com/ksanao/TGNet</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28906/gene-finding-and-predictions</guid>
	<pubDate>Fri, 26 Aug 2016 07:26:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28906/gene-finding-and-predictions</link>
	<title><![CDATA[Gene Finding and Predictions]]></title>
	<description><![CDATA[<p><span>In this exercise, a previously annotated gene will be used to measure the accuracy of different gene finding approaches. GRAIL, GENSCAN,&nbsp;</span><tt>geneid</tt><span>, FGENESH, GenomeScan, GrailEXP and GENEWISE will be used to annotate the sequence. Both search by signal, content and homology (protein and cDNA sequences) methods will be employed in order to improve the ab initio results. Weak conservation of Start codons will lead to wrong prediction of initial exons in most cases.</span></p>
<p>http://genome.crg.es/courses/Bioinformatics2003_genefinding/</p><p>Address of the bookmark: <a href="http://genome.crg.es/courses/Bioinformatics2003_genefinding/" rel="nofollow">http://genome.crg.es/courses/Bioinformatics2003_genefinding/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>

</channel>
</rss>