<?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/26629?offset=1420</link>
	<atom:link href="https://bioinformaticsonline.com/related/26629?offset=1420" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12218/assistant-professor-in-medical-bioinformatics</guid>
  <pubDate>Tue, 24 Jun 2014 01:46:36 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor in Medical Bioinformatics]]></title>
  <description><![CDATA[
<p>Advt. No : ME-I/A-IV/03/14<br />No.of Posts:01 (SC)<br />Pay Scale:<br />Pay Band of Rs.15600-39100 + Rs.6000/- GP +NPA @ 25% of Basic Pay +Learning Resource Allowance @ Rs.20,000/-P.A.+ Conveyance Allowance @ Rs. 1650/-P.M.+ Academic Allowance @ Rs.2500/- P.M. and other admissible allowances.<br />Qualifications:<br />Area of Specialization:-<br />Bioinformatics/Computational/Biology/Genomics/ Proteomics/ Structural Biology<br />1. Postgraduate qualification, e.g. Master’s Degree in Biotechnology/Bioinformatics/ Biophysics.<br />2. A Doctorate Degree of recognized University/Institute in a basic or allied Medical Science subject e.g. Medical Biotechnology/Biophysics. Bioinformatics/X-ray Crystallography/<br />Immunology/Structural Biology etc<br />Experience:<br />1.Minimum three years teaching and/or research experience in a recognized medical/research Institution in an allied medical subject after obtaining doctorate degree and preferably in Medical<br />Molecular Biology/ Biophysics/Structural Biology/Genomics and Clinical Proteomics/Computational Biology.<br />2. Minimum two publication with atleast one in international journal and atleast one as first author<br />Desirable:-<br />Consistently excellent scholastic/academic record, demonstrated ability to write grant proposal/(s) successfully, Post Doctoral training in a frontier area of medical Bioinformatics Research and of direct relevance to clinical diagnosis or patient care (preferably from a recognized top-ranking medical institution abroad)<br />Send your applications to O/O, Deputy Registrar, Recruitment &amp; Establishment Cell, University of Health Sciences, Rohtak by 08.7.2014<br />For more details,please visit website: http://pgimsrohtak.nic.in/2014%20AP%20Advt.pdf<br />Last Apply Date: 08 Jul 2014</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/43762/vicoso-group</guid>
  <pubDate>Wed, 02 Feb 2022 02:51:27 -0600</pubDate>
  <link></link>
  <title><![CDATA[Vicoso group]]></title>
  <description><![CDATA[
<p>The Vicoso group investigates how sex chromosomes evolve over time, and what biological forces are driving their patterns of differentiation.</p>

<p>The Vicoso group is interested in understanding several aspects of the biology of sex chromosomes, and the evolutionary processes that shape their peculiar features. By combining the use of next-generation sequencing technologies with studies in several model and non-model organisms, they can address a variety of standing questions, such as: Why do some Y chromosomes degenerate while others remain homomorphic, and how does this relate to the extent of sexual dimorphism of the species? What forces drive some species to acquire global dosage compensation of the X, while others only compensate specific genes? What are the frequency and molecular dynamics of sex-chromosome turnover?</p>

<p>More at https://ist.ac.at/en/research/vicoso-group/<br />http://pub.ist.ac.at/~bvicoso/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12582/postdoc-position-at-centre-mediterraneen-de-medecine-moleculaire</guid>
  <pubDate>Sun, 06 Jul 2014 11:23:06 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoc position at Centre Méditerranéen de Médecine Moléculaire]]></title>
  <description><![CDATA[
<p>The research group of Dr. Michele Trabucchi at the Centre Méditerranéen de Médecine Moléculaire (C3M) at INSERM U1065 (University of Nice Sophia-Antipolis, France) is seeking candidates for a Postdoctoral fellow position to start on October 2014 for 3 years funded by FRM (Fondation pour la Recherche Médicale).<br />The broad interest of the lab is in understanding the expression control and function of small RNAs in activated myeloid cells (visit our webpage to check research interests and publications of the group : http://www.unice.fr/c3m/EN/Equipe10.html ). </p>

<p>The work will focus on the functional studies of small RNAs by using next-generation sequencing approaches.<br /> <br />Candidates should hold a Ph.D. degree and have strong background in bioinformatics.<br />The University of Nice Sophia-Antipolis provides a wide range of facilities and training essential for biomedical research.<br />Interested applicants should send a PDF with a cover letter stating research interests and qualifications, an updated CV, a summary of previous research experience and contact information for two references to Michele Trabucchi ( mtrabucchi@unice.fr )</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/44679/rennison-lab</guid>
  <pubDate>Sat, 26 Oct 2024 15:10:32 -0500</pubDate>
  <link></link>
  <title><![CDATA[Rennison Lab !]]></title>
  <description><![CDATA[
<p>Welcome to the Rennison lab in the School of Biological Sciences at the University of California San Diego. We are a group interested in the evolution and maintenance of biodiversity. We study the processes related to biodiversity using methods from the fields of evolution, ecology, population genomics, and theory. </p>

<p>More at https://rennisonlab.com/</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/12870/nuclear-dynamics-lab</guid>
  <pubDate>Thu, 17 Jul 2014 15:03:27 -0500</pubDate>
  <link></link>
  <title><![CDATA[Nuclear Dynamics Lab]]></title>
  <description><![CDATA[
<p>Lab focus is to elucidate fundamental principles, new mechanisms, machineries and emergent properties that are involved in maintaining the genome and gene expression programmes for improvements in lifelong health and well-being for all.</p>

<p>More at http://www.babraham.ac.uk/our-research/nuclear-dynamics/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45235/the-sweet-side-of-human-evolution-did-sugar-help-build-the-human-brain</guid>
	<pubDate>Mon, 17 Aug 2026 01:47:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45235/the-sweet-side-of-human-evolution-did-sugar-help-build-the-human-brain</link>
	<title><![CDATA[The Sweet Side of Human Evolution: Did Sugar Help Build the Human Brain?]]></title>
	<description><![CDATA[<p>For a long time, people have focused on meat when talking about human evolution. The common idea is that our ancestors ate more animal foods, which gave them lots of energy and nutrients, helping their brains grow bigger and more demanding than those of other primates.</p><p>A new study in Science offers a different and surprisingly sweet perspective. Researchers Jennie Brand-Miller, Karen Hardy, David Raubenheimer, and Les Copeland suggest that sugars from fruits and honey, and later starch from cooked plants, may have been key in helping the human brain evolve.</p><p><strong>The brain&rsquo;s carbohydrate problem</strong></p><p>The human brain uses a lot of energy. Even though it is only about 2% of an adult&rsquo;s body weight, it takes up a large share of the body&rsquo;s resting energy, mainly using glucose as fuel. Over millions of years, as our ancestors&rsquo; brains grew from about 300 grams in Australopithecus afarensis to around 1,500 grams in modern humans, the need for easy-to-access glucose would have gone up a lot.</p><p>The researchers, therefore, asked a simple question: where did all that glucose come from?</p><p>Their analysis suggests that early hominins may have gotten much of their glucose from naturally sweet foods. Fruit and honey could give them easy access to sugars before they learned to digest cooked starch well. The study&rsquo;s models show that sugars may have made up a big part of their diet.</p><p>From fruit and honey to cooked starch</p><p>The story did not end with fruit.</p><p>The researchers suggest that humans shifted from eating sweet foods to eating cooked starchy foods. Once people learned to control fire and process food, cooking made starchy plants much easier to digest and turned them into a key source of glucose.</p><p>From this perspective, new ways of preparing food, like pounding, processing, and cooking, were not just about making meals softer or tastier. These changes may have given our ancestors access to much more carbohydrate energy.</p><p>This gives us a more detailed view of how the human diet evolved. Animal foods were clearly important, but carbohydrates may have been just as important for meeting the high energy needs of a growing brain.</p><p>A different way to think about the human diet</p><p>The study does not claim that our ancestors ate sugar the way we do today. There is a big difference between eating whole fruits or natural honey and eating the highly processed, refined sugars common now.</p><p>Instead, the research points to something bigger. Human evolution may have depended on our ability to find, process, and get energy from many different foods.</p><p>Seasonal fruit, honey, underground plant foods, and later cooked starches could have been important sources of glucose. The researchers think that changes in how available these foods were may have shaped how our ancestors searched for food and even affected human evolution.</p><p>What does this mean today?</p><p>The findings should not be interpreted as a license to eat more refined sugar. Instead, they challenge the simple idea that carbohydrates were less important than meat in human evolution. Our ancestors survived and evolved by exploiting different nutritional opportunities&mdash;and by developing technologies that made previously difficult foods more useful.</p><p>So perhaps the history of the human brain was not written by meat alone. ISo maybe the story of the human brain is not just about meat. It could also be about fruit, honey, roots, grains, and our unique ability to turn plants into energy. sweeter than we once imagined.<br /><br />Read more about it at&nbsp;https://www.science.org/doi/epdf/10.1126/science.aed8437</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/14218/pimp-your-brain-bioinformatics</guid>
	<pubDate>Wed, 20 Aug 2014 22:09:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/14218/pimp-your-brain-bioinformatics</link>
	<title><![CDATA[Pimp your brain: Bioinformatics]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/KqelGy6Q8nE" frameborder="0" allowfullscreen></iframe>Jan Lisec from the Max Planck Institute of Molecular Plant Physiology explains, in this "pimp your brain" episode, what bioinformatics is and why bioinformatics is so important and indispensable for biological research.

In the video serial "Pimp your brain" scientists from the Max Planck Institute of Molecular Plant Physiology describe their research. More videos from the 'Pimp your brain' serial are available on www.youtube.com/playlist?list=PL-l9VItC9Gn2Ur2Xj6PTOAkjLUlVPbIOO

More videos are available on www.mpimp-golm.mpg.de]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45299/the-gene-detectives-how-a-new-computational-tool-is-helping-us-read-the-history-written-in-our-genes</guid>
	<pubDate>Thu, 10 Sep 2026 21:23:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45299/the-gene-detectives-how-a-new-computational-tool-is-helping-us-read-the-history-written-in-our-genes</link>
	<title><![CDATA[The Gene Detectives: How a New Computational Tool Is Helping Us Read the History Written in Our Genes]]></title>
	<description><![CDATA[<p>Imagine opening an ancient family album with no names, dates, or captions. Some photographs are missing, others have been copied, and a few show people who look almost identical. Your challenge is to discover who is related to whom and reconstruct the family story. In evolutionary biology, scientists face a similar mystery when they study genes. Every genome contains clues about its past, but genes can be duplicated, lost, and changed over millions of years, making their history difficult to trace.</p><p>A recent study published in PLOS Computational Biology introduces REvolutionH-tl 2.0 (https://pypi.org/project/revolutionhtl/), a computational tool designed to help solve this mystery. The software analyzes protein sequences and identifies evolutionary relationships between genes. It can help researchers detect important events such as gene duplication, gene loss, and speciation, allowing them to reconstruct how genes evolved across different organisms.</p><p>What makes the tool especially interesting is its focus on both speed and interpretation. The researchers compared REvolutionH-tl 2.0 with several existing computational tools and reported that it achieved competitive accuracy while requiring less computational time in their tests. The tool also includes visualization features, helping researchers turn complicated genetic data into evolutionary stories that are easier to explore.</p><p>Genes are more than simple sequences of DNA; they are records of life&rsquo;s long history. Each surviving gene carries traces of the changes that shaped it. By bringing together computational analysis and visualization, REvolutionH-tl 2.0 acts like a detective, helping scientists uncover these hidden stories. Ultimately, tools like this can improve our understanding of how genomes evolved and how genes acquired the roles they perform today.</p><p>More at&nbsp;https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1013017</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/33306/ancestral-sequence-reconstruction-asr-or-ancestral-genesequence-reconstructionresurrection-tools-to-study-molecular-evolution</guid>
	<pubDate>Tue, 30 May 2017 04:20:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/33306/ancestral-sequence-reconstruction-asr-or-ancestral-genesequence-reconstructionresurrection-tools-to-study-molecular-evolution</link>
	<title><![CDATA[Ancestral sequence reconstruction (ASR) or ancestral gene/sequence reconstruction/resurrection tools to study molecular evolution]]></title>
	<description><![CDATA[<p><span><strong>Ancestral sequence reconstruction</strong><span>&nbsp;(</span><strong>ASR</strong><span>) &ndash; also known as&nbsp;</span><strong>ancestral gene</strong><span>/</span><strong>sequence reconstruction</strong><span>/</span><strong>resurrection</strong><span>&nbsp;&ndash; is a technique used in the study of&nbsp;</span>molecular evolution<span>. The method consists of the synthesis of an ancestral&nbsp;</span>gene<span>&nbsp;and expression of the corresponding ancestral&nbsp;</span>protein<span>.&nbsp;</span><sup id="cite_ref-thornton_1-0"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-thornton-1"></a></sup><span>The idea of protein 'resurrection' was suggested in 1963 by Pauling and Zuckerkandl.</span><sup id="cite_ref-2"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-2"></a></sup><span>&nbsp;Some early efforts were made in the eighties-nineties, led by the laboratory of&nbsp;</span>Steven A. Benner<span>, showing the potential of this technique &ndash; one that only started to be fulfilled in the post-genomic era.</span><sup id="cite_ref-3"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-3"></a></sup><span>&nbsp;Thanks to the improvement of algorithms and of better sequencing and synthesis techniques, the method was developed further in the early 2000s to allow the resurrection of a greater variety of and much more ancient genes.</span><sup id="cite_ref-4"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-4"></a></sup><span>&nbsp;Over the last decade, ancestral protein resurrection has developed as a strategy to reveal the mechanisms and dynamics of protein evolution.&nbsp;</span></span></p><p><img src="https://upload.wikimedia.org/wikipedia/commons/thumb/e/e4/ASR_phylogeny.png/510px-ASR_phylogeny.png" alt="image" width="610" height="435" style="border: 0px; border: 0px;"></p><p><span>Following are the list of&nbsp;</span><strong style="font-size: 12.8px;">Ancestral /sequence/ reconstruction</strong><span>&nbsp;(</span><strong style="font-size: 12.8px;">ASR</strong><span>) tools:&nbsp;</span></p><p><a href="http://www.bx.psu.edu/miller_lab/car/" target="_blank" title="To inferCars official website"><span>inferCars</span></a></p><p><span><span><span><span><span>Reconstructs contiguous regions of an ancestral genome. Given information about adjacencies between conserved segments in each modern species, our goal is to infer segment order in the ancestral genome. To get a clean and precise statement of the problem, we formalize it using graph theory. We develop an algorithm that identifies a most parsimonious scenario for the history of each individual adjacency, although the whole-genome prediction is not guaranteed to optimize traditional measures like the number of breakpoints. We introduce weights to the graph edges to model the reliability of each adjacency.</span></span></span></span></span></p><p><span><span><a href="http://paleogenomics.irmacs.sfu.ca/ANGES/" target="_blank" title="To ANGES official website">ANGES</a>:</span><a href="http://paleogenomics.irmacs.sfu.ca/ANGES/" target="_blank" title="To ANGES official website">reconstructing ANcestral GEnomeS maps</a></span></p><p><span><span><span><span><span><span>A suite of Python programs that allows reconstructing ancestral genome maps from the comparison of the organization of extant-related genomes. ANGES can reconstruct ancestral genome maps for multichromosomal linear genomes and unichromosomal circular genomes. It implements methods inspired from techniques developed to compute physical maps of extant genomes.</span></span></span></span></span></span></p><p><a href="http://virulence.molgen.mpg.de/cocos/" target="_blank" title="To Cocos official website"><span>Cocos</span></a></p><p><span><span><span><span><span><span><span>Constructs phylogenies of multi-domain proteins. With a given species tree and domain phylogenies, the procedure infers the composition of ancestral multi-domain proteins. Cocos implements and extend a suggested algorithmic approach by Behzadi and Vingron in an easy-to-use program. Such method could be applied to reconstruction of partial homologous units such as bacterial operons or protein complexes.</span></span></span></span></span></span></span></p><p><a href="https://github.com/msrosenberg/MySSP" target="_blank" title="To MySSP official website"><span>MySSP</span></a></p><p><span><span><span><span><span><span><span><span>Constructs an initial DNA sequence at the root of the tree and simulates evolution across the tree using a variety of common models of DNA evolution. MySSP is a program for the simulation of DNA sequence evolution across a phylogenetic tree. It is designed for large-scale studies, including simulation of multiple replicates and outputs sequences into NEXUS, MEGA, or FASTA formats. MySSP has a fairly simple graphical user interface (GUI) for basic use, but also has a specialized batch script interpreter to allow for more complicated or large-scale simulations.</span></span></span></span></span></span></span></span></p><p><span><span><a href="http://www.cs.cmu.edu/~ckingsf/software/parana/" target="_blank" title="To PARANA official website">PARANA</a>:&nbsp;</span><a href="http://www.cs.cmu.edu/~ckingsf/software/parana/" target="_blank" title="To PARANA official website">Parsimonious Ancestral Reconstruction And Network Analysis</a></span></p><p><span><span><span><span><span><span><span><span><span>Performs parsimony based inference of ancestral biological networks. Given multiple extant networks and phylogenetic information relating extant nodes, PARANA finds a parsimonious set of ancestral interaction events (edge gains and losses) which explain the extant networks. The framework adopted by PARANA is able to represent network evolution under models that support gene duplication and loss and independent interaction gain and loss. The method works on both directed and undirected networks and can incorporate asymmetric interaction gain and loss costs. In contrast to previous approaches, PARANA does not require knowing the relative ordering of unrelated duplication events and thus, works on phylogenetic trees even where branch lengths are not provided.</span></span></span></span></span></span></span></span></span></p><p><span><span><a href="http://www-labs.iro.umontreal.ca/~mabrouk/" target="_blank" title="To GapAdj official website">GapAdj</a>:&nbsp;</span><a href="http://www-labs.iro.umontreal.ca/~mabrouk/" target="_blank" title="To GapAdj official website">Gapped Adjacencies</a></span></p><p><span><span><span><span><span><span><span><span><span><span>A synteny-based method that is flexible enough to handle a model of evolution involving whole genome duplication events, in addition to rearrangements, gene insertions, and losses. Ancestral relationships between markers are defined in term of Gapped Adjacencies, i.e. pairs of markers separated by up to a given number of markers. It improves on a previous restricted to direct adjacencies, which revealed a high accuracy for adjacency prediction, but with the drawback of being overly conservative, i.e. of generating a large number of contiguous ancestral regions (CARs).</span></span></span></span></span></span></span></span></span></span></p><p><a href="http://ancestors.bioinfo.uqam.ca/"><span><span><span><span><span><span><span><span><span><span>ANCESTOR</span></span></span></span></span></span></span></span></span></span></a></p><p><span><span><span><span><span><span><span><span><span><span><span>A web server allowing one to easily and quickly perform the last three steps of the ancestral genome reconstruction procedure. Ancestors implements several alignment algorithms, an indel maximum likelihood solver and a context-dependent maximum likelihood substitution inference algorithm. The results presented by the server include the posterior probabilities for the last two steps of the ancestral genome reconstruction and the expected error rate of each ancestral base prediction.</span></span></span></span></span></span></span></span></span></span></span></p><p><a href="http://bioinfo.lifl.fr/procars/" target="_blank" title="To ProCARs official website"><span>ProCARs</span></a></p><p>Reconstructs ancestral gene orders as contiguous ancestral regions (CARs) with a progressive homology-based method. ProCARs runs from a phylogeny tree (without branch lengths needed) with a marked ancestor and a block file. This homology-based method is based on iteratively detecting and assembling ancestral adjacencies, while allowing some micro-rearrangements of synteny blocks at the extremities of the progressively assembled CARs. The method starts with a set of blocks as the initial set of CARs, and detects iteratively the potential ancestral adjacencies between extremities of CARs, while building up the CARs progressively by adding, at each step, new non-conflicting adjacencies that induce the less homoplasy phenomenon. The species tree is used, in some additional internal steps, to compute a score for the remaining conflicting adjacencies, and to detect other reliable adjacencies, in order to reach completely assembled ancestral genomes.</p><p><a href="http://fastml.tau.ac.il/" target="_blank" title="To FastML official website"><span>FastML</span></a></p><p>A user-friendly tool for the reconstruction of ancestral sequences. FastML implements various novel features that differentiate it from existing tools: (i) FastML uses an indel-coding method, in which each gap, possibly spanning multiples sites, is coded as binary data. FastML then reconstructs ancestral indel states assuming a continuous time Markov process. FastML provides the most likely ancestral sequences, integrating both indels and characters; (ii) FastML accounts for uncertainty in ancestral states: it provides not only the posterior probabilities for each character and indel at each sequence position, but also a sample of ancestral sequences from this posterior distribution, and a list of the k-most likely ancestral sequences; (iii) FastML implements a large array of evolutionary models, which makes it generic and applicable for nucleotide, protein and codon sequences; and (iv) a graphical representation of the results is provided, including, for example, a graphical logo of the inferred ancestral sequences.</p><p><a href="http://rth.dk/resources/maxAlike/" target="_blank" title="To maxAlike official website"><span>maxAlike</span></a></p><p>Reconstructs a genomic sequence for a specific taxon based on sequence homologs in other species. The input is a multiple sequence alignment and a phylogenetic tree that also contains the target species. For this target species, the algorithm computes nucleotide probabilities at each sequence position. Consensus sequences are then reconstructed based on a certain confidence level.</p><p><span><span><a href="http://www.geneorder.org/server.php" target="_blank" title="To MLGO official website">MLGO</a>:&nbsp;</span><a href="http://www.geneorder.org/server.php" target="_blank" title="To MLGO official website">Maximum Likelihood for Gene Order Analysis</a></span></p><p>A web tool for the reconstruction of phylogeny and/or ancestral genomes from gene-order data. MLGO was designed for analysis of large-scale genomic changes including not only rearrangements but also gene insertions, deletions and duplications. MLGO can be used to infer a phylogeny from genome rearrangement and gene order data, and can also obtain an estimation of ancestral genomes, given an input tree. MLGO takes the advantage of binary encoding on gene-order data, supports a fairly general model of genomic evolution (rearrangements plus duplications, insertions, and losses of genomic regions), and successfully accommodates itself into the framework of maximized likelihood.</p><p>Image Reference : Wiki</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/38383/sidow-lab</guid>
  <pubDate>Fri, 07 Dec 2018 09:06:30 -0600</pubDate>
  <link></link>
  <title><![CDATA[Sidow Lab]]></title>
  <description><![CDATA[
<p>We study mechanisms of cancer evolution by using state-of-the-art genomic approaches at the bench and in analysis. Accurate genome reconstruction is our other major area of interest. We also collaborate on important questions for which our expertise in genomics and computation is relevant. Arend's biosketch highlights some of our past contributions.</p>

<p>http://www.sidowlab.org/</p>
]]></description>
</item>

</channel>
</rss>