<?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/27090?offset=140</link>
	<atom:link href="https://bioinformaticsonline.com/related/27090?offset=140" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43736/odgi-optimized-dynamic-genomegraph-implementation</guid>
	<pubDate>Tue, 01 Feb 2022 23:42:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43736/odgi-optimized-dynamic-genomegraph-implementation</link>
	<title><![CDATA[odgi: optimized dynamic genome/graph implementation]]></title>
	<description><![CDATA[<p dir="auto"><code>odgi</code>&nbsp;provides an efficient and succinct dynamic DNA sequence graph model, as well as a host of algorithms that allow the use of such graphs in bioinformatic analyses.</p>
<p dir="auto">Careful encoding of graph entities allows&nbsp;<code>odgi</code>&nbsp;to efficiently compute and transform&nbsp;<a href="https://pangenome.github.io/">pangenomes</a>&nbsp;with minimal overheads.&nbsp;<code>odgi</code>&nbsp;implements a dynamic data structure that leveraged multi-core CPUs and can be updated on the fly.</p>
<p dir="auto">The edges and path steps are recorded as deltas between the current node id and the target node id, where the node id corresponds to the rank in the global array of nodes. Graphs built from biological data sets tend to have local partial order and, when sorted, the deltas be small. This allows them to be compressed with a variable length integer representation, resulting in a small in-memory footprint at the cost of packing and unpacking.</p>
<p dir="auto">The RAM and computational savings are substantial. In partially ordered regions of the graph, most deltas will require only a single byte.</p><p>Address of the bookmark: <a href="https://github.com/pangenome/odgi" rel="nofollow">https://github.com/pangenome/odgi</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</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/pages/view/44352/bioinformatics-tools-for-genome-assembly</guid>
	<pubDate>Mon, 24 Jul 2023 07:04:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44352/bioinformatics-tools-for-genome-assembly</link>
	<title><![CDATA[Bioinformatics tools for genome assembly !]]></title>
	<description><![CDATA[<p>There are numerous genome assembly tools available, each with its strengths and weaknesses. Here is a list of some widely used genome assembly tools as of my last update in September 2021:</p><ol>
<li>
<p><span>SPAdes:</span> An assembler specifically designed for single-cell and multi-cell bacterial genomes, as well as small eukaryotic genomes.</p>
</li>
<li>
<p><span>ABySS:</span> A parallelized assembler for large genomes that uses de Bruijn graphs.</p>
</li>
<li>
<p><span>Velvet:</span> Another de Bruijn graph-based assembler optimized for short-read sequencing data.</p>
</li>
<li>
<p><span>SOAPdenovo:</span> A de Bruijn graph-based assembler designed for short reads, widely used for assembling large and complex genomes.</p>
</li>
<li>
<p><span>MaSuRCA:</span> A hybrid assembler that combines data from multiple sequencing technologies, such as Illumina and PacBio.</p>
</li>
<li>
<p><span>Canu:</span> A long-read assembler optimized for PacBio and Oxford Nanopore sequencing data.</p>
</li>
<li>
<p><span>Flye:</span> A long-read assembler suitable for bacterial and small eukaryotic genomes.</p>
</li>
<li>
<p><span>SMARTdenovo:</span> An assembler designed for long reads, particularly suited for PacBio data.</p>
</li>
<li>
<p><span>SPAdes Long Read (SPAdesLR):</span> An extension of SPAdes for long-read data, such as those from PacBio or Nanopore.</p>
</li>
<li>
<p><span>Minia:</span> An assembler optimized for low memory consumption, suitable for small and medium-sized genomes.</p>
</li>
<li>
<p><span>Unicycler:</span> A hybrid assembler that combines short and long reads for circular bacterial genome assembly.</p>
</li>
<li>
<p><span>wtdbg2:</span> A de Bruijn graph assembler for long reads, efficient for very large genomes.</p>
</li>
<li>
<p><span>Shasta:</span> A long-read assembler that uses the Overlap-Layout-Consensus approach, suitable for PacBio and Nanopore data.</p>
</li>
<li>
<p><span>Sparc:</span> An assembler designed to handle noisy long reads from Nanopore sequencing.</p>
</li>
<li>
<p><span>CANA:</span> An assembler for metagenomic data, particularly for complex and diverse microbial communities.</p>
</li>
<li>
<p><span>Ra</span> Assembler: A metagenome assembler for long reads, designed for highly complex metagenomic samples.</p>
</li>
</ol><p>Please note that the field of bioinformatics is constantly evolving, and new assembly tools may have emerged since my last update. Additionally, the performance of these tools can vary depending on the characteristics of the sequencing data and the genome being assembled. When selecting an assembly tool, consider the specific requirements of your project, the available data types, and the computational resources at your disposal. Always refer to the respective tool's documentation and publications for the most up-to-date information and recommendations.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26325/crossmap</guid>
	<pubDate>Mon, 08 Feb 2016 15:47:00 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26325/crossmap</link>
	<title><![CDATA[CrossMap]]></title>
	<description><![CDATA[<p>CrossMap is a program for convenient conversion of genome coordinates (or annotation files) between <em>different assemblies</em> (such as Human <a href="http://www.ncbi.nlm.nih.gov/assembly/2928/">hg18 (NCBI36)</a> &lt;&gt; <a href="http://www.ncbi.nlm.nih.gov/assembly/2758/">hg19 (GRCh37)</a>, Mouse <a href="http://www.ncbi.nlm.nih.gov/assembly/165668/">mm9 (MGSCv37)</a> &lt;&gt; <a href="http://www.ncbi.nlm.nih.gov/assembly/327618/">mm10 (GRCm38)</a>).</p>
<p>It supports most commonly used file formats including SAM/BAM, Wiggle/BigWig, BED, GFF/GTF, VCF.</p>
<p>CrossMap is designed to liftover genome coordinates between assemblies. It&rsquo;s <em>not</em> a program for aligning sequences to reference genome.</p>
<p>We <em>do not</em> recommend using CrossMap to convert genome coordinates between species.</p>
<p>More at http://crossmap.sourceforge.net/</p><p>Address of the bookmark: <a href="http://crossmap.sourceforge.net/" rel="nofollow">http://crossmap.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27257/busco-assessing-genome-assembly-and-annotation-completeness-with-benchmarking-universal-single-copy-orthologs</guid>
	<pubDate>Tue, 10 May 2016 07:46:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27257/busco-assessing-genome-assembly-and-annotation-completeness-with-benchmarking-universal-single-copy-orthologs</link>
	<title><![CDATA[BUSCO: Assessing genome assembly and annotation completeness with Benchmarking Universal Single-Copy Orthologs]]></title>
	<description><![CDATA[<ul>
<li><span>High-throughput genomics has revolutionized biological research, however, while the number of sequenced genomes grows by the day, quality assessment of the resulting assembled sequences remains complicated and mostly limited to technical measures like N50.&nbsp;</span></li>
<li></li>
<li><span>BUSCO provides measures for quantitative assessment of genome assembly, gene set, and transcriptome completeness based on evolutionarily informed expectations of gene content from near-universal single-copy orthologs selected from&nbsp;</span><a href="http://orthodb.org/">OrthoDB</a><span>.&nbsp;</span></li>
<li></li>
<li><span>BUSCO assessments are implemented in open-source software, with comprehensive lineage-specific sets of Benchmarking Universal Single-Copy Orthologs for arthropods, vertebrates, metazoans, fungi, eukaryotes, and bacteria.&nbsp;</span></li>
<li></li>
<li><span>These conserved orthologs are ideal candidates for large-scale phylogenomics studies, and the annotated BUSCO gene models built during genome assessments provide a comprehensive gene predictor training set for use as part of genome annotation pipelines.&nbsp;</span></li>
<li></li>
<li><span>BUSCO assessments offer intuitive metrics, based on evolutionarily informed expectations of gene content from hundreds of species, to gauge completeness of rapidly accumulating genomic data and satisfy an Iberian's quest for quality - "Busco calidad/qualidade".</span></li>
</ul><p>Address of the bookmark: <a href="http://busco.ezlab.org/" rel="nofollow">http://busco.ezlab.org/</a></p>]]></description>
	<dc:creator>Anjana</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/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/30090/standardized-velvet-assembly-report</guid>
	<pubDate>Fri, 09 Dec 2016 03:59:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30090/standardized-velvet-assembly-report</link>
	<title><![CDATA[Standardized velvet assembly report]]></title>
	<description><![CDATA[<p>Requirements:</p>
<ul>
<li>velvet (velveth velvetg should be in your PATH)</li>
<li>R (with Sweave)</li>
<li>pdflatex (usually part of TeTeX)</li>
<li>ggplot2 (from R prompt type install.packages("ggplot2","proto","xtable"))</li>
<li>Perl</li>
</ul>
<p>Optional:</p>
<ul>
<li>BLAT or BLAST (to generate alignments against a reference genome). If using BLAT, add faToTwoBit,gfClient,gfServer to your PATH. If using BLAST, add blastall and formatdb.</li>
</ul>
<p>Edit permute.sh to your liking, paying particular attention to the kmer, cvCut, expCov, and other flags</p>
<p>To Run:</p>
<ol>
<li><code>perl fastaAllSize mysequences.fa &gt; mysequences.stat or gunzip -c mysequences.fa.gz | fastaAllSize &gt; mysequences.stat</code>&nbsp;Substitute fastqAllSize for fastq files.</li>
<li><code>./permute.sh mysequences</code>&nbsp;(leave out the .fa)</li>
</ol>
<p>https://github.com/leipzig/standardized-velvet-assembly-report</p><p>Address of the bookmark: <a href="https://github.com/leipzig/standardized-velvet-assembly-report" rel="nofollow">https://github.com/leipzig/standardized-velvet-assembly-report</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</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/30212/pear</guid>
	<pubDate>Mon, 19 Dec 2016 09:28:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30212/pear</link>
	<title><![CDATA[PEAR]]></title>
	<description><![CDATA[<p><strong>PEAR</strong>&nbsp;is an ultrafast, memory-efficient and highly accurate pair-end read merger. It is fully parallelized and can run with as low as just a few kilobytes of memory.</p>
<p>PEAR evaluates all possible paired-end read overlaps and without requiring the target fragment size as input. In addition, it implements a statistical test for minimizing false-positive results. Together with a highly optimized implementation, it can merge millions of paired end reads within a couple of minutes on a standard desktop computer.</p><p>Address of the bookmark: <a href="http://sco.h-its.org/exelixis/web/software/pear/doc.html" rel="nofollow">http://sco.h-its.org/exelixis/web/software/pear/doc.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>