<?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=450</link>
	<atom:link href="https://bioinformaticsonline.com/related/42559?offset=450" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29995/hga</guid>
	<pubDate>Tue, 29 Nov 2016 07:25:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29995/hga</link>
	<title><![CDATA[HGA]]></title>
	<description><![CDATA[<p>HGA tool version 1.0 This tool helps to apply the Hierarchical Genome Assembly (HGA) method. The tool will apply: 1. Partitioning a given reads dataset into a given number of partitions. 2. Assembling each partitions using a pre-specified assembler (Velvet or SPAdes in this version) and using a given kmer size. 3. Merging all the assemblies of the partition. 4. Combining all the assemblies of the partition (using velvet with kmer value of 31). 5. Finaly, re-assembling the whole dataset with the merged contigs or the combined contigs, using a given kmer size.</p>
<p>https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA</p><p>Address of the bookmark: <a href="https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA" rel="nofollow">https://github.com/aalokaily/Hierarchical-Genome-Assembly-HGA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32633/a-post-assembly-genome-improvement-toolkit-pagit-to-obtain-annotated-genomes-from-contigs</guid>
	<pubDate>Fri, 12 May 2017 10:50:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32633/a-post-assembly-genome-improvement-toolkit-pagit-to-obtain-annotated-genomes-from-contigs</link>
	<title><![CDATA[A Post-assembly genome-improvement toolkit (PAGIT) to obtain annotated genomes from contigs]]></title>
	<description><![CDATA[<p>PAGIT addresses the need for software to generate high quality draft genomes. It is based on a series of programs that we developed:</p>
<p><a href="https://sourceforge.net/projects/abacas/files/">ABACAS</a>, that is able to contiguate contigs from a de novo assembly against a closely related reference.</p>
<p><a href="https://sourceforge.net/projects/image2/files/">IMAGE</a>, an iterative approach for closing gaps in assembled genomes using mate pair information. It is able to close gaps left open by the assembler in a draft genome, even when using the same data sets as used by the original assembler.</p>
<p><a href="http://icorn.sourceforge.net/">iCORN</a>, that enables errors in the consensus sequence to be corrected by iteratively mapping reads to the current assembly. An improved version, especially correction Pacfic Bioscience assemblies (PacBio) can be found&nbsp;<a href="ftp://ftp.sanger.ac.uk/pub4/resources/software/pagit/ICORN2/icorn2.V0.95.tgz">here</a>.</p>
<p><a href="https://ratt.svn.sourceforge.net/svnroot/ratt">RATT</a>, a tool to transfer the annotation from a reference genome, or an earlier assembly, onto the latest assembly.</p>
<p>PAGIT bundles these software and makes them more accessible for users.</p><p>Address of the bookmark: <a href="http://www.sanger.ac.uk/science/tools/pagit" rel="nofollow">http://www.sanger.ac.uk/science/tools/pagit</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34720/meraculous-haplotype-sensitive-assembly-of-highly-heterozygous-genomes</guid>
	<pubDate>Wed, 20 Dec 2017 18:59:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34720/meraculous-haplotype-sensitive-assembly-of-highly-heterozygous-genomes</link>
	<title><![CDATA[Meraculous: Haplotype-sensitive Assembly of Highly Heterozygous genomes.]]></title>
	<description><![CDATA[<p><span>Meraculous is a whole genome assembler for Next Generation Sequencing data geared for large genomes. It is a hybrid k-mer/read-based assembler that capitalizes on the high accuracy of Illumina sequence by eschewing an explicit error correction step which we argue to be redundant with the assembly process. Meraculous achieves high performance with large datasets by utilizing lightweight data structures and multi-threaded parallelization, allowing to assemble human-sized genomes on commodity clusters in under a day. The process pipeline implements a highly transparent and portable model of job control and monitoring where different assembly stages can be executed and re-executed separately or in unison on a wide variety of architectures.</span></p>
<p><span>https://jgi.doe.gov/data-and-tools/meraculous/</span></p>
<p><span>https://arxiv.org/ftp/arxiv/papers/1703/1703.09852.pdf</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/meraculous20/" rel="nofollow">https://sourceforge.net/projects/meraculous20/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36476/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads</guid>
	<pubDate>Fri, 04 May 2018 19:16:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36476/flye-fast-and-accurate-de-novo-assembler-for-single-molecule-sequencing-reads</link>
	<title><![CDATA[Flye: Fast and accurate de novo assembler for single molecule sequencing reads]]></title>
	<description><![CDATA[<p><span>Flye is a de novo assembler for long and noisy reads, such as those produced by PacBio and Oxford Nanopore Technologies. The algorithm uses an A-Bruijn graph to find the overlaps between reads and does not require them to be error-corrected. After the initial assembly, Flye performs an extra repeat classification and analysis step to improve the structural accuracy of the resulting sequence. The package also includes a polisher module, which produces the final assembly of high nucleotide-level quality.</span></p><p>Address of the bookmark: <a href="https://github.com/fenderglass/Flye" rel="nofollow">https://github.com/fenderglass/Flye</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36837/ranbow-a-haplotype-assembler-for-polyploid-genomes</guid>
	<pubDate>Fri, 01 Jun 2018 07:21:54 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36837/ranbow-a-haplotype-assembler-for-polyploid-genomes</link>
	<title><![CDATA[Ranbow: a haplotype assembler for polyploid genomes]]></title>
	<description><![CDATA[Ranbow is a haplotype assembler for polyploid genomes. It has been developed for the haplotype assembly of the hexaploid sweet potato genome, which is highly heterozygous. Ranbow can also be applied to other polyploid genomes. After a first phasing, Ranbow utilizes the assembled haplotypes to improve the accuracy of variant calling results and to infer the evolutionary history of the organism´s genome. Ranbow has three main modes of function:

ranbow hap: for haplotyping
ranbow eval: for evaluating of the assemble haplotypes by gold standard (long) reads 
ranbow phylo: for the phylogenetic analysis<p>Address of the bookmark: <a href="https://www.molgen.mpg.de/ranbow" rel="nofollow">https://www.molgen.mpg.de/ranbow</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm</guid>
	<pubDate>Mon, 16 Mar 2020 10:09:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm</link>
	<title><![CDATA[Apollo: A Sequencing-Technology-Independent, Scalable, and Accurate Assembly Polishing Algorithm]]></title>
	<description><![CDATA[<p><span>Apollo is an assembly polishing algorithm that attempts to correct the errors in an assembly. It can take multiple set of reads in a single run and polish the assemblies of genomes of any size. Described by Firtina et al. (preliminary version at&nbsp;</span><a href="https://arxiv.org/pdf/1902.04341.pdf">https://arxiv.org/pdf/1902.04341.pdf</a></p>
<p>More at&nbsp;<a href="https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1">https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1</a></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/Apollo" rel="nofollow">https://github.com/CMU-SAFARI/Apollo</a></p>]]></description>
	<dc:creator>BioStar</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>