<?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/42559?offset=470</link>
	<atom:link href="https://bioinformaticsonline.com/related/42559?offset=470" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26911/raca-reference-assisted-chromosome-assembly</guid>
	<pubDate>Wed, 06 Apr 2016 09:29:50 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26911/raca-reference-assisted-chromosome-assembly</link>
	<title><![CDATA[RACA: Reference-Assisted Chromosome Assembly]]></title>
	<description><![CDATA[<p>Rreference-Assisted Chromosome Assembly (RACA), an algorithm to reliably order and orient sequence scaffolds generated by NGS and assemblers into longer chromosomal fragments using comparative genome information and paired-end reads.</p>
<p>http://www.ncbi.nlm.nih.gov/pubmed/23307812</p>
<p>http://bioen-compbio.bioen.illinois.edu/RACA/</p><p>Address of the bookmark: <a href="http://bioen-compbio.bioen.illinois.edu/RACA/" rel="nofollow">http://bioen-compbio.bioen.illinois.edu/RACA/</a></p>]]></description>
	<dc:creator>Priya Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26999/discovar</guid>
	<pubDate>Mon, 18 Apr 2016 11:59:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26999/discovar</link>
	<title><![CDATA[DISCOVAR]]></title>
	<description><![CDATA[<p><strong>DISCOVAR</strong> is a new variant caller and <strong>DISCOVAR <em>de novo</em></strong> a new genome assembler, both designed for state-of-the-art data. Their inputs are chosen to optimize quality while keeping costs low. Currently it takes as input Illumina reads of length 250 or longer &mdash; produced on MiSeq or HiSeq 2500 &mdash; and from a single PCR-free library. These data enable a level of completeness and continuity that was not previously possible.</p>
<p><strong>DISCOVAR</strong> can call variants on a region by region basis, potentially tiling an entire large genome. DISCOVAR variant calling is under active development and transitioning to VCF.</p>
<p><strong>DISCOVAR <em>de novo</em></strong> can generate <em>de novo</em> assemblies for both large and small genomes. It currently does not call variants.</p>
<p>More at https://www.broadinstitute.org/software/discovar/blog/?page_id=14</p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/software/discovar/blog/" rel="nofollow">https://www.broadinstitute.org/software/discovar/blog/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27806/blobology</guid>
	<pubDate>Mon, 13 Jun 2016 10:18:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27806/blobology</link>
	<title><![CDATA[Blobology]]></title>
	<description><![CDATA[<p><span>Tools for making blobplots or Taxon-Annotated-GC-Coverage plots (TAGC plots) to visualise the contents of genome assembly data sets as a QC step</span></p>
<p>Blaxter Lab, Institute of Evolutionary Biology, University of Edinburgh</p>
<p><span>Goal</span>: To create blobplots or Taxon-Annotated-GC-Coverage plots (TAGC plots) to visualise the contents of genome assembly data sets as a QC step.</p>
<p>This repository accompanies the paper:<br><span>Blobology: exploring raw genome data for contaminants, symbionts and parasites using taxon-annotated GC-coverage plots.</span>&nbsp;<em>Sujai Kumar, Martin Jones, Georgios Koutsovoulos, Michael Clarke, Mark Blaxter</em><br>(submitted 2013-10-01 to&nbsp;<em>Frontiers in Bioinformatics and Computational Biology special issue : Quality assessment and control of high-throughput sequencing data</em>).</p>
<p>It contains bash/perl/R scripts for running the analysis presented in the paper to create a preliminary assembly, and to create and collate GC content, read coverage and taxon annotation for the preliminary assembly, which can be visualised, such as Figure 2a from the paper showing TAGC plots/blobplots for&nbsp;<em>Caenorhabditis</em>&nbsp;sp. 5:&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/blaxterlab/blobology" rel="nofollow">https://github.com/blaxterlab/blobology</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30012/swalo</guid>
	<pubDate>Wed, 30 Nov 2016 05:06:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30012/swalo</link>
	<title><![CDATA[SWALO]]></title>
	<description><![CDATA[<p>SWALO (scaffolding with assembly likelihood optimization) is a method for scaffolding based on likelihood of genome assemblies computed using generative models for sequencing.</p>
<p><a href="https://atifrahman.github.io/SWALO/swalo-0.9.7-beta.tar.gz"><strong>Download</strong></a></p>
<p><strong>Git repository of SWALO is at <a href="https://github.com/atifrahman/SWALO">https://github.com/atifrahman/SWALO</a>.</strong></p><p>Address of the bookmark: <a href="https://atifrahman.github.io/SWALO/" rel="nofollow">https://atifrahman.github.io/SWALO/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33856/assembly-course</guid>
	<pubDate>Mon, 10 Jul 2017 09:38:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33856/assembly-course</link>
	<title><![CDATA[Assembly Course]]></title>
	<description><![CDATA[<p>https://ocw.mit.edu/courses/biology/7-91j-foundations-of-computational-and-systems-biology-spring-2014/lecture-slides/MIT7_91JS14_Lecture6.pdf</p><p>Address of the bookmark: <a href="https://ocw.mit.edu/courses/biology/7-91j-foundations-of-computational-and-systems-biology-spring-2014/lecture-slides/MIT7_91JS14_Lecture6.pdf" rel="nofollow">https://ocw.mit.edu/courses/biology/7-91j-foundations-of-computational-and-systems-biology-spring-2014/lecture-slides/MIT7_91JS14_Lecture6.pdf</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36893/beap-blast-extension-and-assembly-program</guid>
	<pubDate>Mon, 11 Jun 2018 04:52:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36893/beap-blast-extension-and-assembly-program</link>
	<title><![CDATA[BEAP: Blast Extension and Assembly Program]]></title>
	<description><![CDATA[The Blast Extension and Assembly Program (BEAP) is a computer program that uses a short starting DNA fragment, often a EST or partial gene segment, as "primer", to recursively blast nucleotide databases in an attempt to obtain all sequences that overlaps, directly or indirectly, with the "primer" therefore help to "extend" the length of the original sequence for constructing a "full length" sequence for functional analysis, or at least to obtain neighboring regions of the segment for SNP discovery and linkage disequilibrium analysis. The confidence of assembling the resulting sequences is achieved by using a known genome, such as human genome, as a reference.
 
https://www.animalgenome.org/tools/beap/<p>Address of the bookmark: <a href="https://www.animalgenome.org/tools/beap/" rel="nofollow">https://www.animalgenome.org/tools/beap/</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/43913/lsugenomics-lab</guid>
  <pubDate>Thu, 07 Jul 2022 05:26:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[lsugenomics Lab]]></title>
  <description><![CDATA[
<p>﻿In our lab, we seek to characterize and to compare genomes in order to better understand genetic and evolutionary processes linking genotypes to phenotypes.  <br /> <br />Sequencing and decoding plant genomes have been integral in our approaches.</p>

<p>The overarching goal of our research is to understand how to interpret complex and fascinating messages embedded in genomes.</p>

<p>https://www.lsugenomics.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34699/biological-file-format-tutorial</guid>
	<pubDate>Sun, 17 Dec 2017 18:13:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34699/biological-file-format-tutorial</link>
	<title><![CDATA[Biological file format tutorial]]></title>
	<description><![CDATA[<p>This section explains some of the commonly used file formats in bioinformatics. The information provided here is basic and designed to help users to distinguish the difference between different formats. Please refer user manual or other information resources on web for more details.</p>
<ol>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_fasta">FASTA</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_fastq">FASTQ</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_sam">SAM</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_bam">BAM</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_vcf">VCF</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_gff">GFF</a></li>
<li><a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/#fileformats_gtf">GTF</a></li>
</ol><p>Address of the bookmark: <a href="https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/" rel="nofollow">https://bioinformatics.uconn.edu/resources-and-events/tutorials/file-formats-tutorial/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/9242/check-the-size-of-a-directory-free-disk-space</guid>
	<pubDate>Mon, 17 Mar 2014 02:35:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/9242/check-the-size-of-a-directory-free-disk-space</link>
	<title><![CDATA[Check the Size of a directory &amp; Free disk space.]]></title>
	<description><![CDATA[<p>The amount of databases we bioinformatician deal are just HUGE &hellip; In such cases, we always need to check our server for free spaces etc. I planned this article to explains 2 simple commands that most bioinformatician want to know when they start using Linux / BioLinux. First: Size of a directory (du) and and second: free disk space that exists on your machine (df).</p><p><br /><strong>'du' &ndash; Check the size of a directory</strong></p><p><br />$ du<br />This command ( du) gives you a list of directories that exist in the current working directory along with their sizes in kilobytes (default). The last line of the output gives you the total size of the current directory including its subdirectories. <br /><br />$ du /home/jin1<br />The above command would give you the directory size of the directory /home/david<br /><br />$ du -h<br />The same &ldquo;du&rdquo;command with some flag gives you a better output than the default one. The option '-h' stands for human readable format. Therefore, in order to print the sizes of the files / directories in your desire notation use this time suffixed with a 'k' if its kilobytes and 'M' if its Megabytes and 'G' if its Gigabytes.<br /><br />$ du -ah<br />If you are interested in checking everything present in a folder use above mentioned command. It gives us not only the directories but also all the files that are present in the current directory. The &ldquo;-a&rdquo; flag displays the filenames along with the directory names in the output. <br /><br />$ du -c<br />This gives you a grand total as the last line of the output. So if your directory occupies 30MB the last 2 lines of the output would be 30M.<br /><br />$ du -s<br />Use this command to displays a summary of the directory size. It is the simplest way to know the total size of the current directory.<br /><br />$ du -S<br />This would display the size of the current directory excluding the size of the subdirectories that exist within that directory. So it basically shows you the total size of all the files that exist in the current directory.<br /><br />$ du --exculde=mp3<br />Several times it required to exclude some directory in our size calculation. In such cases the above command would display the size of the current directory along with all its subdirectories, but it would exclude all the files having the given pattern present in their filenames.</p><p><br /><strong>'df' - finding the disk free space / disk usage</strong><br /><br />$ df<br />Hmmm &hellip; now &ldquo;df&rdquo; command is really useful, and I guess you are going to use it over time. Typing the above command, outputs a table consisting of 6 columns. All the columns are very easy to understand. Remember that the 'Size', 'Used' and 'Avail' columns use kilobytes as the unit. The 'Use%' column shows the usage as a percentage which is also very useful.<br /><br />$ df -h<br />Displays the same output as the previous command but the '-h' indicates human readable format. Hence instead of kilobytes as the unit the output would have 'M' for Megabytes and 'G' for Gigabytes.<br /><br />Example: Linux installed on /dev/hda1<br />$ df -h | grep /dev/hda1</p><p><br />All right, this is not the only option to check the sizes and free spaces but there are a few more options that can be used with 'du' and 'df' . I will discuss it later.<br /><br /></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</guid>
	<pubDate>Tue, 25 Jul 2017 08:48:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</link>
	<title><![CDATA[MGRA: Breakpoint graphs and ancestral genome reconstructions]]></title>
	<description><![CDATA[<p>MGRA (Multiple Genome Rearrangements and Ancestors) is a tool for reconstruction of ancestor genomes and evolutionary history of extant genomes.</p>
<p>It takes as an input a set of genomes represented as sequences of genes (or synteny blocks) and produces such sequences for ancestral genomes at the internal nodes of the phylogenetic tree.</p>
<p>The phylogenetic tree may be also specified completely or partially, in the latter case MGRA can reconstruct conserved ancestral regions (CARs) of the ancestral genome of interest.</p>
<p>Since version 2 MGRA supports gene insertion and deletions in addition to genome rearrangements and allows the input genomes to have different gene content.</p>
<p>It also can reconstruct most plausible phylogenetic tree based on the rearrangement characters.</p><p>Address of the bookmark: <a href="http://mgra.cblab.org/" rel="nofollow">http://mgra.cblab.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>