<?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/42042?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/42042?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44479/doubletrouble-identify-duplicated-genes-from-whole-genome-protein-sequences-and-classify</guid>
	<pubDate>Tue, 05 Mar 2024 00:23:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44479/doubletrouble-identify-duplicated-genes-from-whole-genome-protein-sequences-and-classify</link>
	<title><![CDATA[doubletrouble: identify duplicated genes from whole-genome protein sequences and classify]]></title>
	<description><![CDATA[<p><span>doubletrouble aims to identify duplicated genes from whole-genome protein sequences and classify them based on their modes of duplication. The duplication modes are i. segmental duplication (SD); ii. tandem duplication (TD); iii. proximal duplication (PD); iv. transposed duplication (TRD) and; v. dispersed duplication (DD). Transposon-derived duplicates (TRD) can be further subdivided into rTRD (retrotransposon-derived duplication) and dTRD (DNA transposon-derived duplication). If users want a simpler classification scheme, duplicates can also be classified into SD- and SSD-derived (small-scale duplication) gene pairs. Besides classifying gene pairs, users can also classify genes, so that each gene is assigned a unique mode of duplication. Users can also calculate substitution rates per substitution site (i.e., Ka and Ks) from duplicate pairs, find peaks in Ks distributions with Gaussian Mixture Models (GMMs), and classify gene pairs into age groups based on Ks peaks.</span></p><p>Address of the bookmark: <a href="https://bioconductor.org/packages/release/bioc/html/doubletrouble.html" rel="nofollow">https://bioconductor.org/packages/release/bioc/html/doubletrouble.html</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/4408/fourth-branch-of-life</guid>
	<pubDate>Mon, 09 Sep 2013 21:48:37 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/4408/fourth-branch-of-life</link>
	<title><![CDATA[Fourth Branch of Life]]></title>
	<description><![CDATA[<p>Scientist have found the biggest viruses known, pandoraviruses which opened up entirely /completely... new questions questions and raise objections to in science. It even suggesting a fourth domain of life.</p><p>The new visrus are about one micron&mdash;a thousandth of a millimeter&mdash;in length, the newfound genus Pandoravirus dwarfs other viruses, which range in size from about 50 nanometers up to 100 nanometers. A genus is a taxonomic ranking between species and family.</p><p>Find&nbsp; more at @ http://www.nature.com/scitable/blog/viruses101/newly_found_pandoraviruses_hint_at</p><p>http://news.nationalgeographic.co.uk/news/2013/07/130718-viruses-pandoraviruses-science-biology-evolution/</p><p>&nbsp;</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27850/clusterprofiler</guid>
	<pubDate>Thu, 16 Jun 2016 18:57:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27850/clusterprofiler</link>
	<title><![CDATA[clusterProfiler]]></title>
	<description><![CDATA[<p>statistical analysis and visulization of functional profiles for genes and gene clusters<br><br>Bioconductor version: Release (3.3)<br><br>This package implements methods to analyze and visualize functional profiles (GO and KEGG) of gene and gene clusters.<br><br>Author: Guangchuang Yu &lt;guangchuangyu at gmail.com&gt; with contributions from Li-Gen Wang and Giovanni Dall'Olio.<br><br>Maintainer: Guangchuang Yu &lt;guangchuangyu at gmail.com&gt;<br><br>Citation (from within R, enter citation("clusterProfiler")):<br><br>Yu G, Wang L, Han Y and He Q (2012). &ldquo;clusterProfiler: an R package for comparing biological themes among gene clusters.&rdquo; OMICS: A Journal of Integrative Biology, 16(5), pp. 284-287.<br>Installation<br><br>To install this package, start R and enter:<br><br>## try http:// if https:// URLs are not supported<br>source("https://bioconductor.org/biocLite.R")<br>biocLite("clusterProfiler")</p>
<p>https://www.bioconductor.org/packages/devel/bioc/vignettes/clusterProfiler/inst/doc/clusterProfiler.html</p><p>Address of the bookmark: <a href="https://www.bioconductor.org/packages/devel/bioc/vignettes/clusterProfiler/inst/doc/clusterProfiler.html" rel="nofollow">https://www.bioconductor.org/packages/devel/bioc/vignettes/clusterProfiler/inst/doc/clusterProfiler.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29620/hybpiper</guid>
	<pubDate>Fri, 04 Nov 2016 05:02:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29620/hybpiper</link>
	<title><![CDATA[HybPiper]]></title>
	<description><![CDATA[<p>HybPiper was designed for targeted sequence capture, in which DNA sequencing libraries are enriched for gene regions of interest, especially for phylogenetics. HybPiper is a suite of Python scripts that wrap and connect bioinformatics tools in order to extract target sequences from high-throughput DNA sequencing reads.</p>
<p>Targeted bait capture is a technique for sequencing many loci simultaneously based on bait sequences. HybPiper pipeline starts with high-throughput sequencing reads (for example from Illumina MiSeq), and assigns them to target genes using BLASTx or BWA. The reads are distributed to separate directories, where they are assembled separately using SPAdes. The main output is a FASTA file of the (in frame) CDS portion of the sample for each target region, and a separate file with the translated protein sequence.</p>
<p>HybPiper also includes post-processing scripts, run after the main pipeline, to also extract the intronic regions flanking each exon, investigate putative paralogs, and calculate sequencing depth. For more information,&nbsp;<a href="https://github.com/mossmatters/HybPiper/wiki/">please see our wiki</a>.</p>
<p>HybPiper is run separately for each sample (single or paired-end sequence reads). When HybPiper generates sequence files from the reads, it does so in a standardized directory hierarchy. Many of the post-processing scripts rely on this directory hierarchy, so do not modify it after running the initial pipeline. It is a good idea to run the pipeline for each sample from the same directory. You will end up with one directory per run of HybPiper, and some of the later scripts take advantage of this predictable directory structure.</p><p>Address of the bookmark: <a href="https://github.com/mossmatters/HybPiper" rel="nofollow">https://github.com/mossmatters/HybPiper</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40505/decostar-reconstructing-the-ancestral-organization-of-genes-or-genomes-using-reconciled-phylogenies</guid>
	<pubDate>Fri, 03 Jan 2020 13:28:19 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40505/decostar-reconstructing-the-ancestral-organization-of-genes-or-genomes-using-reconciled-phylogenies</link>
	<title><![CDATA[DeCoSTAR: Reconstructing the Ancestral Organization of Genes or Genomes Using Reconciled Phylogenies]]></title>
	<description><![CDATA[<p>DeCoSTAR computes adjacency evolutionary scenarios using a scoring scheme based on a weighted sum of adjacency gains and breakages. Solutions, both optimal and near-optimal, are sampled according to the Boltzmann&ndash;Gibbs distribution centered around parsimonious solutions, and statistical supports on ancestral and extant adjacencies are provided. DeCoSTAR supports the features of previously contributed tools that reconstruct ancestral adjacencies, namely DeCo, DeCoLT, ART-DeCo, and DeClone. In a few minutes, DeCoSTAR can reconstruct the evolutionary history of domains inside genes, of gene fusion and fission events, or of gene order along chromosomes, for large data sets including dozens of whole genomes from all kingdoms of life.</p><p>Address of the bookmark: <a href="https://github.com/YoannAnselmetti/DeCoSTAR_pipeline" rel="nofollow">https://github.com/YoannAnselmetti/DeCoSTAR_pipeline</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35619/tallymer-method-to-compute-k-mer-frequencies-and-its-application-to-annotate-large-repetitive-plant-genomes</guid>
	<pubDate>Thu, 15 Feb 2018 10:21:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35619/tallymer-method-to-compute-k-mer-frequencies-and-its-application-to-annotate-large-repetitive-plant-genomes</link>
	<title><![CDATA[Tallymer: method to compute K-mer frequencies and its application to annotate large repetitive plant genomes]]></title>
	<description><![CDATA[<p>Tallymer is based on enhanced suffix arrays. This gives a much larger flexibility concerning the choice of the&nbsp;<span>k</span>-mer size. Tallymer can process large data sizes of several billion bases. We used it in a variety of applications to study the genomes of maize and other plant species. In particular, Tallymer was used to index a set whole genome shotgun sequences from maize (B73) (total size 10<sup>9</sup>&nbsp;bp).&nbsp;<br>Tallymer was effective in a variety of applications to aid genome annotation in maize, despite limitations imposed by the relatively low coverage of sequence available.</p>
<p>A manual can be found&nbsp;<a href="https://www.zbh.uni-hamburg.de/fileadmin/gi/tallymer/tallymer.pdf" target="_blank" title="tallymer.pdf (111 KB)">here</a>.</p><p>Address of the bookmark: <a href="https://www.zbh.uni-hamburg.de/forschung/arbeitsgruppe-genominformatik/software/tallymer.html" rel="nofollow">https://www.zbh.uni-hamburg.de/forschung/arbeitsgruppe-genominformatik/software/tallymer.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38212/megahit-an-ultra-fast-single-node-solution-for-large-and-complex-metagenomics-assembly-via-succinct-de-bruijn-graph</guid>
	<pubDate>Wed, 14 Nov 2018 04:50:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38212/megahit-an-ultra-fast-single-node-solution-for-large-and-complex-metagenomics-assembly-via-succinct-de-bruijn-graph</link>
	<title><![CDATA[MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph]]></title>
	<description><![CDATA[<p><span>MEGAHIT is a single node assembler for large and complex metagenomics NGS reads, such as soil. It makes use of succinct&nbsp;</span><em>de Bruijn</em><span>&nbsp;graph (SdBG) to achieve low memory assembly. MEGAHIT can&nbsp;</span><span>optionally</span><span>&nbsp;utilize a CUDA-enabled GPU to accelerate its SdBG contstruction. The GPU-accelerated version of MEGAHIT has been tested on NVIDIA GTX680 (4G memory) and Tesla K40c (12G memory) with CUDA 5.5, 6.0 and 6.5. MEGAHIT v1.0 or greater also supports IBM Power PC and has been tested on IBM POWER8.</span></p>
<p><span>https://academic.oup.com/bioinformatics/article/31/10/1674/177884</span></p><p>Address of the bookmark: <a href="https://github.com/voutcn/megahit" rel="nofollow">https://github.com/voutcn/megahit</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43770/chromeister-an-ultra-fast-heuristic-approach-to-detect-conserved-signals-in-extremely-large-pairwise-genome-comparisons</guid>
	<pubDate>Thu, 03 Feb 2022 04:01:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43770/chromeister-an-ultra-fast-heuristic-approach-to-detect-conserved-signals-in-extremely-large-pairwise-genome-comparisons</link>
	<title><![CDATA[chromeister: An ultra fast, heuristic approach to detect conserved signals in extremely large pairwise genome comparisons.]]></title>
	<description><![CDATA[<p>chromeister: An ultra fast, heuristic approach to detect conserved signals in extremely large pairwise genome comparisons.</p>
<p dir="auto">USAGE:</p>
<ul dir="auto">
<li>-query: sequence A in fasta format</li>
<li>-db: sequence B in fasta format</li>
<li>-out: output matrix</li>
<li>-kmer Integer: k&gt;1 (default 32) Use 32 for chromosomes and genomes and 16 for small bacteria</li>
<li>-diffuse Integer: z&gt;0 (default 4) Use 4 for everything - if using large plant genomes you can try using 1</li>
<li>-dimension Size of the output matrix and plot. Integer: d&gt;0 (default 1000) Use 1000 for everything that is not full genome size, where 2000 is recommended</li>
</ul><p>Address of the bookmark: <a href="https://github.com/estebanpw/chromeister" rel="nofollow">https://github.com/estebanpw/chromeister</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/35395/comprehensive-list-of-visualization-tools-for-biological-pathways</guid>
	<pubDate>Tue, 30 Jan 2018 06:01:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/35395/comprehensive-list-of-visualization-tools-for-biological-pathways</link>
	<title><![CDATA[Comprehensive list of visualization tools for biological pathways]]></title>
	<description><![CDATA[<p>The study of biological pathways is a key to understand the different processes inside a cell: proteins exert their function not in isolation but in a tightly controlled network of interactions and reactions. Activation of a pathway typically leads to a change of state in the cell. Pathways come in different flavors, depending on their functions in the cell &ndash; the three main types are metabolic pathways, gene regulatory pathways, and signaling pathways. These biological pathways and networks are not only an appropriate approach to visualize molecular reactions. They have also become one leading method in -omics data analysis and visualization.</p><p><img src="https://photos-1.dropbox.com/t/2/AABemz29qAuSTqSzr5mEsQE7JIMxZlU1CBy0E5n0yUVYbA/12/85115969/png/32x32/1/_/1/2/pathway.png/EOfXoUIYrJ8CIAcoBw/01qsT2eykyPvSH-rNpy3cqioDzZPc4i-xULG3BEZvCk?preserve_transparency=1&amp;size=1280x960&amp;size_mode=3" width="800" height="533" alt="image" style="border: 0px;"></p><p>Following are the comprehensive list of visualization tools for biological pathways:</p><p>BiNA</p><p>Drawings of metabolic networks supporting hiding of cofactors and drawing of chemical structures</p><p>http://bina.unipax.info/</p><p>BioTapestry</p><p>Interactive tool for building, visualizing and sharing gene regulatory network models over the web</p><p>http://www.biotapestry.org/</p><p>Caleydo</p><p>Visual analysis framework targeted at biomolecular data. Visualization of interdependencies between multiple datasets</p><p>http://www.caleydo.org/</p><p>CellDesigner</p><p>A modeling tool for biochemical networks</p><p>http://www.celldesigner.org/</p><p>Edinburgh Pathway Editor</p><p>Edit and draw pathway diagrams</p><p>http://epe.sourceforge.net/SourceForge/EPE.html</p><p>GenMAPP</p><p>Visualization of gene expression and other genomic data on maps representing biological pathways and groupings of genes</p><p>http://www.genmapp.org/</p><p>Ingenuity IPA</p><p>Data integration platform and manually annotated pathways</p><p>http://tinyurl.com/IngenuityPath</p><p>JDesigner</p><p>Graphical modeling environment for biochemical reaction networks</p><p>http://jdesigner.sourceforge.net/Site/JDesigner.html</p><p>KaPPA View</p><p>Plant pathways</p><p>http://kpv.kazusa.or.jp/</p><p>KEGG Atlas</p><p>Interactive Kyoto Encyclopedia of Genes and Genomes pathways</p><p>http://www.genome.jp/kegg/</p><p>Omix&nbsp;</p><p>Visualizing multi-omics data in metabolic networks</p><p>https://www.omix-visualization.com</p><p>PathVisio&nbsp;</p><p>Biological pathway analysis software that allows drawing, editing and analysis of biological pathways</p><p>http://www.pathvisio.org/</p><p>VitaPad&nbsp;</p><p>Application to visualize biological pathways and map experimental data to them</p><p>http://tinyurl.com/vitapad/</p><p>Web tools for pathways</p><p>ArrayXPath&nbsp;</p><p>Mapping and visualizing microarray gene-expression data and integrated biological pathway resources using SVG</p><p>http://tinyurl.com/ArrayXPath/</p><p>GEPAT&nbsp;</p><p>Integrated analysis of transcriptome data in genomic, proteomic and metabolic contexts</p><p>http://gepat.sourceforge.net/</p><p>iPath&nbsp;</p><p>Web-based tool for the visualization, analysis and customization of pathway maps</p><p>http://pathways.embl.de/</p><p>Kegg-Based Viewer&nbsp;</p><p>KEGG-based pathway visualization tool for complex high-throughput data</p><p>http://www.g-language.org/data/marray/</p><p>MapMan&nbsp;</p><p>User-driven tool that displays large datasets onto diagrams of metabolic pathways or other processes</p><p>http://mapman.gabipd.org/web/guest/mapman</p><p>MetPA&nbsp;</p><p>Analysis and visualization of metabolomic data within the biological context of metabolic pathways</p><p>http://metpa.metabolomics.ca</p><p>Omics Viewer&nbsp;</p><p>Data mapping on BioCyc pathways (collection of 5500 pathway/genome databases)</p><p>http://www.biocyc.org/</p><p>Pathway Explorer</p><p>Interactive Java drawing tool for the construction of biological pathway diagrams in a visual way and the annotation of the components and interactions between them</p><p>http://genome.tugraz.at/pathwayexplorer/pathwayexplorer_description.shtml</p><p>Pathway projector&nbsp;</p><p>Zoomable pathway browser using KEGG atlas and Google Maps API</p><p>http://www.g-language.org/PathwayProjector/</p><p>PATIKA&nbsp;</p><p>Integrated environment composed of a central database and a visual editor, built around an extensive ontology and an integration framework</p><p>http://www.cs.bilkent.edu.tr/~patikaweb/</p><p>Reactome SkyPainter&nbsp;</p><p>Visualization of over-represented pathways and reactions from gene lists</p><p>http://www.reactome.org/skypainter-2</p><p>WikiPathways</p><p>Wiki-based, open, public platform dedicated to the curation of biological pathways by and for the scientific community</p><p>http://www.wikipathways.org/</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40212/kalign-fast-multiple-sequence-alignment-program-for-biological-sequences</guid>
	<pubDate>Fri, 01 Nov 2019 00:20:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40212/kalign-fast-multiple-sequence-alignment-program-for-biological-sequences</link>
	<title><![CDATA[Kalign: fast multiple sequence alignment program for biological sequences.]]></title>
	<description><![CDATA[<p><span>Kalign is a fast multiple sequence alignment program for biological sequences.</span></p>
<p>Align sequences and output the alignment in MSF format:</p>
<pre><code>kalign -i BB11001.tfa -f msf  -o out.msf
</code></pre>
<p>Align sequences and output the alignment in clustal format:</p>
<pre><code>kalign -i BB11001.tfa -f clu -o out.clu
</code></pre>
<p>Re-align sequences in an existing alignment:</p>
<pre><code>kalign -i BB11001.msf  -o out.afa
</code></pre>
<p>Reformat existing alignment:</p>
<pre><code>kalign -i BB11001.msf -r afa -o out.afa</code></pre><p>Address of the bookmark: <a href="https://github.com/TimoLassmann/kalign" rel="nofollow">https://github.com/TimoLassmann/kalign</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>