<?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/30234?offset=930</link>
	<atom:link href="https://bioinformaticsonline.com/related/30234?offset=930" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22436/ra-bioinformatics-at-national-bureau-of-animal-genetic-resources</guid>
  <pubDate>Thu, 28 May 2015 19:25:33 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES]]></title>
  <description><![CDATA[
<p>NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES</p>

<p>Near Basant Vihar G.T. Road Bypass P.O. Box No.129</p>

<p>Karnal - 132001 (Haryana)</p>

<p>WALK-IN-INTERVIEW</p>

<p>A walk-in-Interview is proposed to be held at National Bureau of Animal Genetic Resources, Karnal (Haryana)-132001 at 10:30 AM on 10.06.2015 to select One Research Associate as per details given below:</p>

<p>1. One post of Research Associate under National Fellow project entitled “Genome data mining to unravel molecular basis of thermotolerance and adaptation to diverse environments in native cattle and buffaloes”.</p>

<p>The post duration is Upto 22.05.2016 or earlier &amp; Co-terminus with the project.</p>

<p>Essential Qualifications: Master’s degree (M.Sc. / M.V.Sc.) in Biotechnology/ Animal Genetics and Breeding/ Life Sciences/ Bioinformatics with 2 Years research experience in relevant subject or Ph.D in any of the above subjects.</p>

<p>Desirable: Working Experience in molecular biology, gene expression/ microarray data analysis, SNP genotyping and sequence data analysis, mammalian cell-culture handling etc.</p>

<p>Emolument: Rs. 23,000/- per month + HRA as per admissibility</p>

<p>Research Associate: ONE</p>

<p>Duration of engagement: Upto 22.05.2016 or earlier Co-terminus with the project</p>

<p>Age Limit:  40 years for Men  45 years for women as on date of interview</p>

<p>Note: Relaxation in age will be admissible for SC/ST &amp; OBC candidates as per Govt. of India /ICAR norms</p>

<p>1. The applicants must bring with them original documents and brief of research work done during post graduation along with a set of photocopy and latest two passport size photographs. 2. A panel of selected candidates will also be made which may be utilized for filling of positions of shorter durations in future if demand arises. 3. Experience certificate in original, if any 4. The above positions are purely on temporary basis and are coterminus with the project. No TA/DA will be paid to attend the interview. 5. Any other clarifications can be had on the date of interview. 6. The Director’s decision will be final and binding on all respects.</p>

<p>Advertisement: http://210.212.93.85/RAadvertisiment.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45306/the-genes-that-travel-together-a-genomic-detective-story</guid>
	<pubDate>Fri, 11 Sep 2026 13:00:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45306/the-genes-that-travel-together-a-genomic-detective-story</link>
	<title><![CDATA[The Genes That Travel Together: A Genomic Detective Story]]></title>
	<description><![CDATA[<p>Imagine looking through thousands of microbial genomes and discovering two genes that repeatedly appear together. The obvious conclusion is that they must somehow be connected&mdash;that perhaps they work together, participate in the same pathway, or depend on each other. But evolution has a way of leaving misleading clues. What if these two genes are found together simply because they were inherited from the same ancient ancestor? In that case, their apparent association may have little to do with their biological function; it may simply be a reflection of shared evolutionary history. This is the intriguing problem addressed by CORGIAS (https://github.com/ynishimuraLv/corgias), a computational framework developed to distinguish genuine gene associations from correlations created by common ancestry.</p><p>Instead of asking only whether two genes occur together across genomes, CORGIAS asks a deeper question: did these genes actually evolve together, repeatedly gaining or losing their presence in concert, or are they merely travelling together because of their inherited history? The framework introduces two complementary approaches, Ancestral State Adjustment (ASA) and the Simultaneous EVolution test (SEV), which incorporate evolutionary information into the search for gene associations. This distinction becomes increasingly important as genome sequencing continues to uncover enormous numbers of microbial genomes, many from organisms that have never been cultured and whose genes remain functionally mysterious. In this growing genomic landscape, simply finding a gene is no longer enough&mdash;we need clues about what that gene might be doing. CORGIAS approaches this problem almost like a genomic detective: rather than treating every association as evidence, it reconstructs the evolutionary story behind the association and asks whether the evidence survives that history. By doing so, it offers a way to separate coincidence from biological connection and potentially uncover functional relationships hidden within the vast microbial genomic landscape. The broader message is beautifully simple: genes do not evolve in isolation, and understanding what they do may require us to look beyond where they are today and reconstruct how they arrived there. Sometimes, the most important clue in a genome is not the gene itself, but the evolutionary journey it has taken.</p><p>More at&nbsp;https://academic.oup.com/nargab/article/7/4/lqaf182/8377910?</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/22615/jrf-position-%E2%80%93-bioinformatics-department-aravind-medical-research-foundation-amrf-madurai</guid>
  <pubDate>Fri, 12 Jun 2015 05:42:12 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF Position – Bioinformatics Department, Aravind Medical Research Foundation (AMRF), Madurai.]]></title>
  <description><![CDATA[
<p>Applications are invited from eligible candidates for the post of Junior Research Fellow (JRF) to work at the Department of Bioinformatics, Aravind Medical Research Foundation in the following DST-SERB funded project “Clinical exome analysis pipeline for eye disease next-generation sequencing panel”.</p>

<p>Post: Junior Research Fellow (1 Position)</p>

<p>Duration: Three years</p>

<p>Qualification: First class in M.Sc/M.tech in Bioinformatics/Life Sciences/Biophysics/ Biostatistics/Bioengineering. Experience in Database development, NGS data analysis, Systems Biology and Structural Bioinformatics is desired. Preference will be given to the candidates with good computer programming skills in C, C++, R, Perl, PHP, Unix Scripting etc.</p>

<p>Selected candidates will be paid fellowship as per existing DST norms.</p>

<p>How to apply:</p>

<p>Candidates are requested to apply through one of the two modes given below<br />1. Online application – Click here to submit the online application https://docs.google.com/forms/d/16h2GLnQ-Ny-tLtlgfY3Bx3sCjeHJE30cfhJaDqW_uRs/viewform?c=0&amp;w=1<br />2. Application forms can be downloaded from here.https://docs.google.com/file/d/0BwwJEudQStxFWXdNWXl4NWtDaWc/edit<br /> Filled in application form should be sent by post to Dr. D. Bharanidharan, Department of Bioinformatics, Aravind Medical Research Foundation No 1, Anna Nagar Madurai – 625 020,</p>

<p>Candidates should apply by online or submit their applications by post on or before 15th June, 2015. Only Short listed candidates will be called for an interview. No TA/DA will be paid.</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/pages/view/22571/pattern-matching-problem-solution-with-perl</guid>
	<pubDate>Tue, 09 Jun 2015 23:58:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/22571/pattern-matching-problem-solution-with-perl</link>
	<title><![CDATA[Pattern Matching Problem Solution with Perl]]></title>
	<description><![CDATA[<p>Problem at http://rosalind.info/problems/1c/</p><p>#Find all occurrences of a pattern in a string.<br />#Given: Strings Pattern and Genome.<br />#Return: All starting positions in Genome where Pattern appears as a substring. Use 0-based indexing.<br /><br />use strict;<br />use warnings;<br /><br />my $string="GATATATGCATATACTT";<br />my $subStr="ATAT";<br />my $kmer=length($subStr);<br /><br />kmerMatch ($string, $subStr, $kmer);<br /><br />sub kmerMatch { #Check the exact matching kmers with sliding window<br />my ($string, $myStr, $kmer)=@_;<br />for (my $aa=0; $aa&lt;=(length($string)-$kmer); $aa++) {<br />&nbsp;&nbsp;&nbsp; my $myWin=substr&nbsp; $string, $aa,$kmer;<br />&nbsp;&nbsp;&nbsp; if ($myWin eq $myStr) {<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; #print "$myWin eq $myStr\n";<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; print $aa;<br />&nbsp;&nbsp;&nbsp; }<br />}<br />}</p>]]></description>
	<dc:creator>Jit</dc:creator>
</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/news/view/22769/ensembl-27</guid>
	<pubDate>Tue, 16 Jun 2015 16:10:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/22769/ensembl-27</link>
	<title><![CDATA[Ensembl 27]]></title>
	<description><![CDATA[<h3>What is new?</h3><ul>
<li>Expansion of Protists and Fungi with hundreds of annotated genomes</li>
<li>Variation data for bread wheat, rice, <em>Aedes aegypti</em>, and <em>Ixodes scapularis</em></li>
<li>Whole genome alignments for <em>O. longistaminata</em> and <em>T. cacao</em></li>
<li>Non-coding RNA gene models in <a href="http://bacteria.ensembl.org">Bacteria</a></li>
<li>New assembly of tomato (version 2.50)</li>
<li>Full support for UCSC Track Hub format for hosting your own data in Ensembl</li>
</ul><p>More at http://www.ensembl.info/blog/2015/06/16/ensembl-genomes-release-27-is-out/</p>]]></description>
	<dc:creator>Jit</dc:creator>
</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/opportunity/view/22786/ra-at-university-of-delhi</guid>
  <pubDate>Wed, 17 Jun 2015 20:35:35 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA at University of Delhi]]></title>
  <description><![CDATA[
<p>Research Scientist Jobs opportunity in University of Delhi on temporary basis</p>

<p>Qualifications : Ph. D.</p>

<p>Desirable : Experience on DNA Markers, plant genome mapping and bioinformatics</p>

<p>No. of Post : 03</p>

<p>Department : Genetics</p>

<p>Salary : Rs. 60,000/-<br />How to apply</p>

<p>The applicants are requested to register their names on the day of interview in the First Floor, Biotech Centre, Centre for Genetic Manipulation of Crop Plants, Department of Genetics before the stipulated time for the interview. Only the registered eligible candidates will be interviewed on the day in the Committee Room. Applicants are requested to bring all related documents, in original and a set of photocopy, for verification. Date and time of the interview : 25.06.2015 at 10:30 AM.</p>

<p>Click Here for Job Details http://www.du.ac.in/du/index.php?mact=News,cntnt01,detail,0&amp;cntnt01articleid=5492&amp;cntnt01returnid=83</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/poll/view/22906/at-what-age-did-you-gain-passion-in-bioinformatics</guid>
	<pubDate>Tue, 23 Jun 2015 10:39:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/poll/view/22906/at-what-age-did-you-gain-passion-in-bioinformatics</link>
	<title><![CDATA[At what age did you gain passion in Bioinformatics?]]></title>
	<description><![CDATA[<p>Most of the bioinformatician were biologist ( yeah ... not all ;), and at later stage they gain a passion in Bioinformatics and learn it. When did you get inclined towards computational analysis of biological data?</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>