<?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/36017?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/36017?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41504/quartataweb-user-friendly-server-developed-for-polypharmacological-and-chemogenomics-analyses</guid>
	<pubDate>Wed, 01 Apr 2020 10:30:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41504/quartataweb-user-friendly-server-developed-for-polypharmacological-and-chemogenomics-analyses</link>
	<title><![CDATA[QuartataWeb: user-friendly server developed for polypharmacological and chemogenomics analyses.]]></title>
	<description><![CDATA[<p><span>Data on protein-drug and protein-chemical interactions are rapidly accumulating in databases such as&nbsp;</span><a href="http://www.drugbank.ca/" target="_blank">DrugBank</a><span>&nbsp;and&nbsp;</span><a href="http://stitch.embl.de/" target="_blank">STITCH</a><span>. These data usually reflect observed interactions, while the lack of data for a given protein-drug/chemical pair does not necessarily mean the lack of interaction. Indeed, recent studies, both computational and experimental, highlighted the promiscuity of both proteins and small molecules: many drugs have side effects i.e. they target proteins other than those known in public databases; and many proteins bind chemicals other than those known, opening the way to design repurposable drugs, new chemicals, or polypharmacological treatments.</span></p>
<p><span><a href="https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa210/5813333">https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa210/5813333</a></span></p><p>Address of the bookmark: <a href="http://quartata.csb.pitt.edu/" rel="nofollow">http://quartata.csb.pitt.edu/</a></p>]]></description>
	<dc:creator>Neel</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/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</guid>
	<pubDate>Mon, 17 Aug 2020 05:25:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42132/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</link>
	<title><![CDATA[SqueezeMeta: a fully automated metagenomics pipeline, from reads to bins]]></title>
	<description><![CDATA[<p>SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes via binning procedures. Thus, SqueezeMeta features several unique characteristics:</p>
<ol>
<li>Co-assembly procedure with read mapping for estimation of the abundances of genes in each metagenome</li>
<li>Co-assembly of a large number of metagenomes via merging of individual metagenomes</li>
<li>Includes binning and bin checking, for retrieving individual genomes</li>
<li>The results are stored in a database, where they can be easily exported and shared, and can be inspected anywhere using a web interface.</li>
<li>Internal checks for the assembly and binning steps inform about the consistency of contigs and bins, allowing to spot potential chimeras.</li>
<li>Metatranscriptomic support via mapping of cDNA reads against reference metagenomes</li>
</ol><p>Address of the bookmark: <a href="https://github.com/jtamames/SqueezeMeta" rel="nofollow">https://github.com/jtamames/SqueezeMeta</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42965/nucl2vec-local-alignment-of-dna-sequences-using-distributed-vector-representation</guid>
	<pubDate>Tue, 16 Mar 2021 05:45:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42965/nucl2vec-local-alignment-of-dna-sequences-using-distributed-vector-representation</link>
	<title><![CDATA[Nucl2Vec: Local alignment of DNA sequences using Distributed Vector Representation]]></title>
	<description><![CDATA[<p><span>We demonstrate a novel approach for</span><span>local alignment of DNA reads with respect to reference genome.</span><span>For this process we have used Skip-gram model for creating</span><span>encoding(Nucl2Vec) and k-nearest neighbor for the alignment.</span><span>With our new approach we have reduced computation cost for</span><span>local alignment , while achieving accuracy comparable to existing</span><span>defacto standard BWA-MEM tool.</span> </p>
<p><em>https://prakharg24.github.io/papers/401851.full.pdf</em></p><p>Address of the bookmark: <a href="https://prakharg24.github.io/papers/401851.full.pdf" rel="nofollow">https://prakharg24.github.io/papers/401851.full.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44616/basics-of-blast-programs</guid>
	<pubDate>Fri, 26 Jul 2024 06:04:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44616/basics-of-blast-programs</link>
	<title><![CDATA[Basics of BLAST Programs !]]></title>
	<description><![CDATA[<p>The Basic Local Alignment Search Tool (BLAST) is a powerful bioinformatics program used to compare an input sequence (such as DNA, RNA, or protein sequences) against a database of sequences to find regions of similarity. Developed by the National Center for Biotechnology Information (NCBI), BLAST is widely used for identifying species, finding functional and evolutionary relationships between sequences, and predicting the function of novel sequences.</p><p>Key Features of BLAST:<br />1. Sequence Comparison: BLAST searches for local alignments between the query sequence and sequences in a database. It identifies regions of similarity, which can help infer functional and evolutionary relationships.</p><p>2. Speed and Efficiency: BLAST uses heuristic algorithms, making it faster than exhaustive search methods, suitable for large-scale database searches.</p><p>3. Versatility: There are several versions of BLAST for different types of sequence comparisons:<br /> - blastn: Compares a nucleotide query sequence against a nucleotide sequence database.<br /> - blastp: Compares a protein query sequence against a protein sequence database.<br /> - blastx: Compares a nucleotide query sequence translated in all reading frames against a protein sequence database.<br /> - tblastn: Compares a protein query sequence against a nucleotide sequence database translated in all reading frames.<br /> - tblastx: Compares the six-frame translations of a nucleotide query sequence against the six-frame translations of a nucleotide sequence database.</p><p>4. Scoring and E-value: BLAST results are scored based on the quality and length of the alignments. The E-value (expect value) indicates the number of alignments one can expect to find by chance, with lower E-values representing more significant matches.</p><p>5. Output Formats: BLAST provides results in various formats, including plain text, HTML, XML, and JSON, making it adaptable for different types of analyses and integrations with other tools.</p><p>Applications of BLAST:<br />- Genomic Research: Identifying genes, understanding genetic diversity, and mapping genome sequences.<br />- Protein Function Prediction: Inferring the function of unknown proteins by comparing them to known protein sequences.<br />- Evolutionary Studies: Exploring evolutionary relationships between organisms by comparing their genetic material.<br />- Medical Research: Identifying pathogens, understanding disease mechanisms, and developing treatments by comparing sequences of interest.</p><p>Overall, BLAST is an essential tool in bioinformatics, offering a reliable and efficient way to analyze and interpret biological sequence data.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37606/stellar-fast-and-exact-local-alignments</guid>
	<pubDate>Wed, 29 Aug 2018 16:00:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37606/stellar-fast-and-exact-local-alignments</link>
	<title><![CDATA[STELLAR: fast and exact local alignments]]></title>
	<description><![CDATA[<p><span>STELLAR is very practical and fast on very long sequences which makes it a suitable new tool for finding local alignments between genomic sequences under the edit distance model. Binaries are freely available for Linux, Windows, and Mac OS X at&nbsp;</span><span><a href="http://www.seqan.de/projects/stellar"><span>http://www.seqan.de/projects/stellar</span></a></span><span>.&nbsp;</span></p><p>Address of the bookmark: <a href="http://www.seqan.de/apps/stellar/" rel="nofollow">http://www.seqan.de/apps/stellar/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35635/ete-3-reconstruction-analysis-and-visualization-of-phylogenomic-data</guid>
	<pubDate>Mon, 19 Feb 2018 06:46:15 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35635/ete-3-reconstruction-analysis-and-visualization-of-phylogenomic-data</link>
	<title><![CDATA[ETE 3: Reconstruction, Analysis, and Visualization of Phylogenomic Data]]></title>
	<description><![CDATA[<p><span>ETE v3, featuring numerous improvements in the underlying library of methods, and providing a novel set of standalone tools to perform common tasks in comparative genomics and phylogenetics. </span></p>
<p><span>The new features include </span></p>
<p><span>(i) building gene-based and supermatrix-based phylogenies using a single command, </span></p>
<p><span>(ii) testing and visualizing evolutionary models, </span></p>
<p><span>(iii) calculating distances between trees of different size or including duplications, and </span></p>
<p><span>(iv) providing seamless integration with the NCBI taxonomy database. </span></p>
<p><span>ETE is freely available at&nbsp;</span><a href="http://etetoolkit.org/" target="">http://etetoolkit.org</a></p><p>Address of the bookmark: <a href="http://etetoolkit.org" rel="nofollow">http://etetoolkit.org</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44375/phyloherb-a-high%E2%80%90throughput-phylogenomic-pipeline-for-processing-genome-skimming-data</guid>
	<pubDate>Wed, 06 Sep 2023 00:14:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44375/phyloherb-a-high%E2%80%90throughput-phylogenomic-pipeline-for-processing-genome-skimming-data</link>
	<title><![CDATA[PhyloHerb: A high‐throughput phylogenomic pipeline for processing genome skimming data]]></title>
	<description><![CDATA[<p dir="auto"><span>Phylo</span>genomic Analysis Pipeline for&nbsp;<span>Herb</span>arium Specimens</p>
<p dir="auto"><span>What is PhyloHerb</span>: PhyloHerb is a wrapper program to process&nbsp;<span>genome skimming</span>&nbsp;data collected from plant materials. The outcomes include the plastid genome (plastome) assemblies, mitochondrial genome assemblies, nuclear ribosomal DNAs (NTS+ETS+18S+ITS1+5.8S+ITS2+28S), alignments of gene and intergenic regions, and a species tree. It is designed to be a high throughput program dealing with lower quality data. Examples include&nbsp;<span>low-coverage (5x cpDNA) plastome phylogeny, recycling plastid genes from target enrichment data, retrieving low-copy nuclear genes from medium coverage (5x nucDNA) genome skimming</span>.</p>
<p dir="auto"><span>License</span>: GNU General Public License</p>
<p dir="auto"><span>Citation</span>:</p>
<ul dir="auto">
<li>Cai, Liming, Hongrui Zhang, and Charles C. Davis. 2022. PhyloHerb: A high‐throughput phylogenomic pipeline for processing genome‐skimming data. Applications in Plant Sciences 10(3): 1&ndash;9.&nbsp;<a href="https://doi.org/10.1002/aps3.11475">https://doi.org/10.1002/aps3.11475</a></li>
</ul><p>Address of the bookmark: <a href="https://github.com/lmcai/PhyloHerb/" rel="nofollow">https://github.com/lmcai/PhyloHerb/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43652/peregrine-shimmer-genome-assembly-toolkit</guid>
	<pubDate>Thu, 16 Dec 2021 02:50:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43652/peregrine-shimmer-genome-assembly-toolkit</link>
	<title><![CDATA[Peregrine &amp; SHIMMER Genome Assembly Toolkit]]></title>
	<description><![CDATA[<p><span>Peregrine is a fast genome assembler for accurate long reads (length &gt; 10kb, accuracy &gt; 99%). It can assemble a human genome from 30x reads within 20 cpu hours from reads to polished consensus. It uses Sparse HIereachical MimiMizER (SHIMMER) for fast read-to-read overlaping without quadratic comparisions used in other OLC assemblers.</span></p><p>Address of the bookmark: <a href="https://github.com/cschin/Peregrine" rel="nofollow">https://github.com/cschin/Peregrine</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

</channel>
</rss>