<?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/27438?offset=290</link>
	<atom:link href="https://bioinformaticsonline.com/related/27438?offset=290" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17504/postdoc-scientist-bioinformatics-at-ccmb</guid>
  <pubDate>Fri, 26 Sep 2014 19:58:41 -0500</pubDate>
  <link></link>
  <title><![CDATA[PostDoc Scientist Bioinformatics at CCMB]]></title>
  <description><![CDATA[
<p>1. Project Assistant/Junior Research Fellow/ Project Fellow [PA_JRF_PF]</p>

<p>a) M.Sc/or equivalent in biological sciences/related areas [Position Code: PA_JRF_PF_a]<br />b) B.E/B.Tech/ M.Sc in biotechnology/bioinformatics/computer science/Chemistry/Physics or MCA [Position Code: PA_JRF_PF_b]<br />c) M.Sc/or equivalent in wildlife sciences/ecology/environmental sciences or MBBS/BVSc/MVSc. [Position Code: PA_JRF_PF_c]</p>

<p>(Candidates with result awaited are NOT eligible to apply)</p>

<p>Upper Age limit 28years</p>

<p>Rs.12000 / Rs.16000 (as sanctioned by the funding agency)</p>

<p>2. Post Doctoral Fellow/Research Associate in multiple research areas [PDF_RA]</p>

<p>Ph.D. (submitted/awarded) in any branch of biological Sciences. Candidates with Ph.D. in other sciences are also encouraged to apply.</p>

<p>Experience in molecular biology, biochemistry, structural biology, cell biology, infectious disease, conservation genetics, veterinary science, reproductive biology, and molecular diagnostics is desired but not mandatory.</p>

<p>[Position Code: PDF_RA]</p>

<p>UpperAge limit 35years</p>

<p>Rs. 22000- 26000 (as sanctioned by the funding agency)</p>

<p>3. Post Doctoral Scientist Fellow [PDSF]</p>

<p>Ph.D in any of the following areas: bioinformatics, next generation sequencing, high throughput data analysis, proteomics, bio-statistics, computer science, information technology, computer hardware and networking/clustering, parallel processing.<br />[Position Code: PDSF]</p>

<p>Upper Age limit 40 years</p>

<p>Rs. 40000 consolidated (as sanctioned by the funding agency)</p>

<p>Download Application: Last date for apply online: 09th Oct 2014</p>

<p>Advertisement: www.ccmb.res.in//index.php?view=notifications&amp;mid=0&amp;id=71&amp;nid=38</p>

<p>Apply online http://www.ccmb.res.in/positions/temp_notif/online_form.html</p>

