<?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/40703?offset=0</link>
	<atom:link href="https://bioinformaticsonline.com/related/40703?offset=0" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</guid>
	<pubDate>Tue, 28 Jan 2020 03:21:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40699/kevler-reference-free-variant-discovery-in-large-eukaryotic-genomes</link>
	<title><![CDATA[Kevler: Reference-free variant discovery in large eukaryotic genomes]]></title>
	<description><![CDATA[<p><span>Welcome to&nbsp;</span><span>kevlar</span><span>, software for predicting&nbsp;</span><em>de novo</em><span>&nbsp;genetic variants without mapping reads to a reference genome! kevlar's&nbsp;</span><em>k</em><span>-mer abundance based method calls single nucleotide variants (SNVs), multinucleotide variants (MNVs), insertion/deletion variants (indels), and structural variants (SVs) simultaneously with a single simple model.&nbsp;</span></p>
<p><span>More at&nbsp;<a href="https://kevlar.readthedocs.io/en/latest/">https://kevlar.readthedocs.io/en/latest/</a></span></p>
<p><span><a href="https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf">https://www.cell.com/iscience/pdf/S2589-0042(19)30259-7.pdf</a></span></p><p>Address of the bookmark: <a href="https://github.com/kevlar-dev/kevlar" rel="nofollow">https://github.com/kevlar-dev/kevlar</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/bookmarks/view/40711/vg-variation-graph-data-structures-interchange-formats-alignment-genotyping-and-variant-calling-methods</guid>
	<pubDate>Tue, 28 Jan 2020 03:53:24 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40711/vg-variation-graph-data-structures-interchange-formats-alignment-genotyping-and-variant-calling-methods</link>
	<title><![CDATA[VG: variation graph data structures, interchange formats, alignment, genotyping, and variant calling methods]]></title>
	<description><![CDATA[<p><em>Variation graphs</em>&nbsp;provide a succinct encoding of the sequences of many genomes. A variation graph (in particular as implemented in vg) is composed of:</p>
<ul>
<li><em>nodes</em>, which are labeled by sequences and ids</li>
<li><em>edges</em>, which connect two nodes via either of their respective ends</li>
<li><em>paths</em>, describe genomes, sequence alignments, and annotations (such as gene models and transcripts) as walks through nodes connected by edges</li>
</ul><p>Address of the bookmark: <a href="https://github.com/vgteam/vg" rel="nofollow">https://github.com/vgteam/vg</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33014/synteny-portal-a-web-based-application-portal-for-synteny-block-analysis</guid>
	<pubDate>Wed, 24 May 2017 10:39:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33014/synteny-portal-a-web-based-application-portal-for-synteny-block-analysis</link>
	<title><![CDATA[Synteny Portal: a web-based application portal for synteny block analysis]]></title>
	<description><![CDATA[<p><span>Synteny Portal, a versatile web-based application portal for constructing, visualizing and browsing synteny blocks. With Synteny Portal, users can easily (i) construct synteny blocks among multiple species by using prebuilt alignments in the UCSC genome browser database, (ii) visualize and download syntenic relationships as high-quality images, (iii) browse synteny blocks with genetic information and (iv) download the details of synteny blocks to be used as input for downstream synteny-based analyses, all in an intuitive and easy-to-use web-based interface. We believe that Synteny Portal will serve as a highly valuable tool that will enable biologists to easily perform comparative genomics studies by compensating limitations of existing tools. Synteny Portal is freely available at&nbsp;</span><a href="http://bioinfo.konkuk.ac.kr/synteny_portal" target="pmc_ext">http://bioinfo.konkuk.ac.kr/synteny_portal</a><span>.</span></p>
<p>http://bioinfo.konkuk.ac.kr/synteny_portal/</p><p>Address of the bookmark: <a href="http://bioinfo.konkuk.ac.kr/synteny_portal/" rel="nofollow">http://bioinfo.konkuk.ac.kr/synteny_portal/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/34369/scfbio-have-developed-sanjeevini</guid>
	<pubDate>Fri, 17 Nov 2017 07:55:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/34369/scfbio-have-developed-sanjeevini</link>
	<title><![CDATA[SCFBio have developed Sanjeevini]]></title>
	<description><![CDATA[<p><span>SCFBio have developed a new android based application for drug design called&nbsp;</span><strong>Sanjeevini</strong><span>&nbsp;(</span><a href="https://play.google.com/store/apps/details?id=com.sanjeevini&amp;hl=en" target="_blank">https://play.google.com/store/apps/details?id=com.sanjeevini&amp;hl=en</a><span>). It is available free of charge. You can download it using Google play store. Just search for&nbsp;</span><strong>"Sanjeevini-SCFBIO-CADD</strong><span>" in Google play store. It contains all modules used by current Sanjeevini users. We have worked towards making a unified and easy to use interface. The app now supports all major small molecule file formats (pdb, mol, sdf, mol2 and xyz). The application contains inbuilt visualizer JSmol for easy analysis of results. Users can now directly download the protein files from PDB ("Get protein PDB file" in `FILE` Menu) and prepare it using the easy to use in-built module "Prepare protein/DNA".</span><br /><br /><span><span>SCFBio</span>&nbsp;have worked towards making the process of Job retrieval more streamlined and user friendly. All jobs are now recorded in the "Job results". It can be accessed using the main page of the application. Job status can now be retrieved by clicking on the refresh button against the job ID.</span><br /><br /><span><span>SCFBio</span>&nbsp;have also added a new feature of accessing Jobs run on different android application. Users can retrieve jobs run by other users by sharing the job ID and module name. This feature can be accessed using the Import Jobs option in File menu. We hope this feature will help collaborating groups stay in touch with each other.</span><br /><br /><span>The module contains all modules of Sanjeevini suite of software for structure based Drug design.</span><br /><br /></p><table width="630" cellspacing="0" cellpadding="7">
<thead>
<tr>
<td><strong>Sl No.</strong></td>
<td><strong>Module name</strong></td>
<td><strong>Activity</strong></td>
</tr>
</thead>
<tbody>
<tr>
<td>1</td>
<td>Prepare Protein/DNA</td>
<td>Prepares protein/DNA for other modules of Sanjeevini</td>
</tr>
<tr>
<td>2</td>
<td>Prepare ligand</td>
<td>Prepares ligands for other modules of Sanjeevini</td>
</tr>
<tr>
<td>3</td>
<td>Active site Prediction</td>
<td>Predicts biologically relevant sites in a protein</td>
</tr>
<tr>
<td>4</td>
<td>ParDOCK</td>
<td>Rigid Docking of Protein-Ligand complex</td>
</tr>
<tr>
<td>5</td>
<td>BAPPL</td>
<td>Binding affinity prediction of Protein-Ligand complex</td>
</tr>
<tr>
<td>6</td>
<td>BAPPL Z</td>
<td>Binding affinity prediction of Protein-Zinc-Ligand complex</td>
</tr>
<tr>
<td>7</td>
<td>DNA ligand Docking</td>
<td>Rigid Docking of DNA-Ligand complex</td>
</tr>
<tr>
<td>8</td>
<td>PreDDICTA</td>
<td>Binding affinity prediction of DNA-Ligand complex</td>
</tr>
<tr>
<td>9</td>
<td>SOM Prediction</td>
<td>Rigid Docking of Ligand and CYP proteins</td>
</tr>
<tr>
<td>10</td>
<td>Lipinski filters</td>
<td>Checks Lipinski's rule of five for ligand molecule</td>
</tr>
<tr>
<td>11</td>
<td>Molecular volume</td>
<td>Calculates volume of a ligand</td>
</tr>
<tr>
<td>12</td>
<td>RASPD</td>
<td>Virtual screening of protein molecule to yield hit molecules</td>
</tr>
<tr>
<td>13</td>
<td>AADS</td>
<td>Prediction and docking of top 10 biologically relevant sites on protein</td>
</tr>
<tr>
<td>14</td>
<td>Intercalate</td>
<td>Rigid Docking of DNA-Ligand complex in intercalation sites</td>
</tr>
<tr>
<td>15</td>
<td>DNA sequence to str.</td>
<td>Converts DNA sequence to DNA structure (A-DNA or B-DNA)</td>
</tr>
<tr>
<td>16</td>
<td>NRDBSM</td>
<td>Non-redundant database of small molecules</td>
</tr>
<tr>
<td>17</td>
<td>TPACM4</td>
<td>Partial charge calculator for small molecules</td>
</tr>
<tr>
<td>18</td>
<td>Wiener index</td>
<td>Wiener index calculator for small molecules</td>
</tr>
</tbody>
</table><p><strong>The results can be downloaded to the PC desktop for further analysis</strong><span>. For this you can use this accompanying website for this purpose:</span><br /><a href="http://www.scfbio-iitd.res.in/sanjapp/webSearch/Sanjeevini_webpage.html" target="_blank">http://www.scfbio-iitd.res.in/sanjapp/webSearch/Sanjeevini_webpage.html</a><br /><br /><span>On more information on how to use the application please visit:&nbsp;</span><a href="http://scfbio-iitd.res.in/sanjapp/webSearch/doc.html" target="_blank">http://scfbio-iitd.res.in/sanjapp/webSearch/doc.html</a><br /><span>or</span><br /><a href="http://scfbio-iitd.res.in/sanjeeviniapp/tut.html" target="_blank">http://scfbio-iitd.res.in/sanjeeviniapp/tut.html</a><br /><br /><span>Please email us your valuable comments and suggestions at&nbsp;</span><a href="mailto:iitd.scfbio@gmail.com" target="_blank">iitd.scfbio@gmail.com</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40221/dash-a-web-application-framework-that-provides-pure-python-abstraction-around-html-css-and-javascript</guid>
	<pubDate>Tue, 05 Nov 2019 06:39:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40221/dash-a-web-application-framework-that-provides-pure-python-abstraction-around-html-css-and-javascript</link>
	<title><![CDATA[Dash: a web application framework that provides pure Python abstraction around HTML, CSS, and JavaScript.]]></title>
	<description><![CDATA[<p style="margin-top: 0px; margin-bottom: 0.75rem;">Dash is a web application framework that provides pure Python abstraction around HTML, CSS, and JavaScript.</p>
<p style="margin-top: 0px; margin-bottom: 0.75rem;">Dash Bio is a suite of bioinformatics components that make it simpler to analyze and visualize bioinformatics data and interact with them in a Dash application.</p>
<p style="margin-top: 0px; margin-bottom: 0.75rem;">The source can be found on GitHub at<span>&nbsp;</span><a href="https://github.com/plotly/dash-bio">plotly/dash-bio</a>.</p>
<p style="margin-top: 0px; margin-bottom: 0.75rem;">These docs are using Dash Bio version 0.1.4.</p><p>Address of the bookmark: <a href="https://dash.plot.ly/dash-bio" rel="nofollow">https://dash.plot.ly/dash-bio</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/14191/scalpel</guid>
	<pubDate>Wed, 20 Aug 2014 02:07:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/14191/scalpel</link>
	<title><![CDATA[Scalpel]]></title>
	<description><![CDATA[<p>A team from Cold Spring Harbor Laboratory has released an algorithm, called Scalpel, for finding insertions and deletions in next generation sequencing data sets. Scalpel, which is open source and <a href="http://scalpel.sourceforge.net/" title="available for download">available for download</a> on SourceForge,&nbsp;<span>outperformed the popular tools GATK HaplotypeCaller and SOAPindel in test runs on both simulated and real whole human exomes.</span></p><p>Like other indel callers, Scalpel works by performing <em>de novo</em>&nbsp;assembly of regions of interest, so that misalignment to the reference genome cannot obscure the presence of an insertion or deletion. Scalpel's innovation is to repeatedly check its assembly before comparing to the reference genome, to account for simple sequence repeats that are a regular source of error in indel calling. When Scalpel assembles an exon, it collects reads that map to that exon (including partial matches), splits them into k-mers, and creates a de Bruijn graph to span the exon; however, if it detects repeats in the map, it iteratively increases the size of the k-mers by one base until the repeats are eliminated. This ensures that the final assembly of the exon is highly accurate while minimizing compute time.</p><p>The Cold Spring Harbor team's validation of Scalpel, <a href="http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3069.html" title="published over the weekend in Nature Methods">published over the weekend in <em>Nature Methods</em></a>, compares Scalpel's performance on a live whole exome against HaplotypeCaller and SOAPindel. The donor is an individual with serious neurological disorders, which may be linked to a high incidence of indels. One thousand indels from this individual's exome, called by one or more of the informatics pipelines, were selected for focused resequencing. This resequencing revealed a 77% true positive rate for Scalpel calls, dramatically better than the rates for either of the competing tools; Scalpel performed especially well with indels longer than five base pairs, a traditional weak point for indel callers.</p><p>Finally, the authors demonstrate Scalpel's use on a large set of genetic data from nearly 600 families who donated samples to the Simons Simplex Collection, a project of the Simons Foundation Autism Research Initiative. Scalpel found a very high enrichment for indels in children affected by autism, compared with their unaffected siblings, a pattern that persisted even after excluding common variants.</p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35559/computational-resources-for-te-discovery-and-te-detection</guid>
	<pubDate>Mon, 12 Feb 2018 10:29:18 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35559/computational-resources-for-te-discovery-and-te-detection</link>
	<title><![CDATA[Computational resources for TE discovery and TE detection]]></title>
	<description><![CDATA[<p><span>Transposable Elements (TEs) to genome structure and evolution as well as their impact on genome sequencing, assembly, annotation and alignment has generated increasing interest in developing new methods for their computational analysis. </span></p><p><span>Following are the list of r</span><span>esource and location for TE discovery and TE detection:</span></p><p>BLASTER suite&nbsp;http://urgi.versailles.inra.fr/development/blaster/&nbsp;</p><p>Censor&nbsp;http://www.girinst.org/censor/download.php&nbsp;</p><p>find_ltr&nbsp;http://darwin.informatics.indiana.edu/cgi-bin/evolution/ltr.pl&nbsp;</p><p>FINDMITE http://jaketu.biochem.vt.edu/dl_software.htm </p><p>HMMER http://hmmer.janelia.org/ </p><p>LTR_FINDER http://tlife.fudan.edu.cn/ltr_finder/ </p><p>LTR_STRUC http://www.genetics.uga.edu/retrolab/data/LTR_Struc.html </p><p>LTR_MINER http://genomebiology.com/2004/5/10/R79/suppl/s7 </p><p>LTR_par http://www.eecs.wsu.edu/~ananth/software.htm </p><p>MAK http://wesslercluster.plantbio.uga.edu/mak06.html </p><p>MaskerAid http://blast.wustl.edu/maskeraid/ </p><p>mer-engine http://mer-engine.cshl.edu/mer-home.php </p><p>mreps http://bioinfo.lifl.fr/mreps/ </p><p>PILER http://www.drive5.com/piler/ </p><p>PLOTREP http://repeats.abc.hu/cgi-bin/plotrep.pl </p><p>RepBase http://www.girinst.org/ </p><p>RepeatFinder http://cbcb.umd.edu/software/RepeatFinder/ </p><p>RepeatGluer http://nbcr.sdsc.edu/euler/intro_tmp.htm </p><p>RepeatMasker http://www.repeatmasker.org/ </p><p>RepeatRunner http://www.yandell-lab.org/repeat_runner/index.html </p><p>RepeatScout http://repeatscout.bioprojects.org/ </p><p>repeat-match http://mummer.sourceforge.net/ </p><p>REPuter http://www.genomes.de/ </p><p>RetroMap http://www.burchsite.com/bioi/RetroMapHome.html </p><p>SMaRTFinder http://bioinf.dimi.uniud.it/software/software/smartfinder </p><p>Tandem Repeats Finder http://tandem.bu.edu/trf/trf.html </p><p>Transposon Cluster Finder http://www.mssm.edu/labs/warbup01/paper/files.html </p><p>TE nest http://www.plantgdb.org/prj/TE_nest/TE_nest.html </p><p>TRANSPO http://alggen.lsi.upc.es/recerca/search/transpo/transpo.html </p><p>TSDfinder http://www.ncbi.nlm.nih.gov/CBBresearch/Landsman/TSDfinder/ </p><p>Tu Lab TE tools http://jaketu.biochem.vt.edu/dl_software.htm </p><p>WU-BLAST http://blast.wustl.edu</p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40351/repeatmodeler2-automated-genomic-discovery-of-transposable-element-families</guid>
	<pubDate>Mon, 02 Dec 2019 06:52:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40351/repeatmodeler2-automated-genomic-discovery-of-transposable-element-families</link>
	<title><![CDATA[RepeatModeler2: automated genomic discovery of transposable element families]]></title>
	<description><![CDATA[<p><span>RepeatModeler2 represents a valuable addition to the genome annotation toolkit that will enhance the identification and study of TEs in eukaryotic genome sequences. RepeatModeler2 is available as source code or a containerized package under an open license (</span><a href="https://github.com/Dfam-consortium/RepeatModeler">https://github.com/Dfam-consortium/RepeatModeler</a><span>,&nbsp;</span><a href="https://github.com/Dfam-consortium/TETools">https://github.com/Dfam-consortium/TETools</a><span>).</span></p><p>Address of the bookmark: <a href="https://github.com/Dfam-consortium/TETools" rel="nofollow">https://github.com/Dfam-consortium/TETools</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29635/r-graphs</guid>
	<pubDate>Fri, 04 Nov 2016 10:48:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29635/r-graphs</link>
	<title><![CDATA[R Graphs !!]]></title>
	<description><![CDATA[<p><span>The blog is a collection of script examples with example data and output plots. R produce excellent quality graphs for data analysis, science and business presentation, publications and other purposes. Self-help codes and examples are provided. Enjoy nice graphs !!</span></p><p>Address of the bookmark: <a href="http://rgraphgallery.blogspot.be/" rel="nofollow">http://rgraphgallery.blogspot.be/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>