<?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/31382?offset=1220</link>
	<atom:link href="https://bioinformaticsonline.com/related/31382?offset=1220" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/3952/ancestor-at-work</guid>
	<pubDate>Sun, 25 Aug 2013 19:45:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/3952/ancestor-at-work</link>
	<title><![CDATA[Ancestor at work !!!]]></title>
	<description><![CDATA[<p>When they will learn Bioinformatics :)</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/3952" length="10064" type="image/gif" />
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</guid>
	<pubDate>Tue, 25 Jul 2017 08:48:25 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33960/mgra-breakpoint-graphs-and-ancestral-genome-reconstructions</link>
	<title><![CDATA[MGRA: Breakpoint graphs and ancestral genome reconstructions]]></title>
	<description><![CDATA[<p>MGRA (Multiple Genome Rearrangements and Ancestors) is a tool for reconstruction of ancestor genomes and evolutionary history of extant genomes.</p>
<p>It takes as an input a set of genomes represented as sequences of genes (or synteny blocks) and produces such sequences for ancestral genomes at the internal nodes of the phylogenetic tree.</p>
<p>The phylogenetic tree may be also specified completely or partially, in the latter case MGRA can reconstruct conserved ancestral regions (CARs) of the ancestral genome of interest.</p>
<p>Since version 2 MGRA supports gene insertion and deletions in addition to genome rearrangements and allows the input genomes to have different gene content.</p>
<p>It also can reconstruct most plausible phylogenetic tree based on the rearrangement characters.</p><p>Address of the bookmark: <a href="http://mgra.cblab.org/" rel="nofollow">http://mgra.cblab.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/4835/chang-lab</guid>
  <pubDate>Tue, 24 Sep 2013 17:25:49 -0500</pubDate>
  <link></link>
  <title><![CDATA[Chang lab]]></title>
  <description><![CDATA[
<p>The Chang lab is focused on how the activities of hundreds or even thousands of genes (gene parties) are coordinated to achieve biological meaning. We have pioneered methods to predict, dissect, and control large-scale gene regulatory programs; these methods have provided insights into human development, cancer, and aging. A particular interest is how cells know and remember their locations in the body, particularly with the help of long noncoding RNAs.</p>

<p>More at http://changlab.stanford.edu/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34377/genomicus-genome-browser-that-enables-users-to-navigate-in-genomes-in-several-dimensions</guid>
	<pubDate>Sat, 18 Nov 2017 16:10:16 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34377/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>Address of the bookmark: <a href="http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl" rel="nofollow">http://genomicus.biologie.ens.fr/genomicus-90.01/cgi-bin/search.pl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/4155/genetics-for-fun-and-profit-andrew-hessel-at-tedxvilnius</guid>
	<pubDate>Sun, 01 Sep 2013 19:15:06 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/4155/genetics-for-fun-and-profit-andrew-hessel-at-tedxvilnius</link>
	<title><![CDATA[Genetics for Fun and Profit: Andrew Hessel at TEDxVilnius]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/A2h_JW7X_HE" frameborder="0" allowfullscreen></iframe>Andrew Hessel co-chairs the Bioinformatics and Biotechnology track at the Singularity University, an institution founded by futurist Ray Kurzweil and X Prize Foundation CEO Peter Diamandis, with sponsorship from world-leading organizations that include Google, Autodesk, and NASA. He is also the founder of the Pink Army Cooperative, a venture aiming to make open source personalized cancer therapies. His work has been featured in The New York Times, Futurist Magazine, H+, and Wired News.

In the spirit of ideas worth spreading, TEDx is a program of local, self-organized events that bring people together to share a TED-like experience. At a TEDx event, TEDTalks video and live speakers combine to spark deep discussion and connection in a small group. These local, self-organized events are branded TEDx, where x = independently organized TED event. The TED Conference provides general guidance for the TEDx program, but individual TEDx events are self-organized.* (*Subject to certain rules and regulations)]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34571/mugsy-multiple-whole-genome-alignment-tool</guid>
	<pubDate>Fri, 08 Dec 2017 17:41:14 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34571/mugsy-multiple-whole-genome-alignment-tool</link>
	<title><![CDATA[Mugsy: multiple whole genome alignment tool]]></title>
	<description><![CDATA[<p><span>Mugsy is a multiple whole genome aligner. Mugsy uses Nucmer for pairwise alignment, a custom graph based segmentation procedure for identifying collinear regions, and the segment-based progressive multiple alignment strategy from Seqan::TCoffee. Mugsy accepts draft genomes in the form of multi-FASTA files and does not require a reference genome.</span></p>
<p>To cite Mugsy, use:</p>
<p>Angiuoli SV and Salzberg SL.&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/27/3/334">Mugsy: Fast multiple alignment of closely related whole genomes.</a><em>Bioinformatics</em>&nbsp;2011 27(3):334-4</p><p>Address of the bookmark: <a href="http://mugsy.sourceforge.net/" rel="nofollow">http://mugsy.sourceforge.net/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/4314/postdocs-positions-in-computer-science-in-helsinki-finland</guid>
  <pubDate>Fri, 06 Sep 2013 10:11:19 -0500</pubDate>
  <link></link>
  <title><![CDATA[PostDocs positions in computer science in HELSINKI, FINLAND]]></title>
  <description><![CDATA[
<p>Several university departments in the Helsinki region, Finland, are looking for postdoctoral researchers in the field of computer science and information technology. Jobs are available at:<br />·       Helsinki Institute for Information Technology HIIT, Aalto University and University of Helsinki, http://www.hiit.fi<br />·       Department of Computer Science, University of Helsinki, http://www.cs.helsinki.fi<br />·       Department of Information and Computer Science, Aalto University, http://ics.aalto.fi<br />·       Department of Computer Science and Engineering, Aalto University, http://cse.aalto.fi<br />·       Department of Mathematics and Statistics, University of Helsinki, http://mathstat.helsinki.fi/english/<br /> <br />Why Helsinki?<br />The collaborating Aalto University and University of Helsinki form a leading hub of computer science and modelling, including Machine learning, Data mining, Algorithms, Computational Logic, Cloud computing, Distributed computing, Human-centric ubiquitous ICT, Bioinformatics, etc.<br />Helsinki region is a safe, pleasant and attractive place to live in, with well-functioning services such as public transport etc. Finland has a comprehensive social security and health care system, including exceptionally good parental leaves, and children's day care services.<br /> <br />Positions are offered in:<br />Algorithm engineering (String Algorithms group)<br />Algorithmic bioinformatics (Genome-Scale Algorithmics group)<br />Automated reasoning and search, especially propositional logic (Computational Logic group)<br />Computational astrophysics and/or data analysis (Computational Methods and Data Analysis for Astrophysics group)<br />Computational biology and statistical methods in bioinformatics (Computational Systems Biology group)<br />Computational creativity and data mining (Discovery group)<br />Dynamic and large-scale networked systems (Data Communications Software group)<br />Intelligent multimodal information access (Content-Based Image and Information Retrieval Group)<br />Machine learning and neuroscience (Statistical Machine Learning group)<br />Machine learning for structured data (Kernel Machines, Pattern Analysis and Computational Biology group)<br />Machine learning methods for infectious disease epidemiology (Bayesian Statistics Group)<br />Probabilistic modeling and machine learning (Complex Systems Computation group)<br />Statistical machine learning (Statistical Machine Learning group)<br />Analysing ubiquitous sensor data (HIIT-Wide Focus Area)<br />Interactive visualization (HIIT-Wide Focus Area)<br />Affective computing and BCI (HIIT-Wide Focus Area)<br />Intelligent user interfaces and/or recommender systems (HIIT-Wide Focus Area)<br />Information retrieval and HCI (HIIT-Wide Focus Area)<br />Machine learning and data analysis, especially information retrieval, HCI, text and context data (HIIT-Wide Focus Area)<br />Probabilistic modeling and data analysis for bioinformatics (HIIT-Wide Focus Area)</p>

<p>More at http://www.hiit.fi/postdoc-call-2013</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35135/alitv%E2%80%94interactive-visualization-of-whole-genome-comparisons</guid>
	<pubDate>Wed, 10 Jan 2018 07:08:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35135/alitv%E2%80%94interactive-visualization-of-whole-genome-comparisons</link>
	<title><![CDATA[AliTV—interactive visualization of whole genome comparisons]]></title>
	<description><![CDATA[<p>AliTV, which provides interactive visualization of whole genome alignments. AliTV reads multiple whole genome alignments or automatically generates alignments from the provided data. Optional feature annotations and phylo- genetic information are supported. The user-friendly, web-browser based and highly customizable interface allows rapid exploration and manipulation of the visualized data as well as the export of publication-ready high-quality figures. AliTV is freely available at&nbsp;<a href="https://github.com/AliTVTeam/AliTV">https://github.com/AliTVTeam/AliTV</a></p>
<p>https://alitvteam.github.io/AliTV/</p><p>Address of the bookmark: <a href="https://github.com/AliTVTeam/AliTV" rel="nofollow">https://github.com/AliTVTeam/AliTV</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/4351/cpcri-kasaragod-bioinformatics-pa</guid>
  <pubDate>Sat, 07 Sep 2013 14:15:53 -0500</pubDate>
  <link></link>
  <title><![CDATA[CPCRI Kasaragod Bioinformatics PA]]></title>
  <description><![CDATA[
<p>CENTRAL PLANTATION CROPS RESEARCH INSTITUTE<br />(Indian Council of Agricultural Research)<br />KASARAGOD -671 124, KERALA</p>

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

<p>Walk-in-test cum interview for selection to the following temporary assignments sanctioned under the DBT sponsored adhoc time bound research scheme entitled "Establishment of a Sub-DIC" will be held at CPCRl, Kudlu PO, Kasaragod District, Kerala -6711 24 on the date and time indicated against each:</p>

<p>Project Assistant</p>

<p>    Qualification: Essential: Masters Degree in Bioinformatics / B.Tech Degree in Bioinformatics</p>

<p>    Desirable: 1. Experience in the field of bioinformatics<br />    2. M.Phil / Doctoral degree in the field</p>

<p>    Date of interview 24.09.2013 at 10.00 a.m.</p>

<p>Trainee – 2 Posts</p>

<p>    Essential: Masters Degree in Bioinformatics or B.Tech Degree in Bioinformatics.</p>

<p>    Date of interview 25.09.2013 at 10.00 a.m.</p>

<p>Studentship – 2 Posts</p>

<p>    Essential Final Year/Semester students of MSc Bioinformatics or B.Tech Bioinformatics</p>

<p>    Date of Interview 25.09.2013 at 10.00 a.m.</p>

<p>The candidates fulfilling the above eligibility criteria for Item No.1 &amp; II shall apply online and walk-in for a written test and interview at CPCRI, Kasaragod on the respective dates at 10.00 a.m. The candidates for Studentship should submit the application through their Head of the Department. They shall also bring with them a set of bio data and original certificates in proof of age, educational qualifications, experience etc. Candidates who fail to produce the original of the Degree/PO certificates OR provisional certificate will not be allowed to attend the test / interview. Those who are qualified in written test will only be permitted to attend the interview.</p>

<p>No TA will be paid for the journey for attending the interview.</p>

<p>Advertisement: http://www.cpcri.gov.in/images/images/opportunity/sep4_opp.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35883/arcs-scaffolding-genome-drafts-with-linked-reads</guid>
	<pubDate>Tue, 06 Mar 2018 16:35:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35883/arcs-scaffolding-genome-drafts-with-linked-reads</link>
	<title><![CDATA[ARCS: scaffolding genome drafts with linked reads]]></title>
	<description><![CDATA[<p><span>ARCS, an application that utilizes the barcoding information contained in linked reads to further organize draft genomes into highly contiguous assemblies. We show how the contiguity of an ABySS&nbsp;</span><em>H.sapiens</em><span>genome assembly can be increased over six-fold, using moderate coverage (25-fold) Chromium data. We expect ARCS to have broad utility in harnessing the barcoding information contained in linked read data for connecting high-quality sequences in genome assembly drafts.</span></p><p>Address of the bookmark: <a href="https://github.com/bcgsc/ARCS/" rel="nofollow">https://github.com/bcgsc/ARCS/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>