<?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/29004?offset=1250</link>
	<atom:link href="https://bioinformaticsonline.com/related/29004?offset=1250" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45240/pg2-making-pangenome-graphs-easier-to-understand</guid>
	<pubDate>Tue, 18 Aug 2026 04:38:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45240/pg2-making-pangenome-graphs-easier-to-understand</link>
	<title><![CDATA[PG2: Making Pangenome Graphs Easier to Understand]]></title>
	<description><![CDATA[<p>Genomics is moving beyond the traditional approach of studying DNA using a single reference genome. Today, researchers are increasingly using pangenomes, which represent genetic information from multiple genomes and capture a much broader range of genetic diversity.</p><p>However, pangenome graphs can be highly complex, making them difficult to visualize and interpret. A recent study published in BMC Bioinformatics introduces PG2 (PanGenoGrapher), an open-source, web-based tool designed to address this challenge.&nbsp;The source code and user guide are openly available on GitHub at https://github.com/iVis-at-Bilkent/pangenographer. A publicly accessible sample deployment is hosted at http://pg2.cs.bilkent.edu.tr. In addition, a demonstration video illustrating the primary use cases of PG2 is available at https://www.youtube.com/watch?v=yCd7-aGY6CQ.</p><p>PG2 combines advanced graph-layout algorithms with an interactive visualization platform. It allows researchers to explore genomic paths, identify variations, and examine relationships between different parts of a pangenome graph more easily.</p><p>This is important because visualization can play a major role in bioinformatics. When complex genomic information is presented clearly, researchers can more easily identify patterns, understand genetic variation, and generate new biological insights.</p><p>The development of PG2 represents a step toward making pangenome analysis more accessible and intuitive. As genomic datasets continue to grow and graph-based representations become more common, tools like PG2 can help researchers navigate this increasing complexity.</p><p>Ultimately, PG2 demonstrates how combining genomics, graph algorithms, and interactive visualization can make sophisticated biological data easier to understand and analyze.</p><p>Reference: Solun, G. K., Dogrusoz, U., Bing&ouml;l, Z., &amp; Alkan, C. (2026). PG2: algorithms and a web-based tool for effective layout and visual analysis of pangenome graphs. BMC Bioinformatics. DOI: 10.1186/s12859-026-06555-4.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/19059/ipython-interactive-notebooks</guid>
	<pubDate>Fri, 07 Nov 2014 12:07:02 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/19059/ipython-interactive-notebooks</link>
	<title><![CDATA[IPython: Interactive notebooks]]></title>
	<description><![CDATA[<p>The IPython Notebook is a web-based interactive computational environment where you can combine code execution, text, mathematics, plots and rich media into a single document.</p><p>These notebooks are normal files that can be shared with colleagues, converted to other formats such as HTML or PDF, etc. You can share any publicly available notebook by using the IPython Notebook Viewer service which will render it as a static web page. This makes it easy to give your colleagues a document they can read immediately without having to install anything.</p><p><img src="http://ipython.org/_images/9_home_fperez_prof_grants_1207-sloan-ipython_proposal_fig_ipython-notebook-specgram.png" width="985" height="916" alt="image" style="border: 0px;"><br /><br />To learn more about using the IPython Notebook, you can visit our example collection, and you can read the documentation for all the details on how to use and configure the system. The Notebook Gallery showcases many interesting notebooks covering a variety of topics, from basic programming to advanced scientific computing.</p><p>&nbsp;</p><p>More http://www.nature.com/news/interactive-notebooks-sharing-the-code-1.16261</p><p>http://ipython.org/ipython-doc/1/interactive/notebook.html</p><p>Reference http://ipython.org/notebook.html</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45289/the-atlas-of-nine-billion-possibilities</guid>
	<pubDate>Wed, 09 Sep 2026 02:07:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45289/the-atlas-of-nine-billion-possibilities</link>
	<title><![CDATA[The Atlas of Nine Billion Possibilities]]></title>
	<description><![CDATA[<p>Imagine a book that holds all the instructions for building a human, made up of billions of letters. What if you changed just one letter? Maybe nothing would happen. Or that tiny change could affect how a gene works, quietly shaping a cell&rsquo;s biology or even helping cause disease.</p><p>Scientists face a big challenge with the human genome. They can read its letters, but understanding their roles is much harder. Only about 2 percent of the genome codes for proteins. The rest acts like a huge control panel, deciding when and where genes turn on. With about 9 billion possible single-letter changes, testing them all in a lab just isn&rsquo;t possible.</p><p>So, Google DeepMind asked a new question: what if we could predict what those changes might do?</p><p>This question led to the AlphaGenome Atlas (https://deepmind.google.com/science/alphagenome/atlas?), a detailed map of nearly every possible single-letter change in the human genome. Instead of checking each change one by one, researchers can use the Atlas to spot the ones most likely to matter. The AlphaGenome Variant Impact (AVI) score works like a trail marker, pointing scientists toward the changes worth a closer look.</p><p>This is where the Atlas gets especially useful. Much of the genome lies outside the protein-coding regions, where DNA acts as a switch or controller for genes. AlphaGenome lets researchers explore these areas and see how small changes could affect gene activity.</p><p>An atlas isn't the destination; it's a guide.</p><p>The AlphaGenome Atlas doesn&rsquo;t replace experiments or solve every mystery. Instead, it helps scientists decide where to begin. From billions of possibilities, it turns the vast genetic landscape into something researchers can start to explore.</p><p>There are nine billion possibilities, a vast map, and maybe among them therWith nine billion possibilities and a huge map to explore, there may be clues hidden here to some of medicine&rsquo;s toughest mysteries.</p><p>More at&nbsp;https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/alphagenome-atlas-a-predictive-map-of-every-possible-dna-letter-change-in-the-human-genome/alphagenome-atlas.pdf</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19161/niab-molecular-biologybioinformatics-scientistra-openings</guid>
  <pubDate>Thu, 13 Nov 2014 13:37:27 -0600</pubDate>
  <link></link>
  <title><![CDATA[NIAB Molecular Biology/Bioinformatics Scientist/RA Openings]]></title>
  <description><![CDATA[
<p>D. No. 1-121/1, 4th and 5th Floors, Axis Clinicals Building, Miyapur, Hyderabad, Telangana, India- 500 049</p>

<p>Email: admin@niab.org.in Telephones: +91 40 2304 9403 Telefax: +91 40 2304 2740<br />Advertisement No: 5/2014</p>

<p>About NIAB National Institute of Animal Biotechnology (NIAB), Hyderabad, an autonomous institute under the aegis of Department of Biotechnology, Government of India, is aimed to harness novel and emerging biotechnologies and create knowledge in the cutting edge areas for improving animal health and productivity.</p>

<p>Applications are invited for the following temporary research positions to work in ongoing DBTBBSRC sponsored research project entitled “Transcriptome Analysis in Indian buffalo and the Genetics of Innate Immunity” at the National Institute of Animal Biotechnology, Hyderabad.</p>

<p>(A) Project Scientist – Level B (One Position)</p>

<p>Emoluments: Rs. 15600 + GP Rs. 5400 + 30 % HRA p.m. (Total emoluments will be Rs. 49,770/-p.m. for the duration of the project)</p>

<p>Essential Qualification: Candidates having M.V.Sc. in Veterinary Microbiology / Veterinary Pathology / Veterinary Public Health / Ph.D. degree in Life Sciences, Biotechnology, Molecular Biology or any other related field from the recognized university are eligible to apply.</p>

<p>The candidate should have a good academic record and research experience as evidenced from published in standard referred journals / patents.</p>

<p>Desirable: Candidates having research experience in the area of tissue culture, genomics, Transcriptomics and Advanced Molecular Biology will be given preference.</p>

<p>Age Limit: Not exceeding 30 years as on last date of the submission of the application.</p>

<p>(B) Research Associate in Bioinformatics (One position)</p>

<p>Fellowship: Rs. 22,000 + 30 % HRA</p>

<p>Essential Qualification: Candidates having Ph.D. degree or M.Tech. with three years of<br />experience in Bioinformatics, Computational Biology, Biotechnology, Life Sciences or any other related field are eligible to apply.</p>

<p>Desirable: Candidate having research experience in the area of next generation sequencing (NGS) data analysis, Genome wide association studies, Genomic selection, advance genomic data analysis etc., will be given preference. The candidate should have a good academic record and research experience as evidenced from published papers in standard journals / patents.</p>

<p>Age Limit: Not exceeding 30 years as on last date of the submission of the application.</p>

<p>Project Duration: The duration of the project is Three years and the positions are co- terminus with the duration of the project. (Initial appointment will be for one year and further extension will be granted based on annual review).</p>

<p>Mode of submission of application: Only online applications are to be submitted through<br />www.niab.org.in on or before 08 December, 2014. Link for online submission of applications will be available from 10 November 2014.</p>

<p>Advertisement: www.niab.org.in/Notifications/Advt_5_2014/Advt_5_2014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11175/next-generation-sequencingngs-books</guid>
	<pubDate>Fri, 30 May 2014 04:48:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11175/next-generation-sequencingngs-books</link>
	<title><![CDATA[Next generation sequencing(NGS) books]]></title>
	<description><![CDATA[<p>Employing different technologies, the purpose of NGS platform is to decode the identity or modification on the nucleotides. NGS platforms evolve quickly and capture the main stream.</p>
<p>This bookmark is created to provide NGS online books links.</p><p>Address of the bookmark: <a href="http://en.wikibooks.org/wiki/Next_Generation_Sequencing_%28NGS%29/Print_version" rel="nofollow">http://en.wikibooks.org/wiki/Next_Generation_Sequencing_%28NGS%29/Print_version</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19249/bioinformatics-jrfrasrf-position-at-panjab-university</guid>
  <pubDate>Wed, 19 Nov 2014 20:19:49 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics JRF/RA/SRF position at PANJAB UNIVERSITY]]></title>
  <description><![CDATA[
<p>CENTRE FOR SYSTEMS BIOLOGY &amp; BIOINFORMATICS<br />UIEAST, PANJAB UNIVERSITY, CHANDIGARH</p>

<p>Applications are invited along with complete bio-data and attested copies of certificates of qualifications, experience etc. for the one post of Research Fellow and one post of Program Assistant under PURSE Grant of the University in Centre for Systems Biology &amp; Bioinformatics, UIEAST, Panjab University, Chandigarh which is tenable till the period of<br />the project.</p>

<p>Essential Qualification</p>

<p>For Research Fellow:-</p>

<p>M.Sc. in Systems Biology and Bioinformatics / Life Sciences with minimum 55% marks.</p>

<p>Preference will be given to NET/GATE/ICMR qualified candidates without fellowship however, candidates who have cleared the Panjab University Ph.D. entrance test in Systems Biology &amp; Bioinformatics will also be eligible.</p>

<p>For Program Assistant:-</p>

<p>The candidate must have M.Sc./M.Tech/MCA/PGDCA in Computer Science and must be able to handle LAN, Linex. Preference will be given to the candidate having experience in<br />System Administration.</p>

<p>Emoluments</p>

<p>For Research Fellow Rs. 12,500/- per month (Fixed)<br />For Program Assistant Rs. 12,500/- per month (Fixed)</p>

<p>Applications should be reach on or before 19-11-2014 in the office of the undersigned.</p>

<p>Interview will be held on 21-11-2014 in the office of the Coordinator, Centre for Systems Biology &amp; Bioinformatics, South Campus, Block-3, Sector-25, Panjab University, Chandigarh. No TA/DA will be paid.</p>

<p>Advertisement:</p>

<p>http://jobs.puchd.ac.in/includes/jobs/2014/20141110143634-Advertisement.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/23590/will-minion-nanopore-sequencing-increase-the-number-of-next-generation-sequencing-projects</guid>
	<pubDate>Tue, 04 Aug 2015 05:14:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/23590/will-minion-nanopore-sequencing-increase-the-number-of-next-generation-sequencing-projects</link>
	<title><![CDATA[Will MinION Nanopore sequencing increase the number of Next Generation Sequencing projects?]]></title>
	<description><![CDATA[<p>Will MinION Nanopore sequencing increase the number of Next Generation Sequencing projects?</p>]]></description>
	<dc:creator>Strand</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19541/bioinformatics-sub-dic-dic</guid>
  <pubDate>Fri, 12 Dec 2014 21:14:57 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics SUB DIC (DIC)]]></title>
  <description><![CDATA[
<p>Project Title BIOINFORMATICS SUB DIC (DIC)</p>

<p>Reference Number IIT/SRIC/R/DIC/2014/314, DATED 28thNovember, 2014</p>

<p>Temporary Position(s)</p>

<p>i) Junior/ Senior Project Officer (1)<br />ii) Junior Project Assistant (2)</p>

<p>Consolidated Compensation</p>

<p>i) Rs.16,000/- to Rs.18,000/- p.m. (depending on qualification &amp; experience)<br />ii) Rs.8,000/- to Rs.10,000/- p.m. (depending on qualification &amp; experience)</p>

<p>Coordinator / PI Dr. Sudip K. Ghosh, Dept of Biotechnology.</p>

<p>Department / Centre / School Dept of Biotechnology </p>

<p>Qualifications &amp; Experience</p>

<p>(i) M. Sc in any branch of Life Sciences with experience in Molecular  Biology/Genetics/Biochemistry preferably a Post Graduate diploma in Bioinformatics or two years working experience in bioinformatics (Minimum 60% marks starting from matriculation examination).</p>

<p>(ii) B. Sc. /B.A. /B. Com/Diploma in Management or Computer Science. Knowledge in computer software will be preferred (minimum 50% marks starting from matriculation examination).</p>

<p>More Information</p>

<p>Interested eligible persons may apply on plain paper, giving full bio-data along with attested copies of testimonials to the undersigned on or before 11thDecember, 2014. </p>

<p>Sponsor DBT, NEW DELHI</p>

<p>Last Date 11 Dec 2014</p>

<p>Application Fee Demand Draft for Rs.50/- (Not for female candidates) drawn in favour of IIT Kharagpur payable at Kharagpur</p>

<p>Advertisement: www.iitkgp.ac.in/topfiles/sric_job_details.php?serial=2826</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32875/finishing</guid>
	<pubDate>Sat, 20 May 2017 15:50:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32875/finishing</link>
	<title><![CDATA[Finishing !!]]></title>
	<description><![CDATA[<p>The process of&nbsp;<em>finishing</em>&nbsp;a genome and moving it from a&nbsp;<em>draft</em>&nbsp;stage (the result of sequencing and initial assembly) to a complete genome is typically a time and resource intensive task. The advent of new sequencing technologies has come with its own set of opportunities and pitfalls in the finishing process. While genomes can now be sequenced to high redundancy in a cost-effective manner, the process of assembling the genomes is more challenging and often draft genomes are fragmented into hundreds of contigs. Correspondingly, the task of producing the complete genome can involve months of lab work and thousands of finishing experiments and is usually done in large genome centers.</p>
<p>The work in our lab has focussed on computational approaches to speed-up the finishing process. Specifically, we have explored the use of optical mapping and mate-pair data to augment assemblies and direct finishing experiments. The tools developed in our lab have been used in several finishing projects, producing complete genomes (and near-complete ones) with surprisingly little computational and experimental effort (Nagarajan et al., in submission). The executables (as well as source code) for these tools are freely available here:</p>
<ul>
<li><strong>Scaffolding using Optical Restriction Mapping</strong><br>Optical Maps are global, ordered maps of restriction site locations in a genome. This information can be quite useful in scaffolding contigs from a shotgun assembly to guide the finishing process. A set of programs to exploit optical maps for assembly can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/soma-v2.tar.gz">SOMA v2.0 (63 MB tar.gz file)</a>. This version of SOMA contains several improvements to programs in v1.0 as well as new scripts for working with multiple maps, contig graphs and scaffolds.&nbsp;<br><br></li>
<li><strong>Augmenting assemblies with mate-pair data</strong><br>Mate-pair information can be valuable in augmenting short-read assemblies and reconstructing the genome as larger scaffolds. AMOS-Hybrid is a pipeline written in the AMOS framework (open-source assembly tools) to merge arbitrary mated reads into an existing assembly and merge contigs and create scaffolds where possible. Source code and executables for AMOS-Hybrid are available here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/AMOS-Hybrid-v1.tar.gz">AMOS-Hybrid v1.0 (142 MB tar.gz file)</a>.&nbsp;<br><br></li>
<li><strong>Assembly and sequence-composition guided finishing</strong><br>Contigs from a shotgun assembly are typically linked together in a graph structure that can serve to guide finishing and in some case close gaps&nbsp;<em>in-silico</em>. Also, in many cases, sequence composition of contigs can provide clues to fill gaps in scaffolds. A set of scripts to automate some of these tasks can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/finishing-v1.tar.gz">Finishing Scripts v1.0 (63 MB tar.gz file)</a>.&nbsp;</li>
</ul>
<p>http://www.cbcb.umd.edu/finishing/</p><p>Address of the bookmark: <a href="http://www.cbcb.umd.edu/finishing/" rel="nofollow">http://www.cbcb.umd.edu/finishing/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</guid>
	<pubDate>Fri, 01 Dec 2017 04:10:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</link>
	<title><![CDATA[PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool]]></title>
	<description><![CDATA[<p><strong>PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.</strong></p>
<p><strong>Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.</strong></p>
<p>PLAST stands for&nbsp;<em>Parallel Local Sequence Alignment Search Tool&nbsp;</em>and is was&nbsp;<a href="http://www.biomedcentral.com/1471-2105/10/329" target="_blank">published in BMC Bioinformatics.</a></p>
<p>PLAST is a general purpose sequence comparison tool providing the following benefits:</p>
<ul>
<li>PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),</li>
<li>Reduces the processing time of sequences comparisons while providing highest quality results,</li>
<li>Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),</li>
<li>Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,</li>
<li>Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.</li>
</ul>
<p>https://plast.inria.fr/</p><p>Address of the bookmark: <a href="https://plast.inria.fr/" rel="nofollow">https://plast.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>