<?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/37233?offset=250</link>
	<atom:link href="https://bioinformaticsonline.com/related/37233?offset=250" 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/blog/view/30104/structural-variation-the-hidden-genomic-treasure</guid>
	<pubDate>Sat, 10 Dec 2016 16:19:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/30104/structural-variation-the-hidden-genomic-treasure</link>
	<title><![CDATA[Structural variation: the hidden genomic treasure]]></title>
	<description><![CDATA[<p>Genome re-sequencing projects have revealed substantial amounts of genetic variation between individuals extending beyond single nucleotide polymorphisms (SNPs) and short indels. Structural Variations (SVs) and Copy Number Variations (CNVs) are a major source of genomic variation. However, compared to SNPs, accurate detection, genotyping and understanding of CNVs is lagging behind due to much greater analytical challenges related to SV/CNV detection and analysis. In our lab we analyse SVs/CNVs using high-throughput sequencing and different analytical approaches.&nbsp;The most‐studied structural variants are copy number variations (CNVs) which can be generated by several different mechanisms including non‐allelic homologous recombination, non‐homologous end‐joining and deoxyribonucleic acid (DNA) replication‐related fork stalling and template switching. CNVs are closely related to segmental duplications (SDs): SDs can stimulate the formation of CNVs and themselves started out as CNVs, but became fixed in a species. Structural variation can be neutral but has also influenced our phenotypic evolution, for example our susceptibility to disease and our ability to digest certain types of food. Our understanding of the extent of structural variation is increasing rapidly, but it will be much more difficult to understand its phenotypic consequences.&nbsp;</p><p><img src="http://www.nature.com/nmeth/journal/v9/n2/images/nmeth.1858-F3.jpg" alt="image" width="946" height="603" style="border: 0px; border: 0px;"></p><p>Structural variants (SVs) such as deletions, insertions, duplications, inversions and translocations litter genomes and are often associated with gene expression changes and severe phenotypes (ie. genetic diseases in humans). Recent studies on the functional aspects of different types of SVs have unveiled several cases of adaptive evolution. For example, inversions have been associated with ecological adaptations and may facilitate speciation. Due to their prevalent nature, SVs arguably have a large impact on genome evolution and should not be neglected when studying the genetics of adaptation and speciation.&nbsp;SVs were classically defined as chromosomal rearrangements larger than 1kb, but due to a higher resolution of new detection methods, smaller variants (between 50 and 1000 base pairs) can now be accurately assessed. Besides various methods of detection in next generation sequencing data (paired end mapping, split reads, and depth of coverage), array-based approaches have proven to be particularly useful for detecting copy number variations (CNVs). These technologies have enabled researchers to catalog a wide spectrum of SVs in many organisms and infer the effects of selection shaping their evolutionary trajectories.</p><p><strong>Structure variation sequencing signature (Source: NatRev Genetics)</strong></p><p><img src="http://www.nature.com/nrg/journal/v12/n5/images/nrg2958-f2.jpg" alt="image" width="800" height="824" style="border: 0px; border: 0px;"></p><p>Related tools, databases and publications are listed below. If you know any interesing papers, please let us know in comment section:</p><p><br /><strong>Key concepts</strong></p><p>Structural variation includes balanced variants such as inversions and translocations, and unbalanced ones such as duplications and deletions (copy number variations or CNVs).</p><p>Structural variants can arise by several mechanisms, including nonallelic homologous recombination (NAHR), nonhomologous end‐joining (NHEJ) and DNA replication‐based fork stalling and template switching (FoSTeS).</p><p>CNV is closely linked to segmental duplication, but is not exactly the same. Segmental duplications can stimulate CNV formation by NAHR, and themselves arise from CNVs that have become fixed.</p><p>Segmental duplications did not appear uniformly during the evolution of the Great Ape species, but rather during a burst of activity around the time of the divergence of gorilla from the human/chimpanzee ancestor.</p><p>Duplicated genes play a critical role in the evolution of a genome as they act as &lsquo;spare parts&rsquo; than can evolve to perform new or more specialized functions.</p><p>Effects of structural variation on gene expression can be identified but only a few examples of the consequences for species biology have been documented.</p><p><strong style="font-size: 12.8px;">Tools</strong></p><p><a href="http://sv.gersteinlab.org/cnvnator">CNVnator</a>a tool for CNV discovery and genotyping from depth of read mapping.<a href="http://www.ncbi.nlm.nih.gov/pubmed/21293372">2011a</a>,<a href="http://www.ncbi.nlm.nih.gov/pubmed/21324876">2011b</a></p><p><a href="http://sv.gersteinlab.org/age">AGE</a>a tools that implements an algorithm for optimal alignment of sequences with SVs.<a href="http://www.ncbi.nlm.nih.gov/pubmed/21233167">2011</a></p><p><a href="http://sv.gersteinlab.org/breakseq">BreakSeq</a>a pipeline for annotation, classification and analysis of SVs at single nucleotide resolution.<a href="http://www.ncbi.nlm.nih.gov/pubmed/20037582">2010</a></p><p><a href="http://sv.gersteinlab.org/pemer">PEMer</a>a computational and simulation framework for discovering SVs by paired-end read mapping.<a href="http://www.ncbi.nlm.nih.gov/pubmed/19236709">2009</a>,<a href="http://www.ncbi.nlm.nih.gov/pubmed/17901297">2007</a></p><p>GASV https://code.google.com/archive/p/gasv/</p><p>PAIROSCOPE http://pairoscope.sourceforge.net/</p><p>SVDetect&nbsp;http://svdetect.sourceforge.net/Site/Home.html</p><p>BreakPtr, discovery of unbalanced structural variants (copy-number variants) with tiling microarrays&nbsp;<a href="http://tiling.mbb.yale.edu/BreakPtr/" target="_top">Link</a>&nbsp;</p><p>R Package&nbsp;https://www.bioconductor.org/help/course-materials/2010/EMBL2010/Practical-4-StructuralVariants.pdf<br /><br />BreakSeq, structural variant genotyping using split reads&nbsp;<a href="http://sv.gersteinlab.org/breakseq/" target="_top">Link</a>&nbsp;<br /><br />CopySeq, genotyping of unbalanced structural variants (copy-number variants) using read-depth&nbsp;<a href="http://www.korbel.embl.de/CopySeq/" target="_top">Link</a>&nbsp;<br /><br />DELLY2, integrated structural variant discovery, genotyping and visualization in deep sequencing data&nbsp;<a href="https://github.com/dellytools/delly" target="_top">Link</a>&nbsp;<br /><br />PEMer, structural variant discovery in 454 sequencing data by paired-end mapping&nbsp;<a href="http://www.korbel.embl.de/PEMer/" target="_top">Link</a>&nbsp;<br /><br />TIGER, transduction inference in germline genomes using short read data&nbsp;<a href="https://github.com/jelena-tica/TIGER" target="_top">Link</a>&nbsp;</p><p>MANTA&nbsp;https://github.com/Illumina/manta</p><p>SV-Bay&nbsp;https://github.com/InstitutCurie/SV-Bay</p><p>BreakDancer&nbsp;http://breakdancer.sourceforge.net/</p><p>Variation Hunter&nbsp;http://compbio.cs.sfu.ca/software-variation-hunter</p><p>Lumpy&nbsp;https://github.com/arq5x/lumpy-sv</p><p>ForestSV&nbsp;http://sebatlab.ucsd.edu/index.php/software-data&nbsp;</p><p>PBSuites for long reads&nbsp;https://sourceforge.net/projects/pb-jelly/</p><p><strong>Visualization</strong></p><p>The SV visualization tool:&nbsp;<a href="http://genomesavant.com/savant/">http://genomesavant.com/savant/</a></p><p>InGAP-SV (<a href="http://ingap.sourceforge.net/">http://ingap.sourceforge.net/</a>) that is nice tools for both detection and visualisation of severals kind of structural variations (Large insertions, translocation, deletion, inversions....)&nbsp;</p><p>Tools table: http://www.nature.com/nbt/journal/v29/n8/fig_tab/nbt.1904_T2.html</p><p>Variation Viewer https://www.ncbi.nlm.nih.gov/variation/view/</p><p><strong style="font-size: 12.8px;">Papers</strong></p><p>http://www.nature.com/nmeth/journal/v9/n2/full/nmeth.1858.html</p><p>http://journal.frontiersin.org/researchtopic/1412/structural-variations-in-genomes-ecological-and-evolutionary-implications</p><p>http://www.mi.fu-berlin.de/wiki/pub/ABI/GenomicsLecture10Materials/structural-variation.pdf</p><p>http://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-015-1479-3</p><p>https://www.ncbi.nlm.nih.gov/dbvar/content/overview/</p><p>http://www.nature.com/subjects/structural-variation</p><p>https://eichlerlab.gs.washington.edu/news/NatMeth_Feb2012.pdf</p><p>https://www.ncbi.nlm.nih.gov/pubmed/19477992 ***</p><p>https://www.ncbi.nlm.nih.gov/pubmed/22452995</p><p>http://biorxiv.org/content/early/2016/09/06/073833</p><p>https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4479793/</p><p>http://www.nature.com/articles/srep18501</p><p>http://www.genetics.org/content/202/1/351</p><p>http://www.cs.cmu.edu/~sssykim/teaching/s13/slides/Lecture_SVI.pdf</p><p>https://www.omicsonline.org/open-access/structural-variation-detection-from-next-generation-sequencing-2469-9853-S1-007.php?aid=69055</p><p>http://schatzlab.cshl.edu/presentations/2016/2016.01.12.PAG.Structural%20Variations.pdf</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30236/pyscaf</guid>
	<pubDate>Mon, 19 Dec 2016 14:20:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30236/pyscaf</link>
	<title><![CDATA[pyScaf]]></title>
	<description><![CDATA[<p>pyScaf orders contigs from genome assemblies utilising several types of information:</p>
<ul>
<li>paired-end (PE) and/or mate-pair libraries (<a href="https://github.com/lpryszcz/pyScaf#ngs-based-scaffolding">NGS-based mode</a>)</li>
<li>long reads (<a href="https://github.com/lpryszcz/pyScaf#scaffolding-based-on-long-reads">NGS-based mode</a>)</li>
<li>synteny to the genome of some related species (<a href="https://github.com/lpryszcz/pyScaf#reference-based-scaffolding">reference-based mode</a>)</li>
</ul>
<p>Scaffolding&nbsp;</p>
<p>In reference-based mode, pyScaf uses synteny to the genome of closely related species in order to order contigs and estimate distances between adjacent contigs.</p>
<p>Contigs are aligned globally (end-to-end) onto reference chromosomes, ignoring:</p>
<ul>
<li>matches not satisfying cut-offs (<code>--identity</code>&nbsp;and&nbsp;<code>--overlap</code>)</li>
<li>suboptimal matches (only best match of each query to reference is kept)</li>
<li>and removing overlapping matches on reference.</li>
</ul>
<p>In preliminary tests, pyScaf performed superbly on simulated heterozygous genomes based on&nbsp;<em>C. parapsilosis</em>&nbsp;(13 Mb; CANPA) and&nbsp;<em>A. thaliana</em>&nbsp;(119 Mb; ARATH) chromosomes, reconstructing correctly all chromosomes always for CANPA and nearly always for ARATH (<a href="https://www.dropbox.com/sh/bb7lwggo40xrwtc/AAAZ7pByVQQQ-WhUXZVeJaZVa/pyScaf?dl=0">Figures in dropbox</a>,&nbsp;<a href="https://docs.google.com/spreadsheets/d/1InBExy-qKDLj-upd8tlPItVSKc4mLepZjZxB31ii9OY/edit#gid=2036953672">CANPA table</a>,&nbsp;<a href="https://docs.google.com/spreadsheets/d/1InBExy-qKDLj-upd8tlPItVSKc4mLepZjZxB31ii9OY/edit#gid=1920757821">ARATH table</a>).<br>Runs took ~0.5 min for CANPA on&nbsp;<code>4 CPUs</code>&nbsp;and ~2 min for ARATH on&nbsp;<code>16 CPUs</code>.</p>
<p><span>Important remarks:</span></p>
<ul>
<li>Reduce your assembly before (fasta2homozygous.py) as any redundancy will likely break the synteny.</li>
<li>pyScaf works better with contigs than scaffolds, as scaffolds are often affected by mis-assemblies (no&nbsp;<em>de novo assembler</em>&nbsp;/ scaffolder is perfect...), which breaks synteny.</li>
<li>pyScaf works very well if divergence between reference genome and assembled contigs is below 20% at nucleotide level.</li>
<li>pyScaf deals with large rearrangements ie. deletions, insertion, inversions, translocations.&nbsp;<span>Note however, this is experimental implementation!</span></li>
<li>Consider closing gaps after scaffolding.</li>
</ul><p>Address of the bookmark: <a href="https://github.com/lpryszcz/pyScaf" rel="nofollow">https://github.com/lpryszcz/pyScaf</a></p>]]></description>
	<dc:creator>Bulbul</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31018/j-circos</guid>
	<pubDate>Fri, 17 Feb 2017 09:06:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31018/j-circos</link>
	<title><![CDATA[J-Circos]]></title>
	<description><![CDATA[<p>Circos plot tool (J-Circos) that is an interactive visualization tool that can plot Circos figures, as well as being able to dynamically add data to the figure, and providing information for specific data points using mouse hover display and zoom in/out functions. J-Circos uses the Java computer language to enable it to be used on most operating systems (Windows, MacOS, Linux). Users can input data into J-Circos using flat data formats, as well as from the GUI. J-Circos will enable biologists to better study more complex chromosomal interactions and fusion transcripts that are otherwise difficult to visualize from next-generation sequencing data.</p><p>Address of the bookmark: <a href="http://www.australianprostatecentre.org/research/software/jcircos" rel="nofollow">http://www.australianprostatecentre.org/research/software/jcircos</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31714/krona</guid>
	<pubDate>Wed, 22 Mar 2017 04:47:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31714/krona</link>
	<title><![CDATA[Krona]]></title>
	<description><![CDATA[<p>Krona allows hierarchical data to be explored with zooming, multi-layered pie charts. Krona charts can be created using an <a href="https://github.com/marbl/Krona/wiki/ExcelTemplate">Excel template</a> or <a href="https://github.com/marbl/Krona/wiki/KronaTools">KronaTools</a>, which includes support for several bioinformatics tools and raw data formats. The interactive charts are self-contained and can be viewed with any modern web browser (see <a href="https://github.com/marbl/Krona/wiki/Browser%20support">Browser support</a>).</p>
<p><a href="http://marbl.github.io/Krona/img/screen_mgrast.png"><img src="https://camo.githubusercontent.com/27b71b1f1832523723c3d14dec764e7ad098438c/687474703a2f2f6d6172626c2e6769746875622e696f2f4b726f6e612f696d672f7468756d625f6d67726173742e706e67" width="210" height="167" alt="image" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/marbl/Krona/wiki" rel="nofollow">https://github.com/marbl/Krona/wiki</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32481/sspace</guid>
	<pubDate>Fri, 05 May 2017 05:42:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32481/sspace</link>
	<title><![CDATA[SSPACE]]></title>
	<description><![CDATA[<p>SSPACE standard is a stand-alone program for scaffolding pre-assembled contigs using NGS paired-read data. It is unique in offering the possibility to manually control the scaffolding process. By using the distance information of paired-end and/or matepair data, SSPACE is able to assess the order, distance and orientation of your contigs and combine them into scaffolds. Currently we offer this as a command-line tool in Perl. The input data is given by pre-assembled contig sequences (FASTA) and NGS paired-read data (Illumina/454/Solid FASTA or FASTQ). The final scaffolds are provided in FASTA format.</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="https://www.baseclear.com/genomics/bioinformatics/basetools/SSPACE" rel="nofollow">https://www.baseclear.com/genomics/bioinformatics/basetools/SSPACE</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32875/finishing</guid>
	<pubDate>Sat, 20 May 2017 15:50:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32875/finishing</link>
	<title><![CDATA[Finishing !!]]></title>
	<description><![CDATA[<p>The process of&nbsp;<em>finishing</em>&nbsp;a genome and moving it from a&nbsp;<em>draft</em>&nbsp;stage (the result of sequencing and initial assembly) to a complete genome is typically a time and resource intensive task. The advent of new sequencing technologies has come with its own set of opportunities and pitfalls in the finishing process. While genomes can now be sequenced to high redundancy in a cost-effective manner, the process of assembling the genomes is more challenging and often draft genomes are fragmented into hundreds of contigs. Correspondingly, the task of producing the complete genome can involve months of lab work and thousands of finishing experiments and is usually done in large genome centers.</p>
<p>The work in our lab has focussed on computational approaches to speed-up the finishing process. Specifically, we have explored the use of optical mapping and mate-pair data to augment assemblies and direct finishing experiments. The tools developed in our lab have been used in several finishing projects, producing complete genomes (and near-complete ones) with surprisingly little computational and experimental effort (Nagarajan et al., in submission). The executables (as well as source code) for these tools are freely available here:</p>
<ul>
<li><strong>Scaffolding using Optical Restriction Mapping</strong><br>Optical Maps are global, ordered maps of restriction site locations in a genome. This information can be quite useful in scaffolding contigs from a shotgun assembly to guide the finishing process. A set of programs to exploit optical maps for assembly can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/soma-v2.tar.gz">SOMA v2.0 (63 MB tar.gz file)</a>. This version of SOMA contains several improvements to programs in v1.0 as well as new scripts for working with multiple maps, contig graphs and scaffolds.&nbsp;<br><br></li>
<li><strong>Augmenting assemblies with mate-pair data</strong><br>Mate-pair information can be valuable in augmenting short-read assemblies and reconstructing the genome as larger scaffolds. AMOS-Hybrid is a pipeline written in the AMOS framework (open-source assembly tools) to merge arbitrary mated reads into an existing assembly and merge contigs and create scaffolds where possible. Source code and executables for AMOS-Hybrid are available here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/AMOS-Hybrid-v1.tar.gz">AMOS-Hybrid v1.0 (142 MB tar.gz file)</a>.&nbsp;<br><br></li>
<li><strong>Assembly and sequence-composition guided finishing</strong><br>Contigs from a shotgun assembly are typically linked together in a graph structure that can serve to guide finishing and in some case close gaps&nbsp;<em>in-silico</em>. Also, in many cases, sequence composition of contigs can provide clues to fill gaps in scaffolds. A set of scripts to automate some of these tasks can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/finishing-v1.tar.gz">Finishing Scripts v1.0 (63 MB tar.gz file)</a>.&nbsp;</li>
</ul>
<p>http://www.cbcb.umd.edu/finishing/</p><p>Address of the bookmark: <a href="http://www.cbcb.umd.edu/finishing/" rel="nofollow">http://www.cbcb.umd.edu/finishing/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33741/diya-a-bacterial-annotation-pipeline-for-any-genomics-lab</guid>
	<pubDate>Fri, 30 Jun 2017 08:48:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33741/diya-a-bacterial-annotation-pipeline-for-any-genomics-lab</link>
	<title><![CDATA[DIYA: a bacterial annotation pipeline for any genomics lab]]></title>
	<description><![CDATA[<p><span>DIY Genomics is an open source bioinformatics consortium intended to bring a collection of tools and libraries into the hands of small scale genomics labs for the process of sequence assembly and annotation. Projects include DIYA, MGAP, CRISPR, and DIYGV</span></p>
<p><span>http://gmod.org/wiki/Diya</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/diyg/" rel="nofollow">https://sourceforge.net/projects/diyg/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35571/medusa-a-multi-draft-based-scaffolder</guid>
	<pubDate>Wed, 14 Feb 2018 02:49:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35571/medusa-a-multi-draft-based-scaffolder</link>
	<title><![CDATA[MeDuSa: a multi-draft based scaffolder]]></title>
	<description><![CDATA[<p><span>MeDuSa (Multi-Draft based Scaffolder), an algorithm for genome scaffolding. MeDuSa exploits information obtained from a set of (draft or closed) genomes from related organisms to determine the correct order and orientation of the contigs. MeDuSa formalises the scaffolding problem by means of a combinatorial optimisation formulation on graphs and implements an efficient constant factor approximation algorithm to solve it. In contrast to currently used scaffolders, it does not require either prior knowledge on the microrganisms dataset under analysis (e.g. their phylogenetic relationships) or the availability of paired end read libraries.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/combogenomics/medusa" rel="nofollow">https://github.com/combogenomics/medusa</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>