<?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/34571?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/34571?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43806/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</guid>
	<pubDate>Mon, 28 Feb 2022 23:27:37 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43806/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</link>
	<title><![CDATA[Genomicus: genome browser that enables users to navigate in genomes in several dimensions]]></title>
	<description><![CDATA[<p>Genomicus is a genome browser that enables users to navigate in genomes in several dimensions: linearly along chromosome axes, transversaly across different species, and chronologicaly along evolutionary time.</p>
<p>Once a query gene has been entered, it is displayed in its genomic context in parallel to the genomic context of all its orthologous and paralogous copies in all the other sequenced metazoan genomes. Moreover, Genomicus stores and displays the predicted ancestral genome structure in all the ancestral species within the phylogenetic range of interest.</p>
<p>All the data on extant species displayed in this browser are from&nbsp;<a href="http://www.ensembl.org/">Ensembl</a>.</p>
<p><br><strong>Summary statistics of Genomicus version 105.01:</strong><span>&nbsp;(view species tree in&nbsp;</span><a href="https://www.genomicus.bio.ens.psl.eu/genomicus-105.01/data/SpeciesTree.pdf">pdf</a><span>&nbsp;or&nbsp;</span><a href="https://www.genomicus.bio.ens.psl.eu/genomicus-105.01/data/SpeciesTree.nwk">newick</a><span>)</span><br><br></p>
<table id="introstats">
<tbody>
<tr><th>Number of extant species</th>
<td>200</td>
</tr>
<tr><th>Number of extant genes</th>
<td>4303993</td>
</tr>
<tr><th>&nbsp;</th></tr>
<tr><th>Number of ancestral species</th>
<td>196</td>
</tr>
<tr><th>Number of ancestral genes</th>
<td>4624213</td>
</tr>
<tr><th>Number of ancestral synteny blocks</th>
<td>83342<br><br></td>
</tr>
</tbody>
</table><p>Address of the bookmark: <a href="https://www.genomicus.bio.ens.psl.eu/genomicus-105.01/cgi-bin/search.pl" rel="nofollow">https://www.genomicus.bio.ens.psl.eu/genomicus-105.01/cgi-bin/search.pl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36592/lachesis-genome-assembly-with-hi-c-based-contact-probability-maps-lachesis</guid>
	<pubDate>Mon, 14 May 2018 04:26:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36592/lachesis-genome-assembly-with-hi-c-based-contact-probability-maps-lachesis</link>
	<title><![CDATA[LACHESIS: Genome Assembly with Hi-C-based Contact Probability Maps (LACHESIS)]]></title>
	<description><![CDATA[<p>LACHESIS is method that exploits contact probability map data (e.g. from Hi-C) for chromosome-scale&nbsp;<em>de novo</em>&nbsp;genome assembly.</p>
<p>Further information about LACHESIS, including source code, documentation and a user's guide are available at:&nbsp;<a href="http://shendurelab.github.io/LACHESIS/">http://shendurelab.github.io/LACHESIS</a>.</p>
<p>Manuscript describing LACHESIS was published as: Burton JN#, Adey A, Patwardhan RP, Qiu R, Kitzman JO, Shendure J#.&nbsp;<em>Chromosome-scale scaffolding of de novo genome assemblies based on chromatin interactions.</em>&nbsp;Nature Biotechnology 2013 Dec;31(12):1119-25. doi:&nbsp;<a href="http://dx.doi.org/10.1038/nbt.2727">10.1038/nbt.272</a>. PubMed PMID:&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pubmed/24185095">24185095</a>.</p>
<p>&nbsp;</p>
<p>http://shendurelab.github.io/LACHESIS/</p><p>Address of the bookmark: <a href="http://shendurelab.github.io/LACHESIS/" rel="nofollow">http://shendurelab.github.io/LACHESIS/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/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/bookmarks/view/27461/maftools</guid>
	<pubDate>Sat, 21 May 2016 22:40:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27461/maftools</link>
	<title><![CDATA[mafTools]]></title>
	<description><![CDATA[<p><span>Bioinformatics tools for dealing with Multiple Alignment Format (MAF) files.</span></p><p>Address of the bookmark: <a href="https://github.com/dentearl/mafTools" rel="nofollow">https://github.com/dentearl/mafTools</a></p>]]></description>
	<dc:creator>Radha Agarkar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31014/sockeye</guid>
	<pubDate>Fri, 17 Feb 2017 08:51:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31014/sockeye</link>
	<title><![CDATA[sockeye]]></title>
	<description><![CDATA[<p>This sockeye&nbsp;software uses the Ensembl database project to import sequence and annotation information from several eukaryotic species. A user can additionally import their own custom sequence and annotation data. Individual annotation objects are displayed in Sockeye by using custom 3D models. Ensembl-derived and imported sequences can be analyzed by using a suite of multiple and pair-wise alignment algorithms. The results of these comparative analyses are also displayed in the 3D environment of Sockeye. By using the Java3D API to visualize genomic data in a 3D environment, we are able to compactly display cross-sequence comparisons. This provides the user with a novel platform for visualizing and comparing genomic feature organization.</p><p>Address of the bookmark: <a href="http://www.bcgsc.ca/platform/bioinfo/software/sockeye/releases/1.3" rel="nofollow">http://www.bcgsc.ca/platform/bioinfo/software/sockeye/releases/1.3</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31087/bedtools</guid>
	<pubDate>Fri, 24 Feb 2017 04:50:44 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31087/bedtools</link>
	<title><![CDATA[bedtools]]></title>
	<description><![CDATA[<p>Collectively, the&nbsp;<strong>bedtools</strong>&nbsp;utilities are a swiss-army knife of tools for a wide-range of genomics analysis tasks. The most widely-used tools enable&nbsp;<em>genome arithmetic</em>: that is, set theory on the genome. For example,&nbsp;<strong>bedtools</strong>&nbsp;allows one to<em>intersect</em>,&nbsp;<em>merge</em>,&nbsp;<em>count</em>,&nbsp;<em>complement</em>, and&nbsp;<em>shuffle</em>&nbsp;genomic intervals from multiple files in widely-used genomic file formats such as BAM, BED, GFF/GTF, VCF. While each individual tool is designed to do a relatively simple task (e.g.,&nbsp;<em>intersect</em>&nbsp;two interval files), quite sophisticated analyses can be conducted by combining multiple bedtools operations on the UNIX command line.</p>
<p><strong>bedtools</strong>&nbsp;is developed in the&nbsp;<a href="http://quinlanlab.org/">Quinlan laboratory</a>&nbsp;at the&nbsp;<a href="http://www.utah.edu/">University of Utah</a>&nbsp;and benefits from fantastic contributions made by scientists worldwide.</p><p>Address of the bookmark: <a href="http://bedtools.readthedocs.io/en/latest/index.html" rel="nofollow">http://bedtools.readthedocs.io/en/latest/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/32713/salzberg-lab</guid>
  <pubDate>Mon, 15 May 2017 05:14:01 -0500</pubDate>
  <link></link>
  <title><![CDATA[Salzberg lab]]></title>
  <description><![CDATA[
<p>We are a computational biology lab that develops novel methods for analysis of DNA and RNA sequences. Our research includes software for aligning and assembling RNA-seq data, whole-genome assembly, and microbiome analysis. We work closely with biomedical scientists to apply these methods to current problems arising in a broad spectrum of biological and medical research areas. We’re also part of the Center for Computational Biology, a group of 20+ faculty members and their labs at Johns Hopkins working on computational, statistical, and mathematical methods that can turn massive genomic data sets into biologically and clinically useful information.</p>

<p>https://salzberg-lab.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34569/ksnp30-snp-detection-and-phylogenetic-analysis-of-genomes-without-genome-alignment-or-reference-genome</guid>
	<pubDate>Fri, 08 Dec 2017 16:48:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34569/ksnp30-snp-detection-and-phylogenetic-analysis-of-genomes-without-genome-alignment-or-reference-genome</link>
	<title><![CDATA[kSNP3.0: SNP detection and phylogenetic analysis of genomes without genome alignment or reference genome]]></title>
	<description><![CDATA[<p><span>Sept. 20, 2017 Version 3.1 released. Major upgrade. Version 3.1 fixes the problems with SNP annotation that arose when NCBI discontinued use of GI numbers. Please read carefully the Preface (page 3) and the File of annotated genomes section (pages 9-10) in the version 3.1 User Guide. Thanks to Tom Slezak for revsing the get_genbank_file3 script and to Tod Stuber (USDA) for testing version 3.1 even though he doesn't need the annotation feature. All users are encouraged to upgrade to version 3.1.&nbsp;<br></span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/ksnp/files/" rel="nofollow">https://sourceforge.net/projects/ksnp/files/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39689/msaprobs-parallel-and-accurate-multiple-sequence-alignment</guid>
	<pubDate>Tue, 09 Jul 2019 23:58:44 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39689/msaprobs-parallel-and-accurate-multiple-sequence-alignment</link>
	<title><![CDATA[MSAProbs - Parallel and accurate multiple sequence alignment]]></title>
	<description><![CDATA[<p><strong>MSAProbs</strong><span>&nbsp;is a well-established state-of-the-art multiple sequence alignment algorithm for protein sequences. The design of MSAProbs is based on a combination of pair hidden Markov models and partition functions to calculate posterior probabilities. Assessed using the popular benchmarks: BAliBASE, PREFAB, SABmark and OXBENCH, MSAProbs achieves statistically significant accuracy improvements over the existing top performing aligners, including ClustalW, MAFFT, MUSCLE, ProbCons and Probalign. In addition, MSAProbs is optimized for shared-memory CPUs by employing a multi-threaded design, and further parallelized for distributed-memory systems using MPI to overcome high memory overhead barrier and achieve good parallel and data-size scalability.</span></p><p>Address of the bookmark: <a href="http://msaprobs.sourceforge.net/homepage.htm#latest" rel="nofollow">http://msaprobs.sourceforge.net/homepage.htm#latest</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>