<?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/27348?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/related/27348?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/38257/bioinformatics-programme-officer-international-centre-for-genetic-icgeb-engineering-and-biotechnology</guid>
  <pubDate>Fri, 23 Nov 2018 03:50:16 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Programme Officer @ International Centre for Genetic ICGEB Engineering and Biotechnology]]></title>
  <description><![CDATA[
<p>The following vacancies are available in the DBT Apex Biotechnology Information project at ICGEB, New Delhi, India. These positions are available for a period of approx. two years, however, initial appointment offer will be for 6 months, which will be extended based on performance of work. Salaries will be offered as per DBT, educational qualification and experience. Depending on requirements, selected candidates may be required to work on location from the Department of Biotechnology, New Delhi. Shortlisted candidates will be invited for an interview at ICGEB. Only the selected candidates will be informed individually. No TA/DA or accommodation will be offered to the candidates attending the interview. </p>

<p>4 Programme Officer 1 <br />5 Technical Research Assistant 1 </p>

<p>Minimum Educational Qualification, desirable experience and expected duties: </p>

<p>4: The applicants should be Postgraduates with experience in Data collection and Statistics, especially in Biotechnology-related data. </p>

<p>Expected duties: Collection of Biotechnology related information from India, to facilitate the Apex BTIC experts committee review of programmes at centres and R&amp;D programs funded by DBT. </p>

<p>5: The applicants should be Postgraduates in Science with experience in Bioinformatics-related projects. <br />Expected duties: The candidates will assist the senior staff of the centre in daily activities and help in the preparation of the Annual Training Calendar, seminar and training podcasts/videos, repository of training material and Apex BTIC Newsletter. </p>

<p>Interested candidates should submit their full, updated Curriculum Vitae with a detailed description of relevant experience, along with two references by December 14th, 2018, addressed to, The Chairperson, DBT- Apex BTIC, ICGEB, Aruna Asaf Ali Marg, New Delhi 110067, Email: abtic@icgeb.res.in, kindly write “Application for DBT Apex BTIC vacancy” in the subject of the email or envelope, if sending by post.</p>

<p>Advertisement: http://www.icgeb.org/tl_files/Vacancies/dbt-abtic-vac-annmntrevsk.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44773/genetic-basis-of-tail-loss-evolution</guid>
	<pubDate>Tue, 04 Mar 2025 12:12:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44773/genetic-basis-of-tail-loss-evolution</link>
	<title><![CDATA[Genetic basis of tail-loss evolution]]></title>
	<description><![CDATA[<p>The paper <em>"On the genetic basis of tail-loss evolution in humans and apes (https://www.nature.com/articles/s41586-024-07095-8)"</em>, published in <em>Nature</em>, investigates the genetic mechanisms that led to the loss of tails in humans and apes. The study suggests that a specific genetic mutation, involving the insertion of an <em>Alu</em> element (a type of transposable DNA sequence), played a critical role in the evolutionary transition from tailed primates to tailless hominoids.</p><h3><strong>Key Findings of the Study:</strong></h3><ol>
<li>
<p><strong>Alu Insertion and Tail Loss:</strong><br /> The researchers discovered an <em>Alu</em>-mediated genetic change in a common ancestor of modern apes and humans. This change disrupted the normal function of a gene involved in tail development, leading to the suppression of tail formation.</p>
</li>
<li>
<p><strong>Gene Disruption Mechanism:</strong><br /> The <em>Alu</em> insertion was found within a regulatory region of the <em>TBXT</em> gene (also known as <em>T</em> or <em>Brachyury</em>), which is crucial for tail development in vertebrates. This insertion likely altered the gene's expression patterns, leading to tail reduction over evolutionary time.</p>
</li>
<li>
<p><strong>Functional Evidence from Model Organisms:</strong><br /> To test their hypothesis, the researchers introduced similar genetic modifications in mice. The modified mice exhibited shortened or absent tails, supporting the idea that the identified mutation played a role in tail loss in hominoids.</p>
</li>
<li>
<p><strong>Evolutionary Implications:</strong><br /> The findings suggest that small, random genomic changes&mdash;such as transposable element insertions&mdash;can have profound effects on body morphology. This study provides evidence that mobile DNA elements (like <em>Alu</em>) can drive major evolutionary transitions.</p>
</li>
<li>
<p><strong>Relevance to Human Evolution:</strong><br /> Understanding the genetic basis of tail loss helps in reconstructing the evolutionary history of hominins (the lineage that includes humans and our extinct relatives). It also sheds light on how genetic variations contribute to anatomical diversity among primates.</p>
</li>
</ol><h3><strong>Significance of the Study:</strong></h3><p>This research highlights the role of transposable elements in shaping evolutionary traits and provides a concrete genetic explanation for a defining characteristic of humans and great apes. It also demonstrates how mutations in regulatory regions of developmental genes can lead to significant anatomical changes.</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41125/chromonomer-a-tool-set-for-repairing-and-enhancing-assembled-genomes-through-integration-of-genetic-maps-and-conserved-synteny</guid>
	<pubDate>Mon, 17 Feb 2020 05:38:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41125/chromonomer-a-tool-set-for-repairing-and-enhancing-assembled-genomes-through-integration-of-genetic-maps-and-conserved-synteny</link>
	<title><![CDATA[Chromonomer: a tool set for repairing and enhancing assembled genomes through integration of genetic maps and conserved synteny]]></title>
	<description><![CDATA[<p>Chromonomer is a program designed to integrate a genome assembly with a genetic map. Chromonomer tries very hard to identify and remove markers that are out of order in the genetic map, when considered against their local assembly order; and to identify scaffolds that have been incorrectly assembled according to the genetic map, and split those scaffolds.</p><p>Address of the bookmark: <a href="http://catchenlab.life.illinois.edu/chromonomer/" rel="nofollow">http://catchenlab.life.illinois.edu/chromonomer/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39372/irnad-a-computational-tool-for-identifying-d-modification-sites-in-rna-sequence</guid>
	<pubDate>Thu, 16 May 2019 00:20:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39372/irnad-a-computational-tool-for-identifying-d-modification-sites-in-rna-sequence</link>
	<title><![CDATA[iRNAD: a computational tool for identifying D modification sites in RNA sequence]]></title>
	<description><![CDATA[<p><span>iRNAD, for identifying D modification sites in RNA sequence. In this predictor, the RNA samples derived from five species were encoded by nucleotide chemical property and nucleotide density. Support vector machine was utilized to perform the classification.&nbsp;</span></p>
<p><span><a href="http://lin-group.cn/server/iRNAD/">http://lin-group.cn/server/iRNAD/</a></span></p><p>Address of the bookmark: <a href="http://lin-group.cn/server/iRNAD/" rel="nofollow">http://lin-group.cn/server/iRNAD/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm</guid>
	<pubDate>Mon, 16 Mar 2020 10:09:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41452/apollo-a-sequencing-technology-independent-scalable-and-accurate-assembly-polishing-algorithm</link>
	<title><![CDATA[Apollo: A Sequencing-Technology-Independent, Scalable, and Accurate Assembly Polishing Algorithm]]></title>
	<description><![CDATA[<p><span>Apollo is an assembly polishing algorithm that attempts to correct the errors in an assembly. It can take multiple set of reads in a single run and polish the assemblies of genomes of any size. Described by Firtina et al. (preliminary version at&nbsp;</span><a href="https://arxiv.org/pdf/1902.04341.pdf">https://arxiv.org/pdf/1902.04341.pdf</a></p>
<p>More at&nbsp;<a href="https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1">https://academic.oup.com/bioinformatics/advance-article/doi/10.1093/bioinformatics/btaa179/5804978?rss=1</a></p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/Apollo" rel="nofollow">https://github.com/CMU-SAFARI/Apollo</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38702/quick-tour-of-genetic-algorithms</guid>
	<pubDate>Thu, 17 Jan 2019 03:42:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38702/quick-tour-of-genetic-algorithms</link>
	<title><![CDATA[Quick tour of Genetic Algorithms !]]></title>
	<description><![CDATA[<p><span>The R package&nbsp;</span><strong>GA</strong><span>&nbsp;provides a collection of general purpose functions for optimization using genetic algorithms. The package includes a flexible set of tools for implementing genetic algorithms search in both the continuous and discrete case, whether constrained or not. Users can easily define their own objective function depending on the problem at hand.&nbsp;</span></p>
<p><span>https://cran.r-project.org/web/packages/GA/vignettes/GA.html</span></p><p>Address of the bookmark: <a href="https://cran.r-project.org/web/packages/GA/vignettes/GA.html" rel="nofollow">https://cran.r-project.org/web/packages/GA/vignettes/GA.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</guid>
	<pubDate>Wed, 17 Jan 2018 03:47:46 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35249/gpopsim-a-simulation-tool-for-whole-genome-genetic-data</link>
	<title><![CDATA[GPOPSIM: a simulation tool for whole-genome genetic data]]></title>
	<description><![CDATA[<p><span>GPOPSIM is a simulation tool for pedigree, phenotypes, and genomic data, with a variety of population and genome structures and trait genetic architectures. It provides flexible parameter settings for a wide discipline of users, especially can simulate multiple genetically correlated traits with desired genetic parameters and underlying genetic architectures.</span></p><p>Address of the bookmark: <a href="https://github.com/SCAU-AnimalGenetics/GPOPSIM" rel="nofollow">https://github.com/SCAU-AnimalGenetics/GPOPSIM</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42923/flanker</guid>
	<pubDate>Sat, 27 Feb 2021 22:04:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42923/flanker</link>
	<title><![CDATA[Flanker]]></title>
	<description><![CDATA[<p><span>Flanker, a Python package which performs alignment-free clustering of gene flanking sequences in a consistent format, allowing investigation of&nbsp;<span>mobile genetic elements (</span>MGEs) without prior knowledge of their structure.&nbsp;<span>Flanker can be flexibly parameterised to finetune outputs by characterising upstream and downstream regions separately and investigating variable lengths of flanking sequence.</span></span></p>
<p><span><img src="https://github.com/wtmatlock/flanker/raw/main/docs/frontpage.png" alt="image" style="border: 0px;"></span></p><p>Address of the bookmark: <a href="https://github.com/wtmatlock/flanker" rel="nofollow">https://github.com/wtmatlock/flanker</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/23174/scaffolding-of-a-bacterial-genome-using-minion-nanopore-sequencing</guid>
	<pubDate>Tue, 07 Jul 2015 16:59:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/23174/scaffolding-of-a-bacterial-genome-using-minion-nanopore-sequencing</link>
	<title><![CDATA[Scaffolding of a bacterial genome using MinION nanopore sequencing]]></title>
	<description><![CDATA[<p><span>Second generation sequencing has revolutionized genomic studies. However, most genomes contain repeated DNA elements that are longer than the read lengths achievable with typical sequencers, so the genomic order of several generated contigs cannot be easily resolved. A new generation of sequencers offering substantially longer reads is emerging, notably the Pacific Biosciences (PacBio) RS II system and the MinION system, released in early 2014 by Oxford Nanopore Technologies through an early access program.</span></p><p>Address of the bookmark: <a href="http://www.nature.com/srep/2015/150707/srep11996/full/srep11996.html" rel="nofollow">http://www.nature.com/srep/2015/150707/srep11996/full/srep11996.html</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/41578/samhar-covid19-hackathon</guid>
	<pubDate>Fri, 17 Apr 2020 06:47:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/41578/samhar-covid19-hackathon</link>
	<title><![CDATA[SAMHAR-COVID19 Hackathon]]></title>
	<description><![CDATA[<p>Centre for Development of Advanced Computing (C-DAC) under the aegis of the National Supercomputing Mission (NSM), a Ministry of Electronics &amp; Information Technology (MeitY) and Department of Science &amp; Technology (DST) initiative, in association with NVIDIA &amp; OpenACC, announces the&nbsp;SAMHAR-COVID19 Hackathon.</p><p>Pandemic outbreak such as Coronavirus outbreak can create huge challenges for the Government and Public Health Officials to gather information quickly and coordinate a response. In such a situation, Artificial Intelligence (AI) can play a huge role in predicting, minimizing and stalling its spread of the virus.</p><p>C-DAC has embarked on a program&nbsp;SAMHAR-COVID19&nbsp;(Supercomputing using&nbsp;AI,&nbsp;ML,&nbsp;Healthcare&nbsp;Analytics based&nbsp;Research for combating COVID19). This opportunity will provide researchers to find solutions for Identifying, Tracking and Forecasting outbreaks of COVID19 and Facilitating Drug Discovery as well.</p><div><div><div><ul>
<li><span>Participants can update submissions multiple times till the Registration End date.</span></li>
<li><span>Each entry can be submitted by a Team comprising of minimum 3 and maximum 5 members (Including the Team Lead).</span></li>
<li><span>Participants will have to share the complete work activities with C-DAC. And C-DAC will have right to use the submitted application/solution for SAMHAR-COVID19 programs.</span></li>
<li><span>The Award will be given to the&nbsp;<span>Selected/Winning Entry</span>&nbsp;irrespective of the number of members in the Team (members may choose to distribute the amount among themselves).</span></li>
<li><span>The decision of the&nbsp;<span>Eminent Jury</span>&nbsp;on the&nbsp;<span>I<span>3</span>&nbsp;Award</span>&nbsp;will be final and binding.</span></li>
<li><span>Award can be for the Team/Company/Institution, as submitted in the Application and cannot be changed later.</span></li>
<li><span>Submissions will be considered void if they are in whole or part ill-eligible, incomplete, damaged, altered, counterfeit, obtained through fraud or late submission.</span></li>
<li></li>
</ul></div></div></div><p>More at&nbsp;<a href="https://samhar-covid19hackathon.cdac.in/">https://samhar-covid19hackathon.cdac.in/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

</channel>
</rss>