<p>More at http://www.ccmb.res.in//index.php?view=notifications&amp;mid=0&amp;id=71&amp;nid=38</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/17652/arraygen-bioinformatics-genomics-group</guid>
  <pubDate>Sun, 28 Sep 2014 14:09:55 -0500</pubDate>
  <link></link>
  <title><![CDATA[ArrayGen Bioinformatics Genomics Group]]></title>
  <description><![CDATA[
<p>ArrayGen is a global bioinformatics company which is a one stop solution for microarray designing and genomics data analysis. Our novel Array Design Approach Strategy (ADAS) aims to condense the time lag between demands of scientific community and manufacture industry, thereby expediting research processes.</p>

<p>ArrayGen specializes in Genomics data analysis and research, as we believe in the level of precision, predictability, benchmark-ability, and data analysis capability of genomics data over other forms of biological data. ArrayGen constantly strives to develop new solutions, and plug the existing gaps in the technological advancement of the field.</p>

<p>More http://www.arraygen.com/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/17873/postdoc-position-in-protein-annotation-and-machine-learning-paris-france</guid>
  <pubDate>Sat, 04 Oct 2014 08:10:45 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoc position in protein annotation and machine learning - Paris, France]]></title>
  <description><![CDATA[
<p>We are interested in finding an excellent postdoc with interests in protein functional annotation, machine learning and computer grids. The position is open for 3.5 years at the Université Pierre et Marie Curie, in the heart of Paris.</p>

<p>Research topic: Protein function annotation, multiple probabilistic models, domain architecture, machine learning, combinatorial optimization, computer grid.</p>

<p>This project is run on the Laboratoire de Biologie Computationnelle et Quantitative UMR7238 CNRS-UPMC – Analytical Genomics team, headed by A.Carbone. It is co-advised with Pierre-Henri Wuillemin, Laboratoire d’Informatique de Paris 6 – Equipe DECISION.</p>

<p>The postdoc will be payed under a contract of Ingénieur de Recherche lasting 3.5 years and it is available from September 1st, 2014.</p>

<p>Group Web Page: http://www.lcqb.upmc.fr/AnalGenom/home.html</p>

<p>Ref. E-Mail: Alessandra Carbone alessandra.carbone@lip6.fr</p>
]]></description>
</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/blog/view/45358/the-variant-everyone-ignored</guid>
	<pubDate>Mon, 05 Oct 2026 12:14:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45358/the-variant-everyone-ignored</link>
	<title><![CDATA[The Variant Everyone Ignored]]></title>
	<description><![CDATA[<p>Consider a scenario in which a patient's genome has been sequenced. Among billions of DNA bases, a structural alteration may explain the patient's disease. Multiple advanced algorithms analyze the data, yet only one detects the variant, while the others do not. In standard bioinformatics workflows, such a solitary result is often regarded as unreliable and subsequently discarded. Although the solution exists within the data, prevailing computational protocols may overlook it.</p><p>A recent study published in Genome Biology (https://link.springer.com/article/10.1186/s13059-026-04280-y) addressed this challenge by introducing dicast (https://github.com/burgshrimps/dicast), a machine-learning approach for detecting structural variants in short-read sequencing data. Structural variants, such as large deletions, insertions, duplications, and inversions, can have significant biological and clinical implications, yet they are challenging to identify with short-read technologies. Because different detection methods frequently yield divergent results, researchers commonly employ consensus calling, considering a variant valid only if multiple tools detect it. While this approach reduces false positives, it relies on the potentially flawed assumption that the majority is always correct.</p><p>The researchers explored the impact of evaluating the supporting evidence for each variant, rather than simply tallying the number of algorithms that identified it. To establish a ground truth, they analyzed nine genomes using multiple sequencing technologies and 15 detection methods, initially identifying approximately 35 million potential variants. Through extensive filtering, evidence integration, and manual review of over 11,500 variants, they developed a robust benchmark comprising more than 236,000 structural variants. The findings underscored the complexity of the problem: short-read methods detected fewer than half of deletions and less than 10 percent of insertions, with performance declining markedly in repetitive genomic regions. In contrast, long-read technologies demonstrated superior detection capabilities. However, replacing the substantial volume of existing short-read data in clinical and research settings is not immediately feasible. Consequently, the researchers questioned whether short-read data might harbor more information than conventional analytical pipelines currently extract.</p><p>This line of inquiry led to the development of dicast. Rather than merely confirming agreement among multiple tools, dicast identifies patterns in sequencing data, including split and clipped reads, discordant read pairs, alignment characteristics, and the surrounding genomic context. An XGBoost machine-learning model evaluates which combinations of these signals are indicative of genuine structural variants. Thus, the approach shifts from tallying algorithmic consensus to interpreting the underlying evidence.</p><p>The researchers subsequently conducted a targeted evaluation by examining structural variants detected by only a single short-read tool, which are typically missed by consensus-based approaches. dicast successfully recovered approximately 81% of these single-caller deletions, insertions, and duplications. The signals for these variants were present in the data, but conventional filtering methods failed to integrate them effectively.</p><p>The utility of dicast was further demonstrated in cohorts with rare diseases, including congenital limb malformations, atrial fibrillation, and neuromuscular disorders. In one instance, dicast achieved a deletion recall rate of approximately 0.96, compared to 0.74 using consensus calling. The median number of variants requiring manual review was 29 per sample. Among 31 experimentally validated variants that standard filters would have missed, dicast identified 12, whereas consensus calling detected only one.</p><p>Overall, dicast identified approximately 20 percent more potential disease-causing deletions than consensus-based methods. While a 20 percent increase may appear modest, in clinical genomics such improvements can have significant practical implications. Missing a deletion may leave a case unresolved, whereas detecting a structural variant can provide critical diagnostic insights.</p><p>The study does not claim that machine learning has rendered short-read sequencing superior to long-read approaches. Instead, the results underscore the effectiveness of long-read sequencing for structural variant detection. However, dicast highlights a more nuanced perspective: substantial biological information may still be recoverable from the extensive short-read datasets already available.</p><p>The principal lesson extends beyond the detection of structural variants. For many years, bioinformatics pipelines have relied on threshold-based criteria, such as minimum coverage, quality scores, or support from multiple tools. While these rules are useful, biological phenomena do not always conform to rigid checklists; multiple weak signals, when considered collectively, can provide compelling evidence.</p><p>This perspective prompts consideration of the solitary variant: one algorithm identifies it, while several others do not. Traditional consensus techniques might have dismissed it, yet machine learning approaches evaluate the available evidence to determine whether the variant is plausible.</p><p>Occasionally, the most significant variant within a genome is the one that is almost universally overlooked.</p><p>Read more at&nbsp;https://link.springer.com/article/10.1186/s13059-026-04280-y</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/19636/google-genomics</guid>
	<pubDate>Thu, 18 Dec 2014 11:05:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/19636/google-genomics</link>
	<title><![CDATA[Google Genomics]]></title>
	<description><![CDATA[<ul>
<li>
<p><strong>Explore genetic variation interactively.</strong> Compare entire cohorts in seconds with SQL-like queries. Compute transition/transversion ratios, genome-wide association, allelic frequency and more.</p>
</li>
<li>
<p><strong>Process big genomic data easily.</strong> Run batch analyses like principal component analysis and Hardy-Weinberg equilibrium on as many samples as you like, in minutes or hours, with just a little code.</p>
</li>
<li>
<p><strong>Use Google's infrastructure and big data expertise.</strong> Store one genome or a million using Google Genomics and take advantage of the same infrastructure that powers Search, Maps, YouTube, Gmail and Drive.</p>
</li>
<li>
<p><strong>Support emerging global standards.</strong> Google Genomics is implementing the API defined by the Global Alliance for Genomics and Health for visualization, analysis and more. Compliant software can access Google Genomics, local servers, or any other implementation.</p>
</li>
</ul><p>Address of the bookmark: <a href="https://cloud.google.com/genomics/" rel="nofollow">https://cloud.google.com/genomics/</a></p>]]></description>
	<dc:creator>Tenzin Paul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/19980/seqloc-06</guid>
	<pubDate>Sun, 28 Dec 2014 12:51:29 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/19980/seqloc-06</link>
	<title><![CDATA[seqloc 0.6]]></title>
	<description><![CDATA[<p>The <code>Bio.SeqLoc</code> modules in <code>seqloc</code> are designed to represent positions and locations (ranges of positions) on sequences, particularly nucleotide sequences. My original motivation for writing these packages was handing the locations of genes in eukaryotic genomes.</p>
<p>Handle sequence locations for bioinformatics http://www.ingolia-lab.org/seqloc-tutorial.html</p><p>Address of the bookmark: <a href="http://www.stackage.org/snapshot/nightly-2014-12-28/package/seqloc-0.6" rel="nofollow">http://www.stackage.org/snapshot/nightly-2014-12-28/package/seqloc-0.6</a></p>]]></description>
	<dc:creator>Gudiya Pal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24297/bioinformatics-walkin-at-nii</guid>
  <pubDate>Fri, 04 Sep 2015 21:48:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics WalkIn at NII]]></title>
  <description><![CDATA[
<p>ADVERTISEMENT OF WALK-IN-INTERVIEW</p>

<p>NAME OF THE POST : Bioinformatician (Part time 3 days in a week) (One Position only)</p>

<p>DURATION : One Year</p>

<p>NAME OF THE PROJECT : Next generation sequencing facility</p>

<p>EDUCATIONAL QUALIFICATIONS : At least a Masters degree in Bioinformatics and Bachelors degree in any stream of life sciences</p>

<p>REQUIREMENTS :</p>

<p>Around 5 years of experience and proven track record in next generation sequence data analysis (supported by publications in peer-reviewed journals), ability to analyze transcriptomics, Chip-seq, and small RNA –seq data.</p>

<p>: Should have the ability to analyze raw primary data generated by Illumina next generation sequencing platforms and create / troubleshoot custom analysis Pipelines.</p>

<p>Should have ability to handle all downstream secondary and tertiary data analysis using commercially available as well as open source softwares (transcriptomics, ChIP-seq, small RNA-seq)</p>

<p>Apart from these, the applicant should have knowledge of the following: Programming: Perl and Python. Operating system:</p>

<p>Linux and Windows. NGS Analysis tools: Maq, BWA, Bowtie, SAM tools, BEDTools, MACS, Galaxy, FastQC, Bismark, MEDIPS, Tophat, Cufflinks, AvadisNGS, CLC Genomics Workbench, Galaxy, BaseSpace, Trinity Statistics: Microsoft Excel and R. Database: MySQL Genome Browser: UCSC, Ensemble, IGV, IGB Motif Analysis Tools: MEME Suite, Transfac and RSAT Functional Annotation Tools: DAVID, GeneCodis, Gene Cards Networking Tools: Cytoscape</p>

<p>EMOLUMENTS : The incumbent will be paid a fee of Rs. 2000/- per sitting/ per day.</p>

<p>SCIENTIST NAME : Dr. Arnab Mukhopadhyay,</p>

<p>Staff Scientific V Next generation sequencing facility</p>

<p>SCIENTIST’S E-MAIL ID : arnab@nii.ac.in</p>

<p>WALK IN INTERVIEW ON : 18th September, 2015</p>

<p>REGISTRATION OF CANDIDATES: 10.30 AM to 11.00 AM</p>

<p>PLEASE NOTE- 1. CANDIDATE MAY FILL UP APPLICATION IN THE PRECRIBED FORMAT ALONG WITH NECESSARY DOCUMENTS FOR VERIFICATION. 2. APPLICATIONS CONTAINING INCOMPLETE INFORMATION SHALL NOT BE ENTERTAINED. 3. DATE OF PASSING THE EXAMINATIONS MUST BE INDICATED CLEARLY. 4. ONLY REGISTERED CANDIDATES WILL BE INTERVIEWED. 5. NO TA/DA WILL BE PAID FOR ATTENDING THE INTERVIEW PRESCRIBED FORM 1. NAME 2. FATHER’S NAME 3. MOTHER’S NAME 4. DATE OF BIRTH 5. SEX (MALE/FEMALE) 6. CATEGORY (SC/ ST/ OBC/ PH) 7. ADDRESS a. (CORRSPONDENCE) b. (PERMANENT) 8. E MAIL, TELEPHONE NO. &amp; MOBILE No (if any) 9. ACADEMIC &amp; PROFESSIONAL QUALIFICATIONS NAME OF EXAMINATION PASSED WITH SUBJECTS YEAR OF PASSING BOARD/ UNIVERSITY PERCENTAGE/ DIVISION REMARKS 10. PAST EXPERIENCE &amp; PRESENT EMPLOYMENT, IF ANY 11. CANDIDATES SHOULD STATE CLEARLY WHETHER THEY HAVE BEEN AWARDED PH.D DEGREE OR THESIS HAS BEEN SUBMITTED. 12. HAVE YOU APPLIED FOR A POSITION EARLIER IN THE INSTITUTE? IF SO:- (1) THE DETAILS OF THE PROJECT AND PROJECT INVESTIGATOR (2) IF CALLED FOR INVERVIEW, RESULTS THEREOF</p>

<p>More at http://www1.nii.res.in/sites/default/files/walkininterview-18sept2015.pdf</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24762/postdoctoral-fellowship-in-bioinformatics-at-pesolelab</guid>
  <pubDate>Thu, 01 Oct 2015 07:20:48 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoctoral Fellowship in Bioinformatics at pesolelab]]></title>
  <description><![CDATA[
<p>Job Description: Bioinformatics postdoc positions are available in the area of genomics with main focus on exome and RNAseq technologies by ultra high-throughput sequencing platforms. Successful applicants should have the following qualities:</p>

<p>1) demonstrated experience in Bioinformatics research,<br />2) programing experience (python and/or R, C and C++ are very welcome),<br />3) knowledge of Linux/Unix environment,<br />4) experience in handling deep-seq data,<br />5) highly motivated and hard working, and<br />6) interested to work with a multi-disciplinary team combining bioinformatics, genomics, computational biology approaches with experimental biology.</p>

<p>Our research interest covers different areas of bioinformatics and genomics in order to achieve a deeper understanding of gene and genome structure and function (please look at our PubMed publications for more details about our research http://www.ncbi.nlm.nih.gov/pubmed/?term=pesole+g).</p>

<p>Interested applicants should email the curriculum vitae to Prof. Graziano Pesole at graziano.pesole@uniba.it or Dr. Ernesto Picardi at Ernesto.picardi@uniba.it.</p>

<p>Start date: immediate</p>

<p>Duration: up to 24 months<br />Contact Person (Referent): Ernesto Picardi<br />Ref. E-Mail: ernesto.picardi@uniba.it<br />Tel: +390805443308<br />Fax: +390805443317</p>

<p>Group Web Page: http://www.pesolelab.it/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27078/homer-software-for-motif-discovery-and-next-gen-sequencing-analysis</guid>
	<pubDate>Tue, 26 Apr 2016 03:48:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27078/homer-software-for-motif-discovery-and-next-gen-sequencing-analysis</link>
	<title><![CDATA[HOMER:  Software for motif discovery and next-gen sequencing analysis]]></title>
	<description><![CDATA[<p><span>This tutorial covers topics independently of HOMER, and represents knowledge which is important to know before diving head first into more advanced analysis tools such as HOMER.</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/computerSetup.html">Setting up your computing environment</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/retrieveFiles.html">Retrieving and storing sequencing files</a>&nbsp;(your own data or from public sources)</li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/fastqFiles.html">Checking sequence quality, trimming, general sequence manipulation</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/mapping.html">Mapping reads to a reference genome</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/samfiles.html">Manipulating SAM/BAM alignment files</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/genomeBrowsers.html">Visualizing data in a genome browser</a></li>
</ol>
<p><br>RNA-Seq</p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/rnaseqCufflinks.html">De novo transcript discovery and differential analysis with Cufflinks</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/rnaseqR.html">Differential expression analysis with R/Bioconductor</a></li>
<li><a href="http://homer.salk.edu/homer/basicTutorial/clustering.html">Clustering of large expression datasets (microarray or RNA-Seq)</a></li>
</ol>
<p><br><span>Microarray</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/affymetrix.html">Basic analysis of Affymetrix Gene Expression Arrays using R/Bioconductor</a></li>
</ol>
<p><span>General Tips for Data Analysis</span></p>
<ol>
<li><a href="http://homer.salk.edu/homer/basicTutorial/excelTips.html">Excel workarounds, adding gene annotation, X-Y plots tips, etc.</a></li>
</ol><p>Address of the bookmark: <a href="http://homer.salk.edu/homer/basicTutorial/" rel="nofollow">http://homer.salk.edu/homer/basicTutorial/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

</channel>
</rss>