<?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/31714?offset=410</link>
	<atom:link href="https://bioinformaticsonline.com/related/31714?offset=410" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/43084/frequently-used-bioinformatics-tools-for-viral-genome-analysis</guid>
	<pubDate>Wed, 23 Jun 2021 07:40:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/43084/frequently-used-bioinformatics-tools-for-viral-genome-analysis</link>
	<title><![CDATA[Frequently used bioinformatics tools for viral genome analysis !]]></title>
	<description><![CDATA[<p><strong>IVA: accurate de novo assembly of RNA virus genomes.</strong><br /> Hunt M, Gall A, Ong SH, Brener J, Ferns B, Goulder P, Nastouli E, Keane JA, Kellam P, Otto TD.<br /> Bioinformatics. 2015 Jul 15;31(14):2374-6. doi: <a href="http://bioinformatics.oxfordjournals.org/content/31/14/2374.long">10.1093/bioinformatics/btv120</a>. Epub 2015 Feb 28.</p><p><a href="http://www.nature.com/nmeth/journal/v9/n1/full/nmeth.1814.html"><strong>Adapter sequences</strong></a>:<br /> <strong>Optimal enzymes for amplifying sequencing libraries.</strong><br /> Quail, M. a et al. Nat. Methods 9, 10-1 (2012).</p><p><a href="http://genome.cshlp.org/content/early/2012/01/12/gr.131383.111"><strong>GAGE</strong></a>:<br /> <strong>GAGE: A critical evaluation of genome assemblies and assembly algorithms.</strong><br /> Salzberg, S. L. et al. Genome Res. 22, 557-67 (2012).</p><p><a href="http://www.biomedcentral.com/1471-2105/14/160"><strong>KMC</strong></a>:<br /> <strong>Disk-based k-mer counting on a PC.</strong><br /> Deorowicz, S., Debudaj-Grabysz, A. &amp; Grabowski, S. BMC Bioinformatics 14, 160 (2013).</p><p><a href="http://genomebiology.com/2014/15/3/R46"><strong>Kraken</strong></a>:<br /> <strong>Kraken: ultrafast metagenomic sequence classification using exact alignments.</strong><br /> Wood, D. E. &amp; Salzberg, S. L. Genome Biol. 15, R46 (2014).</p><p><a href="http://genomebiology.com/2004/5/2/r12"><strong>MUMmer</strong></a>:<br /> <strong>Versatile and open software for comparing large genomes.</strong><br /> Kurtz, S. et al. Genome Biol. 5, R12 (2004).</p><p><strong>R</strong>:<br /> <strong>R: A language and environment for statistical computing.</strong><br /> R Core Team (2013). R Foundation for Statistical Computing, Vienna, Austria. URL <a href="http://www.R-project.org/">http://www.R-project.org/</a>.</p><p><a href="http://nar.oxfordjournals.org/content/39/9/e57"><strong>RATT</strong></a>:<br /> <strong>RATT: Rapid Annotation Transfer Tool.</strong><br /> Otto, T. D., Dillon, G. P., Degrave, W. S. &amp; Berriman, M. Nucleic Acids Res. 39, e57 (2011).</p><p><a href="http://bioinformatics.oxfordjournals.org/content/25/16/2078.abstract"><strong>SAMtools</strong></a>:<br /> <strong>The Sequence Alignment/Map format and SAMtools.</strong><br /> Li, H. et al. Bioinformatics 25, 2078-9 (2009).</p><p><a href="http://bioinformatics.oxfordjournals.org/content/early/2014/04/12/bioinformatics.btu170"><strong>Trimmomatic</strong></a>:<br /> <strong>Trimmomatic: A flexible trimmer for Illumina Sequence Data.</strong><br /> Bolger, A. M., Lohse, M. &amp; Usadel, B. Bioinformatics 1-7 (2014).</p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/10415/bioinformatician-stuck-in-wet-lab</guid>
	<pubDate>Tue, 06 May 2014 12:46:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/10415/bioinformatician-stuck-in-wet-lab</link>
	<title><![CDATA[Bioinformatician stuck in wet-lab]]></title>
	<description><![CDATA[<p>This guide is aimed at pet bioinformaticians, and is meant to guide them towards better career development.</p>
<p><strong>1. Make friends with local bioinformatics groups</strong><br> <strong>2. Talk to your computing group</strong><br> <strong>3. Obtain clear expectations</strong><br> <strong>4. Rewrite your job description</strong><br> <strong>5. Papers</strong><br> <strong>6. Attend bioinformatics meetings</strong><br> <strong>7. Try first, ask later</strong></p><p>Address of the bookmark: <a href="http://biomickwatson.wordpress.com/2013/04/23/a-guide-for-the-lonely-bioinformatician/" rel="nofollow">http://biomickwatson.wordpress.com/2013/04/23/a-guide-for-the-lonely-bioinformatician/</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/43329/postdoc-position-at-kiel-university-germany</guid>
  <pubDate>Sat, 28 Aug 2021 01:16:55 -0500</pubDate>
  <link></link>
  <title><![CDATA[Postdoc position at Kiel University, Germany]]></title>
  <description><![CDATA[
<p>In the Genomic Microbiology Group of Prof. Tal Dagan at the Institute<br />of Microbiology at Kiel University, Germany, a</p>

<p>Postdoc position (m/w/d)</p>

<p>in the field of computational evolutionary microbiology is available<br />for an initially limited period of 36 months at the earliest possible<br />date. The weekly working time corresponds to 100% of full employment<br />(If the legal requirements under collective bargaining law are met, the<br />tariff grouping is carried out up to pay scale 13 TV-L. The obligation<br />to teach amounts to 4 hours.</p>

<p>The Genomic Microbiology Group research interests are focused on<br />microbial genome evolution with an emphasis on the study of lateral gene<br />transfer. In our research we use both computational and experimental<br />approaches (see www.uni-kiel.de/genomik). The position offers the<br />opportunity to develop an independent research profile within the group<br />research focus. The successful applicant is expected to be involved<br />in teaching of bioinformatics and molecular evolution, including the<br />development of teaching materials (lectures/exercises/short videos).</p>

<p>Your profile:<br />· Doctoral or PhD degree in Molecular Evolution, Bioinformatics or<br />related fields.<br />· Knowledge and experience in programming (e.g., Python) and<br />biostatistical analysis (e.g., with R or MatLab).<br />· Any of the following expertise is an advantage: the analysis of<br />genomic or transcriptomic data, phylogenetic reconstruction,<br />comparative genomics.<br />· Good oral and written communication skills in English.<br />· Ability to teach in German is an advantage (alternatively, an<br />indication to do so from the 2nd year on).<br />· Skills and motivation to communicate and interact with other<br />scientists.<br /> <br />The Christian-Albrechts-University sees itself as a modern and<br />cosmopolitan employer. We welcome your application regardless of your age,<br />gender, cultural and social background, religion, ideology, disability<br />or sexual identity. We promote equality of the sexes.</p>

<p>The Christian-Albrechts-University is committed to the employment of<br />people with disabilities. Preference will be given to applications from<br />severely handicapped persons and persons of equal standing, provided<br />they are suitable.</p>

<p>We expressly welcome applications from people with a migration background.</p>

<p>For enquiries regarding the position, teaching obligations and research<br />topic please contact Prof. Tal Dagan: tdagan@ifam.uni-kiel.de.</p>

<p>Applications should be submitted by email to Mrs. Haacks<br />(dhaacks@ifam.uni-kiel.de) as a single PDF and include: (1) a letter of<br />motivation (max 1 page, Arial 11, line spacing 1.15), (2) CV, (3) PhD<br />certificate. Please use 'GMG postdoc application - [your name]'<br />as a subject.</p>

<p>Please, refrain from sending us application photos.</p>

<p>Application deadline:  August 31 2021 or until the position is<br />filled. Interviews will take place during September/October 2021. The<br />planned starting date for the position is flexible (but in 2021).</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44472/pipesnake-bioinformatics-best-practice-analysis-pipeline-for-phylogenomic-reconstruction</guid>
	<pubDate>Wed, 21 Feb 2024 06:19:41 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44472/pipesnake-bioinformatics-best-practice-analysis-pipeline-for-phylogenomic-reconstruction</link>
	<title><![CDATA[pipesnake: bioinformatics best-practice analysis pipeline for phylogenomic reconstruction]]></title>
	<description><![CDATA[<p dir="auto"><span>ausarg/pipesnake</span>&nbsp;is a bioinformatics best-practice analysis pipeline for phylogenomic reconstruction starting from short-read 'second-generation' sequencing data.</p>
<p dir="auto">The pipeline is built using&nbsp;<a href="https://www.nextflow.io/">Nextflow</a>, a workflow tool to run tasks across multiple compute infrastructures in a very portable manner. It uses Docker/Singularity containers making installation trivial and results highly reproducible. The&nbsp;<a href="https://www.nextflow.io/docs/latest/dsl2.html">Nextflow DSL2</a>&nbsp;implementation of this pipeline uses one container per process which makes it much easier to maintain and update software dependencies.</p><p>Address of the bookmark: <a href="https://github.com/AusARG/pipesnake" rel="nofollow">https://github.com/AusARG/pipesnake</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/10739/science-for-life-laboratory-scilifelab-sweden</guid>
  <pubDate>Sat, 10 May 2014 06:22:30 -0500</pubDate>
  <link></link>
  <title><![CDATA[Science for Life Laboratory (SciLifeLab)-Sweden]]></title>
  <description><![CDATA[
<p>Science for Life Laboratory (SciLifeLab) is a national center for molecular biosciences with focus on health and environmental research. The center combines frontline technical expertise with advanced knowledge of translational medicine and molecular bioscience. SciLifeLab is a national resource and a collaboration between four universities: Karolinska Institutet, KTH Royal Institute of Technology, Stockholm University and Uppsala University.</p>

<p>Webpage : https://www.scilifelab.se/about-us/<br />Opportunity: https://www.scilifelab.se/about-us/career/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44930/bioinformatics-the-bridge-between-curiosity-and-discovery</guid>
	<pubDate>Mon, 24 Nov 2025 05:16:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44930/bioinformatics-the-bridge-between-curiosity-and-discovery</link>
	<title><![CDATA[Bioinformatics: The Bridge Between Curiosity and Discovery]]></title>
	<description><![CDATA[<p>In the sprawling universe of modern science, bioinformatics stands as one of the most transformative and empowering fields of our time. It is where biology meets computation, where data becomes meaning, and where curiosity becomes discovery. If you&rsquo;ve stepped into this world&mdash;or are considering it&mdash;here&rsquo;s your reminder: you&rsquo;re part of a revolution.</p><p><strong>Why Bioinformatics Matters More Than Ever</strong></p><p>Every day, our world generates massive amounts of biological data&mdash;from genome sequences to microbiome profiles to real-time pathogen surveillance. Hidden within these datasets are the answers to some of the greatest challenges humanity faces: emerging diseases, antimicrobial resistance, environmental stress, genetic disorders, sustainable agriculture, and more.</p><p>Bioinformatics isn&rsquo;t just a skill.<br />It&rsquo;s the language of the future of biology.</p><p>By mastering it, you give yourself the power to:</p><p>Decode genomes and understand life at its most fundamental level</p><p>Identify patterns no microscope could ever reveal</p><p>Predict disease outbreaks before they occur</p><p>Accelerate drug discovery with computational precision</p><p>Contribute to open-source tools that empower scientists worldwide</p><p>You don&rsquo;t just follow science&mdash;you drive it.</p><p><strong>Every Expert Was Once a Beginner</strong></p><p>Many newcomers feel intimidated. Command-line interfaces. R scripts. Python packages. Next-generation sequencing data. Complex machine learning models.</p><p>But here&rsquo;s the truth: every bioinformatician started exactly where you are now&mdash;curious, unsure, but excited.</p><p>No one writes perfect code on day one.</p><p>No one understands genomics pipelines immediately.</p><p>What makes you a bioinformatician is not perfection, but perseverance.</p><p>When your script throws a cryptic error&hellip;<br />When your data refuses to format&hellip;<br />When your pipeline runs for 6 hours only to crash&hellip;</p><p>Remember: this is part of the journey.<br />Every error teaches you. Every retry strengthens you. Every breakthrough energizes you.</p><p>Bioinformatics Is Not Just a Career&mdash;It&rsquo;s a Mindset</p><p>It&rsquo;s the mindset of:</p><p>Problem-solving.</p><p>Continuous learning.</p><p>Turning chaos into clarity.</p><p>Seeing what others can&rsquo;t.</p><p>Bioinformaticians are detectives of biological complexity. You sit at the intersection of innovation, using tools that can shape public health, medicine, agriculture, and ecology. Few fields give you such direct impact on the world.</p><p><strong>Your Contribution Matters</strong></p><p>As you work on your script, pipeline, genome, or model, remember:</p><p>Somewhere, your analysis might contribute to:</p><p>A new therapy</p><p>A faster diagnostic test</p><p>A better understanding of a pathogen</p><p>A more resilient crop</p><p>An open-source dataset that helps thousands</p><p>A discovery that rewrites textbooks</p><p>Your code may be small, but its ripple effect is powerful.</p><p>The Future Is Bioinformatics&mdash;And You Are Part of It</p><p>The world is shifting. Wet labs are integrating AI. Hospitals rely on genomic insights. Farmers use gene-level predictions. Governments monitor disease in real time. Students launch pipelines that become global tools.</p><p>This is a golden era&mdash;and you are not late.<br />You are exactly where you need to be.</p><p>Keep Pushing. Keep Learning. Keep Discovering.</p><p>Bioinformatics is a journey filled with challenges, but also with unmatched rewards.</p><p>So the next time you feel stuck, frustrated, or overwhelmed, remember:<br />You&rsquo;re building the science of tomorrow.</p><p>Be proud. Stay curious. Keep going.<br />Your work matters more than you think.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40703/%CF%80-cyc-a-reference-free-snp-discovery-application-using-parallel-graph-search</guid>
	<pubDate>Tue, 28 Jan 2020 03:34:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40703/%CF%80-cyc-a-reference-free-snp-discovery-application-using-parallel-graph-search</link>
	<title><![CDATA[Π-cyc: A Reference-free SNP Discovery Application using Parallel Graph Search]]></title>
	<description><![CDATA[<p>Reference free SNP search for comparative population genomics: multiple samples run simultanously. **experimental phase, compiles and runs with OpenMPI-1.8.8 with Intel Compiler only</p>
<p><span>Cycles enumeration (aka Bubbles) as part of de novo de bruijn graphs assembly using colours can be unpractical for large error prone genomes which makes the assembly process produce an excessive number of false positive cycles.&nbsp; Our solution is to search the graph in multicores shared memory parallel mode using graph decomposition then use filtering method to generate good quality SNPs.</span></p>
<p><a href="https://arxiv.org/abs/1809.06700">https://arxiv.org/abs/1809.06700</a></p>
<p><a href="https://github.com/redayounsi/2KP2P">https://github.com/redayounsi/2KP2P</a></p>
<blockquote>
<p>/2kp2omp/bin/main_2kp2_K63_C2 -i fastq_files.txt -o fungus_bub.fasta -r stat_fungus.txt -c cov_fungus_hash.txt -k 63 -h 20 -b 100 -g 600 -l 100 -f 16 -t 5.0 -x 1 -v 0 -p 1 -y 1 -u 1</p>
<p>&nbsp;</p>
</blockquote><p>Address of the bookmark: <a href="https://github.com/redayounsi/2KP2P" rel="nofollow">https://github.com/redayounsi/2KP2P</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/11000/professorassociate-professor-assistant-professor-at-chettinad-academy-of-research-and-education</guid>
  <pubDate>Sat, 24 May 2014 00:00:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Professor/Associate Professor/ Assistant Professor at Chettinad Academy of Research and Education]]></title>
  <description><![CDATA[
<p>OPEN FACULTY POSITION</p>

<p>Chettinad Academy of Research and Education (CARE) invites applications from eligible and translational research-oriented candidates to the posts of Professor/Associate Professor/ Assistant Professor  Computational Biology, Bioinformatics, and Pharmaceutical Chemistry.</p>

<p>Emoluments: As per UGC norms (Adequate Compensation for Postdoctoral/Teaching experience)</p>

<p>Candidates fulfilling the eligibility criteria as per the UGC norms can send their full CV with copies of certificates and reference letters to the following address by post or by e-mail on or before 31st May 2014</p>

<p>The Registrar,<br />Chettinad Academy of Research and Education,<br />Chettinad Health City<br />Kelambakkam, Chennai 603 103<br />Tamil Nadu<br />T +91 (0)44 4741 1000<br />F +91 (0)44 4741 1011<br />Email: jobs @chettinadhealthcity.com</p>

<p>Advertisement: http://182.73.176.163/chc/ads2014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/34707/string-graph-based-genome-assembly-software-and-tools</guid>
	<pubDate>Tue, 19 Dec 2017 17:17:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/34707/string-graph-based-genome-assembly-software-and-tools</link>
	<title><![CDATA[String graph based genome assembly software and tools !]]></title>
	<description><![CDATA[<p>In&nbsp;<a href="https://en.wikipedia.org/wiki/Graph_theory" title="Graph theory">graph theory</a>, a&nbsp;<strong>string graph</strong>&nbsp;is an&nbsp;<a href="https://en.wikipedia.org/wiki/Intersection_graph" title="Intersection graph">intersection graph</a>&nbsp;of&nbsp;<a href="https://en.wikipedia.org/wiki/Curve" title="Curve">curves</a>&nbsp;in the plane; each curve is called a "string".&nbsp; String graphs were first proposed by E. W. Myers in a&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/21/suppl_2/ii79.full.pdf+html">2005 publication</a>.&nbsp;In&nbsp;recent&nbsp;<a href="http://genome.cshlp.org/content/early/2012/01/22/gr.126953.111">Genome Research paper</a>&nbsp;describing an innovative approach for assembling large genomes from NGS data caught our attention for several reasons. i) it give different "string graph" prospective of long lasting genome assembly problem ii) the&nbsp;paper is coauthored by Jared Simpson, the developer of&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2694472/">ABySS assembler</a>&nbsp;and Richard Durbin. iii)&nbsp;Simpson-Durbin algorithm is that it does not rely on de Bruijn graphs, and instead employs a different graph construction approach called &lsquo;string graph&rsquo;.</p><p>Following are the genome assembly tools based on string graph:</p><p>1.SGA (String Graph Assembler)&nbsp;https://github.com/jts/sga</p><p>Assembles large genomes from high coverage short read data. SGA is designed as a modular set of programs, which are used to form an assembly pipeline. SGA implements a set of assembly algorithms based on the FM-index. As the FM-index is a compressed data structure, the algorithms are very memory efficient. The SGA assembly has three distinct phases. The first phase corrects base calling errors in the reads. The second phase assembles contigs from the corrected reads. The third phase uses paired end and/or mate pair data to build scaffolds from the contigs. The output of this software is a PDF report that allows the properties of the genome and data quality to be visually explored. By providing more information to the user at the start of an assembly project, this software will help increase awareness of the factors that make a given assembly easy or difficult, assist in the selection of software and parameters and help to troubleshoot an assembly if it runs into problems.</p><p>2.&nbsp;SAGE: String-overlap Assembly of GEnomes&nbsp;https://github.com/lucian-ilie/SAGE2</p><p>SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers.</p><p>3. FSG: Fast String Graph</p><p>The new integrated assembler has been assessed on a standard benchmark, showing that fast string graph (FSG) is significantly faster than SGA while maintaining a moderate use of main memory, and showing practical advantages in running FSG on multiple threads. Moreover, we have studied the effect of coverage rates on the running times.</p><p>4.&nbsp;&nbsp;BASE&nbsp;https://github.com/dhlbh/BASE</p><p>It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.&nbsp;BASE is a practically efficient tool for constructing contig, with significant improvement in quality for long NGS reads. It is relatively easy to extend BASE to include scaffolding.</p><p>5.&nbsp;Fermi&nbsp;https://github.com/lh3/fermi/</p><p>Fermi is a de novo assembler with a particular focus on assembling Illumina&nbsp;short sequence reads from a mammal-sized genome. In addition to the role of a&nbsp;typical assembler, fermi also aims to preserve heterozygotes which are often&nbsp;collapsed by other assemblers. Its ultimate goal is to find a minimal set of&nbsp;unitigs to represent all the information in raw reads.</p><p>If you want to learn about String Graph assembler, please read the following papers -</p><p>i)&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/21/suppl_2/ii79.full.pdf+html">The Fragment Assembly String Graph - E. W. Myers</a></p><p>This paper describes the String Graph concept.</p><p>ii)&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/26/12/i367.full#ref-20">Efficient construction of an assembly string graph using the FM-index - Jared T. Simpson and Richard Durbin</a></p><p>This earlier paper from Simpson and Durbin</p><p>iii)&nbsp;<a href="http://genome.cshlp.org/content/early/2012/01/22/gr.126953.111">Efficient de novo assembly of large genomes using compressed data structures - Jared T. Simpson and Richard Durbin</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/11107/the-minerva-research-group-for-bioinformatics</guid>
  <pubDate>Tue, 27 May 2014 15:48:14 -0500</pubDate>
  <link></link>
  <title><![CDATA[The Minerva Research Group for Bioinformatics]]></title>
  <description><![CDATA[
<p>The focus of the bioinformatics group is to use computational approaches to gain an insight into genome evolution in primates.</p>

<p>http://www.eva.mpg.de/genetics/bioinformatics/overview.html?Fsize=0%2C%20%40%2F%27</p>

<p>Kelso Group<br />Department of Evolutionary Genetics<br />Max Planck Institute for Evolutionary Anthropology<br />Deutscher Platz 6<br />04103 Leipzig<br />Germany<br />Phone: +49 341 3550 500</p>

<p>Job: <br />http://www.eva.mpg.de/genetics/bioinformatics/jobs.html?Fsize=0%2C%2B%40</p>
]]></description>
</item>

</channel>
</rss>