<?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/38541?offset=160</link>
	<atom:link href="https://bioinformaticsonline.com/related/38541?offset=160" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45299/the-gene-detectives-how-a-new-computational-tool-is-helping-us-read-the-history-written-in-our-genes</guid>
	<pubDate>Thu, 10 Sep 2026 21:23:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45299/the-gene-detectives-how-a-new-computational-tool-is-helping-us-read-the-history-written-in-our-genes</link>
	<title><![CDATA[The Gene Detectives: How a New Computational Tool Is Helping Us Read the History Written in Our Genes]]></title>
	<description><![CDATA[<p>Imagine opening an ancient family album with no names, dates, or captions. Some photographs are missing, others have been copied, and a few show people who look almost identical. Your challenge is to discover who is related to whom and reconstruct the family story. In evolutionary biology, scientists face a similar mystery when they study genes. Every genome contains clues about its past, but genes can be duplicated, lost, and changed over millions of years, making their history difficult to trace.</p><p>A recent study published in PLOS Computational Biology introduces REvolutionH-tl 2.0 (https://pypi.org/project/revolutionhtl/), a computational tool designed to help solve this mystery. The software analyzes protein sequences and identifies evolutionary relationships between genes. It can help researchers detect important events such as gene duplication, gene loss, and speciation, allowing them to reconstruct how genes evolved across different organisms.</p><p>What makes the tool especially interesting is its focus on both speed and interpretation. The researchers compared REvolutionH-tl 2.0 with several existing computational tools and reported that it achieved competitive accuracy while requiring less computational time in their tests. The tool also includes visualization features, helping researchers turn complicated genetic data into evolutionary stories that are easier to explore.</p><p>Genes are more than simple sequences of DNA; they are records of life&rsquo;s long history. Each surviving gene carries traces of the changes that shaped it. By bringing together computational analysis and visualization, REvolutionH-tl 2.0 acts like a detective, helping scientists uncover these hidden stories. Ultimately, tools like this can improve our understanding of how genomes evolved and how genes acquired the roles they perform today.</p><p>More at&nbsp;https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1013017</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33651/darkhorse-a-method-for-genome-wide-prediction-of-horizontal-gene-transfer</guid>
	<pubDate>Thu, 22 Jun 2017 07:58:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33651/darkhorse-a-method-for-genome-wide-prediction-of-horizontal-gene-transfer</link>
	<title><![CDATA[DarkHorse: a method for genome-wide prediction of horizontal gene transfer]]></title>
	<description><![CDATA[<p><span>A new approach to rapid, genome-wide identification and ranking of horizontal transfer candidate proteins is presented. The method is quantitative, reproducible, and computationally undemanding. It can be combined with genomic signature and/or phylogenetic tree-building procedures to improve accuracy and efficiency. The method is also useful for retrospective assessments of horizontal transfer prediction reliability, recognizing orthologous sequences that may have been previously overlooked or unavailable. These features are demonstrated in bacterial, archaeal, and eukaryotic examples.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1852411/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1852411/</a></p>]]></description>
	<dc:creator>Jit</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/42362/magic-a-tool-for-predicting-transcription-factors-and-cofactors-driving-gene-sets-using-encode-data</guid>
	<pubDate>Thu, 26 Nov 2020 11:05:04 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42362/magic-a-tool-for-predicting-transcription-factors-and-cofactors-driving-gene-sets-using-encode-data</link>
	<title><![CDATA[MAGIC: A tool for predicting transcription factors and cofactors driving gene sets using ENCODE data]]></title>
	<description><![CDATA[<p><span>The algorithm presented herein,&nbsp;</span><strong>M</strong><span>ining&nbsp;</span><strong>A</strong><span>lgorithm for&nbsp;</span><strong>G</strong><span>enet</span><strong>I</strong><span>c&nbsp;</span><strong>C</strong><span>ontrollers (MAGIC), uses ENCODE ChIP-seq data to look for statistical enrichment of TFs and cofactors in gene bodies and flanking regions in gene lists without an&nbsp;</span><em>a priori</em><span>&nbsp;binary classification of genes as targets or non-targets. When compared to other TF mining resources, MAGIC displayed favourable performance in predicting TFs and cofactors that drive gene changes in 4 settings: </span></p>
<p><span>1) A cell line expressing or lacking single TF, </span></p>
<p><span>2) Breast tumors divided along PAM50 designations </span></p>
<p><span>3) Whole brain samples from WT mice or mice lacking a single TF in a particular neuronal subtype </span></p>
<p><span>4) Single cell RNAseq analysis of neurons divided by Immediate Early Gene expression levels. </span></p>
<p><span>In summary, MAGIC is a standalone application that produces meaningful predictions of TFs and cofactors in transcriptomic experiments.</span></p>
<p><span>More at&nbsp;https://uwmadison.app.box.com/s/8j90e5h2rjrsz3bacaxnq8kor2o64vyg</span></p><p>Address of the bookmark: <a href="https://github.com/asroopra/MAGIC" rel="nofollow">https://github.com/asroopra/MAGIC</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44476/omark-software-for-proteome-protein-coding-gene-repertoire-quality-assessment</guid>
	<pubDate>Wed, 21 Feb 2024 15:01:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44476/omark-software-for-proteome-protein-coding-gene-repertoire-quality-assessment</link>
	<title><![CDATA[OMArk: software for proteome (protein-coding gene repertoire) quality assessment]]></title>
	<description><![CDATA[<p><span>OMArk is a software for proteome (protein-coding gene repertoire) quality assessment. It provides measures of proteome completeness, characterizes the consistency of all protein coding genes with regard to their homologs, and identifies the presence of contamination from other species. OMArk relies on the OMA orthology database, from which it exploits orthology relationships, and on the OMAmer software for fast placement of all proteins into gene families.</span></p><p>Address of the bookmark: <a href="https://github.com/DessimozLab/OMArk" rel="nofollow">https://github.com/DessimozLab/OMArk</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36746/soap2-short-oligonucleotide-analysis-package-2</guid>
	<pubDate>Wed, 23 May 2018 10:09:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36746/soap2-short-oligonucleotide-analysis-package-2</link>
	<title><![CDATA[SOAP2 : Short Oligonucleotide Analysis Package 2]]></title>
	<description><![CDATA[SOAPaligner/soap2 is a member of the SOAP (Short Oligonucleotide Analysis Package). It is an updated version of SOAP software for short oligonucleotide alignment. The new program features in super fast and accurate alignment for huge amounts of short reads generated by Illumina/Solexa Genome Analyzer. Compared to soap v1, it is one order of magnitude faster. It require only 2 minutes aligning one million single-end reads onto the human reference genome. Another remarkable improvement of SOAPaligner is that it now supports a wide range of the read length.

SOAPaligner benefitted in time and space efficiency by a revolution in the basic data structures and algorithms used.The core algorithms and the indexing data structures (2way-BWT) are developed by the algorithms research group of the Department of Computer Science, the University of Hong Kong (T.W. Lam, Alan Tam, Simon Wong, Edward Wu and S.M. Yiu).<p>Address of the bookmark: <a href="http://soap.genomics.org.cn/soapaligner.html" rel="nofollow">http://soap.genomics.org.cn/soapaligner.html</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41691/genobuntu-package-for-next-generation-sequencing-and-genome-assembly</guid>
	<pubDate>Mon, 18 May 2020 16:47:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41691/genobuntu-package-for-next-generation-sequencing-and-genome-assembly</link>
	<title><![CDATA[Genobuntu: Package for Next Generation Sequencing and Genome Assembly]]></title>
	<description><![CDATA[<div>
<p>Genobuntu is a software package containing more than 70 software and packages oriented towards NGS. In its current version, Genobuntu supports pre assembly tools, genome assemblers as well as post assembly tools.<br><br>Commonly used biological software and example script files for different assembly pipelines have also been provided, where the example script files can be updated to suit one&rsquo;s experimental needs. Genobuntu attempts to reduce the amount of time and energy needed to build software workstations and it can also act as a good teaching source for a class room setting.<br><br>Therefore, Genobuntu offers a well-tailored environment for both novices and experts working in the field of genome assembly.</p>
</div>
<div>
<h3>Features</h3>
<ul>
<li>Velvet</li>
<li>MiB</li>
<li>SSAKE</li>
<li>EULER</li>
<li>VCAKE</li>
<li>ABySS</li>
<li>ALLPATHS</li>
<li>Celera</li>
<li>SHARCGS</li>
<li>Allpaths</li>
<li>IDBA</li>
<li>TAIPAN</li>
<li>Edena</li>
<li>SOAPdenovo</li>
<li>Maq</li>
<li>IDBA-UD</li>
<li>No. of Reads present in the Ref. Seq.</li>
<li>ART NGS Reads Simulator</li>
<li>HiTEC, FASTQC</li>
<li>Minimum Description Length</li>
<li>SOAPaligner</li>
<li>Sequencing Read Archive Toolkit</li>
</ul>
</div><p>Address of the bookmark: <a href="https://sourceforge.net/projects/genobuntu/" rel="nofollow">https://sourceforge.net/projects/genobuntu/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38413/genobuntu-a-software-package-containing-more-than-70-software-and-packages-oriented-towards-ngs-and-genome-assembly</guid>
	<pubDate>Tue, 11 Dec 2018 05:15:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38413/genobuntu-a-software-package-containing-more-than-70-software-and-packages-oriented-towards-ngs-and-genome-assembly</link>
	<title><![CDATA[Genobuntu: A software package containing more than 70 software and packages oriented towards NGS and genome assembly]]></title>
	<description><![CDATA[<p><span>Genobuntu is a software package containing more than 70 software and packages oriented towards NGS. In its current version, Genobuntu supports pre assembly tools, genome assemblers as well as post assembly tools.&nbsp;</span><br><br><span>Commonly used biological software and example script files for different assembly pipelines have also been provided, where the example script files can be updated to suit one&rsquo;s experimental needs. Genobuntu attempts to reduce the amount of time and energy needed to build software workstations and it can also act as a good teaching source for a class room setting.&nbsp;</span></p>
<p>https://sourceforge.net/projects/genobuntu/</p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/genobuntu/" rel="nofollow">https://sourceforge.net/projects/genobuntu/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41006/netgo-r-shiny-package-for-network-integrated-pathway-enrichment-analysis</guid>
	<pubDate>Wed, 12 Feb 2020 12:40:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41006/netgo-r-shiny-package-for-network-integrated-pathway-enrichment-analysis</link>
	<title><![CDATA[netGO: R-Shiny package for network-integrated pathway enrichment analysis]]></title>
	<description><![CDATA[<p>netGO is an R/Shiny package for network-integrated pathway enrichment analysis.<br>netGO provides user-interactive visualization of enrichment analysis results and related networks.</p>
<p>Currently, netGO supports analysis for four species (<em><a href="https://github.com/unistbig/netGO-Data/tree/master/Human">Human</a>,&nbsp;<a href="https://github.com/unistbig/netGO-Data/tree/master/Mouse">Mouse</a>,&nbsp;<a href="https://github.com/unistbig/netGO-Data/tree/master/Arabidopsis">Arabidopsis thaliana</a>,and&nbsp;<a href="https://github.com/unistbig/netGO-Data/tree/master/Yeast">Yeast</a></em>)<br>These data are available from&nbsp;<a href="https://github.com/unistbig/netGO-Data">netGO-Data</a>&nbsp;repository.</p>
<p><a href="https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa077/5728635">https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa077/5728635</a></p><p>Address of the bookmark: <a href="https://github.com/unistbig/netGO" rel="nofollow">https://github.com/unistbig/netGO</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42359/dnasp-dna-sequence-polymorphism-is-a-software-package-for-the-analysis-of-dna-polymorphisms</guid>
	<pubDate>Wed, 25 Nov 2020 19:51:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42359/dnasp-dna-sequence-polymorphism-is-a-software-package-for-the-analysis-of-dna-polymorphisms</link>
	<title><![CDATA[DnaSP: DNA Sequence Polymorphism, is a software package for the analysis of DNA polymorphisms]]></title>
	<description><![CDATA[<p><span>DnaSP, DNA Sequence Polymorphism, is a software package for the analysis of DNA polymorphisms using data from a single locus (a multiple sequence aligned -MSA data), or from several loci (a Multiple-MSA data, such as formats generated by some assembler RAD-seq software). DnaSP can estimate several measures of DNA sequence variation within and between populations in noncoding, synonymous or nonsynonymous sites, or in various sorts of codon positions), as well as linkage disequilibrium, recombination, gene flow and gene conversion parameters.</span></p><p>Address of the bookmark: <a href="http://www.ub.edu/dnasp/" rel="nofollow">http://www.ub.edu/dnasp/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>