<?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/40351?</link>
	<atom:link href="https://bioinformaticsonline.com/related/40351?" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/38804/grabb-selective-assembly-of-genomic-regions-a-new-niche-for-genomic-research</guid>
	<pubDate>Sat, 26 Jan 2019 18:58:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38804/grabb-selective-assembly-of-genomic-regions-a-new-niche-for-genomic-research</link>
	<title><![CDATA[GRAbB: Selective Assembly of Genomic Regions, a New Niche for Genomic Research]]></title>
	<description><![CDATA[<p><span>GRAbB is shown to be more efficient than MITObim in terms of speed, memory and disk usage. The other functionalities (handling multiple targets simultaneously and extracting homologous regions) of the new program are not matched by other programs. The program is available with explanatory documentation at&nbsp;</span><a href="https://github.com/b-brankovics/grabb">https://github.com/b-brankovics/grabb</a><span>. GRAbB has been tested on Ubuntu (12.04 and 14.04), Fedora (23), CentOS (7.1.1503) and Mac OS X (10.7). Furthermore, GRAbB is available as a docker repository: brankovics/grabb (</span><a href="https://hub.docker.com/r/brankovics/grabb/">https://hub.docker.com/r/brankovics/grabb/</a><span>).</span></p><p>Address of the bookmark: <a href="https://github.com/b-brankovics/grabb" rel="nofollow">https://github.com/b-brankovics/grabb</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33482/tardis-toolkit-for-automated-and-rapid-discovery-of-structural-variants</guid>
	<pubDate>Fri, 09 Jun 2017 04:43:31 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33482/tardis-toolkit-for-automated-and-rapid-discovery-of-structural-variants</link>
	<title><![CDATA[TARDIS: Toolkit for automated and rapid discovery of structural variants]]></title>
	<description><![CDATA[<p>tardis</p>
<p>Toolkit for Automated and Rapid DIscovery of Structural variants</p>
<p>Requirements</p>
<p>zlib (http://www.zlib.net)<br>mrfast (https://github.com/BilkentCompGen/mrfast)<br>htslib (included as submodule; http://htslib.org/)<br>Fetching tardis</p>
<p>git clone https://github.com/BilkentCompGen/tardis.git --recursive</p>
<p>&nbsp;</p>
<p>https://github.com/BilkentCompGen/tardis</p><p>Address of the bookmark: <a href="https://github.com/BilkentCompGen/tardis" rel="nofollow">https://github.com/BilkentCompGen/tardis</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38752/hgtector-an-automated-method-facilitating-genome-wide-discovery-of-putative-horizontal-gene-transfers</guid>
	<pubDate>Mon, 21 Jan 2019 06:50:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38752/hgtector-an-automated-method-facilitating-genome-wide-discovery-of-putative-horizontal-gene-transfers</link>
	<title><![CDATA[HGTector: an automated method facilitating genome-wide discovery of putative horizontal gene transfers]]></title>
	<description><![CDATA[<p>A computational pipeline for genome-wide detection of putative horizontal gene transfer (HGT) events based on sequence homology search hit distribution statistics</p>
<p>Authors: Qiyun Zhu (<a href="mailto:qiyunzhu@gmail.com">qiyunzhu@gmail.com</a>), Katharina Dittmar (<a href="mailto:katharinad@gmail.com">katharinad@gmail.com</a>)</p>
<p>Affiliation: Department of Biological Sciences, University at Buffalo, State University of New York, Buffalo, USA</p>
<p>Zhu Q, Kosoy M, Dittmar K. HGTector: an automated method facilitating genome-wide discovery of putative horizontal gene transfers.&nbsp;<em style="font-size: 12.8px;">BMC Genomics</em>. 2014. 15:717.</p>
<p>Usage: Simply execute&nbsp;<span style="font-size: 12.8px;">perl HGTector.pl</span>, or, open&nbsp;<span style="font-size: 12.8px;">GUI.html</span>&nbsp;in a web browser to see a step-by-step wizard.</p>
<p>Download&nbsp;<a href="https://github.com/DittmarLab/HGTector/archive/0.2.2.zip">HGTector 0.2.2</a>.</p><p>Address of the bookmark: <a href="https://github.com/DittmarLab/HGTector" rel="nofollow">https://github.com/DittmarLab/HGTector</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42271/mcclintock-meta-pipeline-to-identify-transposable-element-insertions-using-next-generation-sequencing-data</guid>
	<pubDate>Tue, 27 Oct 2020 00:21:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42271/mcclintock-meta-pipeline-to-identify-transposable-element-insertions-using-next-generation-sequencing-data</link>
	<title><![CDATA[McClintock: Meta-pipeline to identify transposable element insertions using next generation sequencing data]]></title>
	<description><![CDATA[<p><span>an integrated bioinformatics pipeline for the detection of TE insertions in whole-genome shotgun data, called McClintock (</span><a href="https://github.com/bergmanlab/mcclintock">https://github.com/bergmanlab/mcclintock</a><span>), which automatically runs and standardizes output for multiple TE detection methods. We demonstrate the utility of McClintock by evaluating six TE detection methods using simulated and real genome data from the model microbial eukaryote,&nbsp;</span><em>Saccharomyces cerevisiae</em><span>.&nbsp;</span></p><p>Address of the bookmark: <a href="https://github.com/bergmanlab/mcclintock" rel="nofollow">https://github.com/bergmanlab/mcclintock</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33219/dbcan-a-web-server-and-database-for-automated-carbohydrate-active-enzyme-annotation</guid>
	<pubDate>Mon, 29 May 2017 05:39:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33219/dbcan-a-web-server-and-database-for-automated-carbohydrate-active-enzyme-annotation</link>
	<title><![CDATA[dbCAN: a web server and DataBase for automated Carbohydrate-active enzyme ANnotation]]></title>
	<description><![CDATA[<p><a href="http://csbl.bmb.uga.edu/dbCAN/index.php">dbCAN</a>&nbsp;is a web server and&nbsp;<span style="text-decoration: underline;">D</span>ata<span style="text-decoration: underline;">B</span>ase for&nbsp;<a href="http://csbl.bmb.uga.edu/dbCAN/annotate.php"><strong>automated&nbsp;<span style="text-decoration: underline;">C</span>arbohydrate-active enzyme&nbsp;<span style="text-decoration: underline;">AN</span>notation</strong></a>, funded by the&nbsp;<a href="http://bioenergycenter.org/">BioEnergy Science Center of the DOE</a>. Similar resources on the web include&nbsp;<a href="http://www.cazy.org/" target="_blank">CAZy database</a>&nbsp;and&nbsp;<a href="http://cricket.ornl.gov/cgi-bin/cat.cgi" target="_blank">CAT</a>. All data in dbCAN are generated based on the family classification from&nbsp;<a href="http://www.cazy.org/" target="_blank">CAZy database</a>&nbsp;while it has the following&nbsp;<strong><span style="text-decoration: underline;">unique features</span></strong>&nbsp;compared with CAZy database and CAT:</p>
<ul>
<li>dbCAN provides the capability of&nbsp;<a href="http://csbl.bmb.uga.edu/dbCAN/annotate.php">automated and comprehensive CAZyme annotation</a>&nbsp;of a given genome submitted by the user;</li>
<li>dbCAN provides an explicitly defined&nbsp;<span style="text-decoration: underline;">signature domain</span>&nbsp;for each and every CAZyme family along with its location in all the relevant full-length CAZyme proteins in all sequenced&nbsp;<a href="http://csbl.bmb.uga.edu/dbCAN/genome.php">genomes</a>;</li>
<li>dbCAN provides the most complete set of&nbsp;<span style="text-decoration: underline;">metagenomic CAZyme</span>&nbsp;genes published so far and represents the first step towards discovering novel CAZyme catalysts in metagenomes;</li>
<li>dbCAN provides a&nbsp;<span style="text-decoration: underline;">subfamily classification</span>&nbsp;of the existing CAZyme families based on sequence similarities;</li>
<li>dbCAN make all pre-computed data freely available to the public, including sequence alignments,&nbsp;<a href="http://csbl.bmb.uga.edu/dbCAN/download/">hidden markov models (HMMs)</a>&nbsp;and phylogenies of the signature domain regions in each and every CAZyme family and subfamily.</li>
</ul>
<p><a href="http://csbl.bmb.uga.edu/dbCAN/help.php">dbCAN</a>&nbsp;is updated regularly when&nbsp;<a href="http://www.cazy.org/" target="_blank">CAZy database</a>&nbsp;created new families based on latest literature.</p><p>Address of the bookmark: <a href="http://csbl.bmb.uga.edu/dbCAN/index.php" rel="nofollow">http://csbl.bmb.uga.edu/dbCAN/index.php</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38487/betsy-a-new-backward-chaining-expert-system-for-automated-development-of-pipelines-in-bioinformatics</guid>
	<pubDate>Mon, 17 Dec 2018 18:46:51 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38487/betsy-a-new-backward-chaining-expert-system-for-automated-development-of-pipelines-in-bioinformatics</link>
	<title><![CDATA[BETSY: A new backward-chaining expert system for automated development of pipelines in Bioinformatics]]></title>
	<description><![CDATA[<p>The BETSY provides a command-line interface and available at&nbsp;<a href="https://github.com/jefftc/changlab">https://github.com/jefftc/changlab</a>. A user first searches in the knowledge base for desired output and then BETSY develops an initial workflow to produce that data which is later examined by the user. The user can optimize the parameters, the algorithm to preprocess the data, and normalize it depending on the task.</p>
<p>Currently, BETSY consists of modules required for the microarray and next-generation sequencing data [4] such as expression analysis, classification, peak calling, and visualization.</p><p>Address of the bookmark: <a href="https://github.com/jefftc/changlab" rel="nofollow">https://github.com/jefftc/changlab</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44483/baclife-an-automated-genome-mining-tool-for-identification-of-lifestyle-associated-genes</guid>
	<pubDate>Fri, 15 Mar 2024 04:59:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44483/baclife-an-automated-genome-mining-tool-for-identification-of-lifestyle-associated-genes</link>
	<title><![CDATA[bacLIFE: an automated genome mining tool for identification of lifestyle associated genes]]></title>
	<description><![CDATA[<p style="margin-top: 0px; margin-bottom: 16px; color: #1f2328; font-size: 16px; font-style: normal; font-weight: 400; text-align: start; background-color: #ffffff;" dir="auto">bacLIFE is a streamlined computational workflow that annotates bacterial genomes and performs large-scale comparative genomics to predict bacterial lifestyles and to pinpoint candidate genes, denominated<span>&nbsp;</span><strong style="font-weight: var(--base-text-weight-semibold, 600);">lifestyle-associated genes (LAGs)</strong>, and biosynthetic gene clusters associated with each lifestyle detected. This whole process is divided into different modules:</p>
<ul style="margin-top: 0px; margin-bottom: 16px; color: #1f2328; font-size: 16px; font-style: normal; font-weight: 400; text-align: start; background-color: #ffffff;" dir="auto">
<li><strong style="font-weight: var(--base-text-weight-semibold, 600);">Clustering module</strong><span>&nbsp;</span>Predicts, clusters and annotates the genes of every input genome</li>
<li style="margin-top: 0.25em;"><strong style="font-weight: var(--base-text-weight-semibold, 600);">Lifestyle prediction</strong><span>&nbsp;</span>Employs a machine learning model to forecast bacterial lifestyle or other specified metadata</li>
<li style="margin-top: 0.25em;"><strong style="font-weight: var(--base-text-weight-semibold, 600);">Analitical module (Shiny app)</strong><span>&nbsp;</span>Results from the previous modules are embedded in a user-friendly interface for comprehensive and interactive comparative genomics.</li>
</ul>
<p style="margin-top: 0px; margin-bottom: 16px; color: #1f2328; font-size: 16px; font-style: normal; font-weight: 400; text-align: start; background-color: #ffffff;" dir="auto">You can find the complete wiki here [<a href="https://github.com/Carrion-lab/bacLIFE/wiki/bacLIFE-wiki">https://github.com/Carrion-lab/bacLIFE/wiki/bacLIFE-wiki</a>]</p><p>Address of the bookmark: <a href="https://github.com/Carrion-lab/bacLIFE" rel="nofollow">https://github.com/Carrion-lab/bacLIFE</a></p>]]></description>
	<dc:creator>BioStar</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/bookmarks/view/42619/metaeuk-sensitive-high-throughput-gene-discovery-and-annotation-for-large-scale-eukaryotic-metagenomics</guid>
	<pubDate>Wed, 13 Jan 2021 19:29:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42619/metaeuk-sensitive-high-throughput-gene-discovery-and-annotation-for-large-scale-eukaryotic-metagenomics</link>
	<title><![CDATA[MetaEuk - sensitive, high-throughput gene discovery and annotation for large-scale eukaryotic metagenomics]]></title>
	<description><![CDATA[<p><span>MetaEuk is a modular toolkit designed for large-scale gene discovery and annotation in eukaryotic metagenomic contigs. Metaeuk combines the fast and sensitive homology search capabilities of&nbsp;</span><a href="https://github.com/soedinglab/MMseqs2">MMseqs2</a><span>&nbsp;with a dynamic programming procedure to recover optimal exons sets. It reduces redundancies in multiple discoveries of the same gene and resolves conflicting gene predictions on the same strand. MetaEuk is GPL-licensed open source software that is implemented in C++ and available for Linux and macOS. The software is designed to run on multiple cores.</span></p><p>Address of the bookmark: <a href="https://github.com/soedinglab/metaeuk" rel="nofollow">https://github.com/soedinglab/metaeuk</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>