<?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/8504?offset=340</link>
	<atom:link href="https://bioinformaticsonline.com/related/8504?offset=340" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40465/airlift-a-methodology-and-tool-for-comprehensively-moving-mappings-and-annotations-from-one-genome-to-another-similar-genome</guid>
	<pubDate>Mon, 23 Dec 2019 10:20:13 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40465/airlift-a-methodology-and-tool-for-comprehensively-moving-mappings-and-annotations-from-one-genome-to-another-similar-genome</link>
	<title><![CDATA[AirLift, a methodology and tool for comprehensively moving mappings and annotations from one genome to another similar genome]]></title>
	<description><![CDATA[<p>We propose AirLift, a methodology and tool for comprehensively moving mappings and annotations from one genome to another similar genome while maintaining the accuracy of a full mapper.</p><p>Address of the bookmark: <a href="https://github.com/CMU-SAFARI/AirLift" rel="nofollow">https://github.com/CMU-SAFARI/AirLift</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/18382/google-genomics</guid>
	<pubDate>Fri, 17 Oct 2014 02:14:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/18382/google-genomics</link>
	<title><![CDATA[Google Genomics]]></title>
	<description><![CDATA[<p>Google Genomics provides an API to store, process, explore, and share DNA sequence reads, reference-based alignments, and variant calls, using Google's cloud infrastructure.</p>
<ul>
<li><strong>Store</strong> alignments and variant calls for one genome or a million.</li>
<li><strong>Process</strong> genomic data in batch by running principal component analysis or Hardy-Weinberg equilibrium, in minutes or hours, by using parallel computing frameworks like MapReduce.</li>
<li><strong>Explore</strong> data by slicing alignments and variants by genomic range across one or multiple samples -- for your own algorithms or for visualization; or interactively process entire cohorts to find transition/transversion ratios, allelic frequency, genome-wide association and more using BigQuery.</li>
<li><strong>Share</strong> genomic data with your research group, collaborators, the broader community, or the public. You decide.</li>
</ul>
<p>Google Genomics is implementing the API defined by the <a href="http://genomicsandhealth.org/">Global Alliance for Genomics and Health</a> for visualization, analysis and more. Compliant software can access Google Genomics, local servers, or any other implementation.</p><p>Address of the bookmark: <a href="https://cloud.google.com/genomics/" rel="nofollow">https://cloud.google.com/genomics/</a></p>]]></description>
	<dc:creator>Reshma Khatun</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/18578/research-scientist-%E2%80%93-national-institute-of-cholera-and-enteric-diseases</guid>
  <pubDate>Wed, 22 Oct 2014 10:26:46 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Scientist – National Institute of Cholera and Enteric Diseases]]></title>
  <description><![CDATA[
<p>The following post is to be filled up on purely temporary basis under the project entitled "Second phase of Task Force Biomedical Informatics Center of ICMR" under Dr. Santasabuj Das, Scientist 'D' of this Institute:-</p>

<p>01. Scientist II 01<br />Essential: Ph.D. degree in Life Sciences from a recognized university along with a minimum of 2 years of research experience in Bioinformatics as evidenced by publications in the peer reviewed journals.</p>

<p>OR<br />Ph.D. degree in Bioinformatics from a recognized university.</p>

<p>OR<br />M.Sc. in Bioinformatics from a recognized university along with a minimum of 3 years of research experience in Bioinformatics as evidenced by publications in the peer reviewed journals.</p>

<p>Desirable:<br />Thorough Knowledge about In silico genome analysis and comparative genomics.<br />Experience with in silico identification of novel virulence factors of pathogens, host-pathogen interactions and Systems Biology.<br />Additional Postdoctoral research experience in relevant subjects from a recognized institutions.</p>

<p>Rs. 44,000/- p.m. (consolidated) plus 30% HRA</p>

<p>Below 40 years</p>

<p>Applications along with Bio-Data containing detail work experience and full list of publications may be sent via email tosantasabujdas@yahoo.com latest by October 27, 2014.</p>

<p>Short-listed candidates will be called via email for an interview to be held at the institute in the second week of November, 2014.</p>

<p>Advertisement: www.niced.org.in/placements.htm</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19086/postdoctoral-fellowship-in-bioinformatics</guid>
  <pubDate>Sat, 08 Nov 2014 14:41:14 -0600</pubDate>
  <link></link>
  <title><![CDATA[Postdoctoral fellowship in Bioinformatics]]></title>
  <description><![CDATA[
<p>A two-year post-doctoral position is available in the Biocomputing group of the Sapienza University led by Anna Tramontano to work on either genomics research or structural bioinformatics, focusing on the study of relevant biomedical problems.<br />The ideal candidate should be motivated and talented, hold a PhD degree, have good programming skills, a grasp of statistical methods and an understanding of biology.<br />Experience in the development of computational biology methods would be an added value.</p>

<p>Good communication skills and fluency in spoken and written English are required.<br />Please apply sending a curriculum vitae, the names of at least two referees and a letter of motivation describing past experience and future goals to anna.tramontano@uniroma1.it with subject: “Application for post-doctoral position November 2014 YOUR LAST NAME”</p>

<p>Deadline: No later than November 28th, 2014.<br />Duration: 2 years</p>

<p>Salary on grant: Commeasured to the experience of the candidate<br />Contact Person (Referent): Anna Tramontano<br />Ref. E-Mail: anna.tramontano@uniroma1.it<br />Group Web Page: http:/www.biocomputing.it</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43620/ncbi-datasets-cli-quickstart-command-line-tools</guid>
	<pubDate>Tue, 07 Dec 2021 02:51:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43620/ncbi-datasets-cli-quickstart-command-line-tools</link>
	<title><![CDATA[ncbi-datasets-cli -- Quickstart: command line tools !]]></title>
	<description><![CDATA[<p><span>Install and use the NCBI Datasets command line tools</span></p>
<p>The NCBI Datasets datasets command line tools are&nbsp;<a href="https://www.ncbi.nlm.nih.gov/datasets/docs/v1/reference-docs/command-line/datasets/">datasets</a>&nbsp;and&nbsp;<a href="https://www.ncbi.nlm.nih.gov/datasets/docs/v1/reference-docs/command-line/dataformat/">dataformat</a>&nbsp;.</p>
<p>Use&nbsp;<span>datasets</span>&nbsp;to download biological sequence data across all domains of life from NCBI.</p>
<p>Use&nbsp;<span>dataformat</span>&nbsp;to convert metadata from&nbsp;<a href="https://jsonlines.org/" target="_blank">JSON Lines</a>&nbsp;format to other formats.</p>
<p><strong>Conda download:</strong></p>
<p>https://anaconda.org/conda-forge/ncbi-datasets-cli</p>
<p><strong>Buld Download</strong></p>
<p>&nbsp;https://www.ncbi.nlm.nih.gov/datasets/builder/?tax_id=29979</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/datasets/docs/v1/quickstarts/command-line-tools/" rel="nofollow">https://www.ncbi.nlm.nih.gov/datasets/docs/v1/quickstarts/command-line-tools/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19248/bioinformatics-jrfrasrf-position-at-institute-of-cytology-and-preventive-oncology-icpo</guid>
  <pubDate>Wed, 19 Nov 2014 20:16:32 -0600</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics JRF/RA/SRF position at Institute of Cytology and Preventive Oncology (ICPO)]]></title>
  <description><![CDATA[
<p>Institute of Cytology and Preventive Oncology (ICPO) I-7, Sector-39, Noida-201301</p>

<p>Candidates having the below mentioned qualifications may appear for walk in interview at ICPO on 2nd December 2014 between 10.00 AM and 12:00 PM under the below time bound projects under Dr. Subhash M. Agarwal, Scientist C. The post is purely temporary and co-terminus with the project.</p>

<p>Research Assistant (One)<br />25650/- consolidated<br />Discovery of EGFR secondary mutant inhibitors using structure based screening approach (ICMR)<br />Duration: 7 months</p>

<p>Essential: M.Sc./ M.Tech in Bioinformatics or any other related subject with good academic record.</p>

<p>Desirable: Experience in scripting and molecular docking.<br />	<br />Below 30 years</p>

<p>Junior Research Fellow (One)</p>

<p>16,000 + 30% HRA = Rs. 20800/-</p>

<p>Identification of novel inhibitors targeting EGFR using an integrated ligand and structure based approach (DBT)</p>

<p>Duration: 9 months</p>

<p>Essential: M.Sc./ M.Tech in Bioinformatics or any other related subject with good academic record. Candidates with CSIR-UGC / ICMR, NET qualification will be preferred</p>

<p>Desirable: Experience in scripting, QSAR and molecular docking.<br />	<br />Below 28 years</p>

<p>Interested eligible candidates may send their applications with Bio-data by email at (smagarwal@gmail.com) or by post addressed to Dr. Subhash M Agarwal, Scientist C, Institute of Cytology and Preventive Oncology (ICPO) I-7, Sector-39, Noida-201301 so as to reach latest by 1st December, 2014. The candidates may appear for interview at ICPO along with 3 copies of CV, photo and relevant certificates of qualifications in original and reprints of publications at the time of interview. It should be noted that No TA/DA will be paid for the walk in Interview.</p>

<p>Advertisement: www.icpo.org.in/advt-walk-in-interview.docx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/19556/genome-origami</guid>
	<pubDate>Fri, 12 Dec 2014 22:48:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/19556/genome-origami</link>
	<title><![CDATA[Genome Origami]]></title>
	<description><![CDATA[<p>There are several interesting factoid about our genomes, one of them is their folding. If we stretched out the DNA in a single cell, which is only a few millionths of an inch wide, it would span more than six feet. In other word, the size of six feet DNA fold themself to fit in a few millionths of an inch wide space. These DNA folding is a dynamic process that changes over time (!!). Researchers around the world have been trying to understand how DNA folds itself up so efficiently, and a recent post on the NIH Director&rsquo;s Blog highlights new research illustrating how the human genome folds inside the cell&rsquo;s nucleus, as well as how DNA folding affects gene regulation. The research team created this delightful video that demonstrates the principles involved using origami art.</p><p>http://bioinformaticsonline.com/videolist/watch/19555/a-3d-map-of-the-human-genome<br /><br />Researchers have been working to determine how cells regulate gene expression for nearly as long as we&rsquo;ve known about DNA. How, for example, do nerve cells know to turn off only nerve cell genes and turn off bone cell genes? DNA folding loops are part of the answer. This research team, which published their findings in a paper in Cell http://www.cell.com/cell/abstract/S0092-8674%2814%2901497-4 , found that the number of loops is much lower than expected. There are only 10,000 loops instead of the predicted millions, and they form on/off switches in DNA.<br /><br /></p><p>More at http://www.eurekalert.org/pub_releases/2014-12/ru-3mr121114.php</p><p>Reference http://www.cell.com/cell/abstract/S0092-8674%2814%2901497-4</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43736/odgi-optimized-dynamic-genomegraph-implementation</guid>
	<pubDate>Tue, 01 Feb 2022 23:42:21 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43736/odgi-optimized-dynamic-genomegraph-implementation</link>
	<title><![CDATA[odgi: optimized dynamic genome/graph implementation]]></title>
	<description><![CDATA[<p dir="auto"><code>odgi</code>&nbsp;provides an efficient and succinct dynamic DNA sequence graph model, as well as a host of algorithms that allow the use of such graphs in bioinformatic analyses.</p>
<p dir="auto">Careful encoding of graph entities allows&nbsp;<code>odgi</code>&nbsp;to efficiently compute and transform&nbsp;<a href="https://pangenome.github.io/">pangenomes</a>&nbsp;with minimal overheads.&nbsp;<code>odgi</code>&nbsp;implements a dynamic data structure that leveraged multi-core CPUs and can be updated on the fly.</p>
<p dir="auto">The edges and path steps are recorded as deltas between the current node id and the target node id, where the node id corresponds to the rank in the global array of nodes. Graphs built from biological data sets tend to have local partial order and, when sorted, the deltas be small. This allows them to be compressed with a variable length integer representation, resulting in a small in-memory footprint at the cost of packing and unpacking.</p>
<p dir="auto">The RAM and computational savings are substantial. In partially ordered regions of the graph, most deltas will require only a single byte.</p><p>Address of the bookmark: <a href="https://github.com/pangenome/odgi" rel="nofollow">https://github.com/pangenome/odgi</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/19545/walk-%E2%80%93-in-%E2%80%93-interview-agricultural-knowledge-management-unit-indian-agricultural-research-institute-new-delhi-110012</guid>
  <pubDate>Fri, 12 Dec 2014 21:33:02 -0600</pubDate>
  <link></link>
  <title><![CDATA[WALK – IN – INTERVIEW @ Agricultural Knowledge Management Unit Indian Agricultural Research Institute, New Delhi-110012]]></title>
  <description><![CDATA[
<p>Walk-in-interview for the following temporary positions will be conducted on 20th December 2014 (between 10:00 AM to 01:00 PM) at Agricultural Knowledge Management Unit, A0 block (Ground Floor), LBS Building, Indian Agricultural Research Institute, New Delhi-110012:</p>

<p>1 Dr. A.K.Mishra Coordinator &amp; PI (BTISnet)</p>

<p>Traineeship (two) for one year</p>

<p>Rs. 5000/- (consolidated)</p>

<p>M.Sc. (Bioinformatics) with 60 % marks from a recognized University</p>

<p>20-12-2014 (10:00 AM -11:00 AM)</p>

<p>Studentship (four) for one year</p>

<p>Rs. 2500/- (consolidated)</p>

<p>Final year M.Sc./ M.Tech (Bioinformatics) Students from a recognized University</p>

<p>20-12-2014 (11:00 AM- 1:00 PM)</p>

<p>The positions are purely temporary and co-terminus with the DBT Programme. Eligible candidates are requested to submit the application form in the prescribed format along with original certificates/ documents (Degree, Marks sheets, Work experience, if any) at the time of interview. No TA/DA will be paid. Maximum age limit is 28 years for all positions. Age relaxation of 5 yrs for SC/ST and woman candidates and 3 years for OBC candidates will be given. Canvassing in any form invites disqualification.</p>

<p>Advertisement: http://www.iari.res.in/files/BIC-08122014-20141208-172344.pdf</p>
]]></description>
</item>
<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>

</channel>
</rss>