<?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/34567?offset=20</link>
	<atom:link href="https://bioinformaticsonline.com/related/34567?offset=20" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44491/cgviewjs-is-a-circular-genome-viewing-tool</guid>
	<pubDate>Wed, 27 Mar 2024 11:16:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44491/cgviewjs-is-a-circular-genome-viewing-tool</link>
	<title><![CDATA[CGView.js is a Circular Genome Viewing tool]]></title>
	<description><![CDATA[<p>CGView.js is a&nbsp;<span>C</span>ircular&nbsp;<span>G</span>enome&nbsp;<span>View</span>ing tool for visualizing and interacting with small genomes. This software is an adaptation of the Java program&nbsp;<a href="https://paulstothard.github.io/cgview/">CGView</a>.</p>
<div>
<p>CGView.js is the genome viewer of Proksee, an expert system for genome assembly, annotation and visualization.</p>
<a href="https://proksee.ca/"></a></div>
<h1 id="features">Features</h1>
<ul>
<li>
<p>Circular and linear views of genomes</p>
</li>
<li>
<p>Capable of drawing genomes up to 10 Mbp with 1000's of features and 100's contigs</p>
</li>
<li>
<p>Smooth zooming down to the sequence level</p>
</li>
<li>
<p>Easily generate features and plots directly form the sequence (e.g. ORFs, GC-content and GC-Skew)</p>
</li>
<li>
<p>Save high resolution PNG maps up to 8000x8000px</p>
</li>
<li>
<p>Fully documented API for interacting with CGView.js maps</p>
</li>
</ul><p>Address of the bookmark: <a href="https://js.cgview.ca/" rel="nofollow">https://js.cgview.ca/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44766/genome-simulation-with-slim-and-msprime</guid>
	<pubDate>Fri, 31 Jan 2025 12:47:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44766/genome-simulation-with-slim-and-msprime</link>
	<title><![CDATA[Genome Simulation with SLiM and msprime]]></title>
	<description><![CDATA[<p>Genome simulation is an essential tool in population genetics, enabling researchers to model evolutionary processes and study genetic variation. Two widely used simulation tools in this field are <strong style="font-size: 12.8px;">SLiM</strong><span style="font-size: 12.8px; font-weight: normal;"> and </span><strong style="font-size: 12.8px;">msprime</strong><span style="font-size: 12.8px; font-weight: normal;">. While both serve different purposes, they can be used together with the </span><strong style="font-size: 12.8px;">slendr</strong><span style="font-size: 12.8px; font-weight: normal;"> framework to compare simulation outputs effectively.</span></p><h2>Overview of SLiM and msprime</h2><h3>SLiM: Forward Genetic Simulator</h3><p>SLiM is a <strong>free, open-source</strong> tool designed for forward genetic simulations. It allows researchers to model complex evolutionary scenarios, including selection, recombination, and demographic events, making it particularly useful for studying adaptation and selection in populations.</p><p><strong>Key Features of SLiM:</strong></p><ul>
<li>
<p>Simulates population evolution forward in time</p>
</li>
<li>
<p>Supports custom evolutionary models using an embedded scripting language</p>
</li>
<li>
<p>Allows modeling of spatial and ecological dynamics</p>
</li>
<li>
<p>Provides high flexibility and extensibility for user-defined scenarios</p>
</li>
<li>
<p>Available on GitHub as an open-source project</p>
</li>
</ul><h3>msprime: Ancestry and Mutation Simulator</h3><p>msprime is an efficient, <strong>open-source</strong> tool that simulates ancestry and mutations using a coalescent framework. It is known for its high-speed performance and low memory requirements, making it a popular choice for large-scale genomic simulations.</p><p><strong>Key Features of msprime:</strong></p><ul>
<li>
<p>Implements coalescent simulations for ancestry modeling</p>
</li>
<li>
<p>Efficiently simulates large population histories</p>
</li>
<li>
<p>Supports the addition of mutations to genealogies</p>
</li>
<li>
<p>Developed using an open-source community model</p>
</li>
<li>
<p>Often faster and more memory-efficient than alternative simulators</p>
</li>
</ul><h2>Using SLiM and msprime with slendr</h2><p>Both SLiM and msprime can be integrated with <strong>slendr</strong>, a framework that facilitates structured population genetic simulations. This integration allows for seamless comparison of simulation outputs.</p><h3>How They Work Together:</h3><ul>
<li>
<p>SLiM and msprime simulations can be analyzed within slendr.</p>
</li>
<li>
<p>The <strong>ts_read()</strong> function in slendr enables loading and comparing tree sequence outputs from both simulators.</p>
</li>
<li>
<p>This integration allows researchers to validate simulation results and gain deeper insights into evolutionary processes.</p>
</li>
</ul><h2>Performance Considerations</h2><p>While SLiM offers powerful forward simulations with extensive customization, msprime is often preferred for its <strong>speed and memory efficiency</strong> when simulating ancestry and mutations. The choice between the two depends on the research goals:</p><ul>
<li>
<p><strong>For detailed evolutionary modeling with selection and recombination:</strong> Use SLiM.</p>
</li>
<li>
<p><strong>For large-scale coalescent simulations with mutations:</strong> Use msprime.</p>
</li>
<li>
<p><strong>For comparing different simulation models and their outputs:</strong> Use slendr to integrate SLiM and msprime results.</p>
</li>
</ul><h2>Conclusion</h2><p>SLiM and msprime are valuable tools for genome simulation, each serving distinct but complementary purposes in population genetics research. By leveraging the strengths of both simulators with slendr, researchers can conduct robust and efficient evolutionary simulations, enhancing our understanding of genetic diversity and adaptation.</p><p>For more information, check out the official GitHub repositories for <strong>SLiM</strong> and <strong>msprime</strong>, and explore the <strong>slendr</strong> framework for streamlined simulation workflow</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45349/finding-the-hidden-switches-the-story-of-kinext-and-protein-kinases</guid>
	<pubDate>Thu, 24 Sep 2026 02:51:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45349/finding-the-hidden-switches-the-story-of-kinext-and-protein-kinases</link>
	<title><![CDATA[Finding the Hidden Switches: The Story of KiNext and Protein Kinases]]></title>
	<description><![CDATA[<p>Every newly sequenced genome contains thousands of proteins, but identifying what each protein does is a much harder task. Among these proteins are protein kinases, important molecular regulators that control processes such as cell growth, development, metabolism, stress responses, and signaling. Finding these kinases and determining which families they belong to can reveal important clues about how an organism functions and has evolved.</p><p>This is where KiNext comes into the picture. Introduced in a 2024 study published in BMC Bioinformatics, KiNext is a computational workflow designed to identify and classify protein kinases from predicted protein sequences. Instead of relying on a single search method, it brings together several approaches, including Hidden Markov Models, sequence alignment, phylogenetic analysis, and structural comparison.</p><p>The search begins with a simple question: does a protein contain the characteristics of a kinase? Protein kinases can change considerably during evolution, but important regions of their sequences often retain recognizable patterns. KiNext uses Hidden Markov Models, or HMMs, to detect these patterns. An HMM does not require a protein to be an exact match to a known kinase. Instead, it looks for a statistical sequence signature associated with kinase proteins, making it possible to detect more distant candidates.</p><p>Once potential kinases are identified, KiNext takes the analysis further. It distinguishes conventional eukaryotic protein kinases from atypical protein kinases and then attempts to classify them into different kinase groups and families. This distinction is important because simply identifying a protein as a kinase does not tell the complete story. Different kinase families can have very different evolutionary histories and biological functions.</p><p>The next stage brings evolution into the picture. KiNext can align kinase sequences and construct phylogenetic trees, allowing researchers to examine how newly identified proteins are related to previously characterized kinases. When sequence evidence alone is difficult to interpret, structural information can provide another clue. The workflow can incorporate AlphaFold-predicted structures and Foldseek-based structural comparisons to investigate whether an unusual protein resembles known kinase structures.</p><p>The researchers tested KiNext using two very different organisms: the Pacific oyster, Crassostrea gigas, and the green alga Ostreococcus tauri. In C. gigas, KiNext recovered previously reported kinases while identifying additional candidates. Structural analysis provided further evidence for many of the newly detected proteins. In O. tauri, the workflow similarly recovered most previously reported kinases and identified additional candidates while refining some of their classifications.</p><p>What makes KiNext particularly interesting is not just its ability to find kinases, but how the entire analysis is organized. The workflow uses Nextflow, allowing the different computational steps to be connected into a reproducible pipeline. Containers can also help manage software dependencies, making it easier to run the workflow across different computing environments.</p><p>This reproducibility becomes increasingly important as the number of available genomes continues to grow. A researcher studying one organism may be able to perform an analysis manually, but repeating the same process across hundreds or thousands of genomes quickly becomes impractical. A standardized workflow provides a way to perform the analysis consistently while keeping track of how the results were generated.</p><p>At its core, KiNext demonstrates a broader change taking place in modern genomics. Sequencing a genome provides an enormous amount of information, but the real scientific challenge begins afterward: understanding what all those sequences mean. Protein kinases are only one part of this larger puzzle, yet they are particularly important because they act as molecular switches throughout the cell.</p><p>By combining sequence profiles, evolutionary analysis, and structural evidence within a reproducible computational framework, KiNext provides researchers with a systematic way to uncover these molecular switches. Its real value lies not only in finding more kinases, but in making the process scalable, repeatable, and easier to apply to new genomes.</p><p>As genome sequencing continues to expand across the tree of life, tools such as KiNext can help turn enormous collections of protein sequences into meaningful biological stories&mdash;one kinase at a time.</p><p>Read more about it @</p><p>https://link.springer.com/article/10.1186/s12859-024-05953-w</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36605/hello-python-world</guid>
	<pubDate>Mon, 14 May 2018 16:41:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36605/hello-python-world</link>
	<title><![CDATA[Hello Python World !]]></title>
	<description><![CDATA[<p>As I mentioned earlier, I will keep on posting one Python script per day to introduce you to Python programming. Whether you are an experienced programmer or not, this tutorial is intended for everyone who wishes to learn the Python programming language.</p><p>Python is a very simple language, and has a very straightforward syntax. The simplest directive in Python is the "print" directive - it simply prints out a line (and also includes a newline).</p><p>Create a file Hello.py</p><blockquote><p>print("Hello, Python World !.")</p></blockquote><p>Run</p><p>python3 Hello.py</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34328/dfast-a-flexible-prokaryotic-genome-annotation-pipeline-for-faster-genome-publication</guid>
	<pubDate>Tue, 14 Nov 2017 10:26:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34328/dfast-a-flexible-prokaryotic-genome-annotation-pipeline-for-faster-genome-publication</link>
	<title><![CDATA[DFAST: a flexible prokaryotic genome annotation pipeline for faster genome publication]]></title>
	<description><![CDATA[<p>We developed a prokaryotic genome annotation pipeline, DFAST, that also supports genome submission to public sequence databases. DFAST was originally started as an on-line annotation server, and to date, over 7,000 jobs have been processed since its first launch in 2016. Here, we present a newly implemented background annotation engine for DFAST, which is also available as a standalone command-line program. The new engine can annotate a typical-sized bacterial genome within 10 minutes, with rich information such as pseudogenes, translation exceptions, and orthologous gene assignment between given reference genomes. In addition, the modular framework of DFAST allows users to customize the annotation workflow easily and will also facilitate extensions for new functions and incorporation of new tools in the future.</p>
<div>Availability and Implementation</div>
<p>The software is implemented in Python 3 and runs in both Python 2.7 and 3.4&ndash; on Macintosh and Linux systems. It is freely available at&nbsp;<a href="https://github.com/nigyta/dfast_core/" target="">https://github.com/nigyta/dfast_core/</a>&nbsp;under the GPLv3 license with external binaries bundled in the software distribution. An on-line version is also available at&nbsp;<a href="https://dfast.nig.ac.jp/" target="">https://dfast.nig.ac.jp/</a>.</p><p>Address of the bookmark: <a href="https://dfast.nig.ac.jp/" rel="nofollow">https://dfast.nig.ac.jp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37306/genome-u-plot-a-whole-genome-visualization</guid>
	<pubDate>Fri, 13 Jul 2018 19:50:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37306/genome-u-plot-a-whole-genome-visualization</link>
	<title><![CDATA[Genome U-Plot: a whole genome visualization]]></title>
	<description><![CDATA[<p><span>Genome U-Plot for producing clear and intuitive graphs that allows researchers to generate novel insights and hypotheses by visualizing SVs such as deletions, amplifications, and chromoanagenesis events. The main features of the Genome U-Plot are its layered layout, its high spatial resolution and its improved aesthetic qualities.&nbsp;</span></p>
<p><span>https://github.com/gaitat/GenomeUPlot</span></p><p>Address of the bookmark: <a href="https://github.com/gaitat/GenomeUPlot" rel="nofollow">https://github.com/gaitat/GenomeUPlot</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43791/comparative-genomics-visualisation-tools</guid>
	<pubDate>Thu, 17 Feb 2022 05:37:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43791/comparative-genomics-visualisation-tools</link>
	<title><![CDATA[Comparative genomics visualisation tools !]]></title>
	<description><![CDATA[<p>Comparative genomics visualisation tools !</p><p>Address of the bookmark: <a href="https://cmdcolin.github.io/awesome-genome-visualization/?latest=true&amp;selected=%23BRIG&amp;tag=Comparative" rel="nofollow">https://cmdcolin.github.io/awesome-genome-visualization/?latest=true&amp;selected=%23BRIG&amp;tag=Comparative</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27090/canu-assembling-large-genomes-with-single-molecule-sequencing-and-locality-sensitive-hashing</guid>
	<pubDate>Tue, 26 Apr 2016 11:38:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27090/canu-assembling-large-genomes-with-single-molecule-sequencing-and-locality-sensitive-hashing</link>
	<title><![CDATA[CANU: Assembling Large Genomes with Single-Molecule Sequencing and Locality Sensitive Hashing.]]></title>
	<description><![CDATA[<p>Canu is a fork of the&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php?title=Main_Page" title="Celera Assembler">Celera Assembler</a>&nbsp;designed for high-noise single-molecule sequencing (such as the PacBio RSII or Oxford Nanopore MinION). The software is currently alpha level, feel free to use and report issues encountered.</p>
<p>Canu is a hierachical assembly pipeline which runs in four steps:</p>
<ul>
<li>Detect overlaps in high-noise sequences using&nbsp;<a href="https://github.com/marbl/MHAP" title="MHAP">MHAP</a></li>
<li>Generate corrected sequence consensus</li>
<li>Trim corrected sequences</li>
<li>Assemble trimmed corrected sequences</li>
</ul>
<p>Read the&nbsp;<a href="http://canu.readthedocs.org/" title="docs">documentation</a></p>
<p>New release https://github.com/marbl/canu/releases</p><p>Address of the bookmark: <a href="https://github.com/marbl/canu" rel="nofollow">https://github.com/marbl/canu</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36950/salsa-a-tool-to-scaffold-long-read-assemblies-with-hi-c</guid>
	<pubDate>Fri, 15 Jun 2018 04:01:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36950/salsa-a-tool-to-scaffold-long-read-assemblies-with-hi-c</link>
	<title><![CDATA[SALSA: A tool to scaffold long read assemblies with Hi-C]]></title>
	<description><![CDATA[This code is used to scaffold your assemblies using Hi-C data. This version implements some improvements in the original SALSA algorithm. If you want to use the old version, it can be found in the old_salsa branch.

To use the latest version, first run the following commands:

  cd SALSA
  make
To run the code, you will need Python 2.7, BOOST libraries and Networkx(version lower than 1.2).

If you consider using this tool, please cite our publication which describes the methods used for scaffolding.

Ghurye, J., Pop, M., Koren, S., Bickhart, D., &amp; Chin, C. S. (2017). Scaffolding of long read assemblies using long range contact information. BMC genomics, 18(1), 527. Link

Ghurye, J., Rhie, A., Walenz, B.P., Schmitt, A., Selvaraj, S., Pop, M., Phillippy, A.M. and Koren, S., 2018. Integrating Hi-C links with assembly graphs for chromosome-scale assembly. bioRxiv, p.261149 Link

For any queries, please either ask on github issue page or send an email to Jay Ghurye (jayg@cs.umd.edu).<p>Address of the bookmark: <a href="https://github.com/machinegun/SALSA" rel="nofollow">https://github.com/machinegun/SALSA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34571/mugsy-multiple-whole-genome-alignment-tool</guid>
	<pubDate>Fri, 08 Dec 2017 17:41:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34571/mugsy-multiple-whole-genome-alignment-tool</link>
	<title><![CDATA[Mugsy: multiple whole genome alignment tool]]></title>
	<description><![CDATA[<p><span>Mugsy is a multiple whole genome aligner. Mugsy uses Nucmer for pairwise alignment, a custom graph based segmentation procedure for identifying collinear regions, and the segment-based progressive multiple alignment strategy from Seqan::TCoffee. Mugsy accepts draft genomes in the form of multi-FASTA files and does not require a reference genome.</span></p>
<p>To cite Mugsy, use:</p>
<p>Angiuoli SV and Salzberg SL.&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/27/3/334">Mugsy: Fast multiple alignment of closely related whole genomes.</a><em>Bioinformatics</em>&nbsp;2011 27(3):334-4</p><p>Address of the bookmark: <a href="http://mugsy.sourceforge.net/" rel="nofollow">http://mugsy.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>