<?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/28997?offset=1300</link>
	<atom:link href="https://bioinformaticsonline.com/related/28997?offset=1300" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/4574/tools-to-detect-synteny-blocks-regions-among-multiple-genomes</guid>
	<pubDate>Mon, 16 Sep 2013 17:12:02 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/4574/tools-to-detect-synteny-blocks-regions-among-multiple-genomes</link>
	<title><![CDATA[Tools to detect synteny blocks regions among multiple genomes]]></title>
	<description><![CDATA[<p>The synteny block (which etymologically means &ldquo;on the same ribbon&rdquo;) is a collection of contiguous genes located on the same chromosome. These block regions have mostly been preserved by genome rearrangements, and so synteny blocks from two related species (e.g., humans and mice) will be roughly similar but flipped around on the respective genomes. Ovcharenko et. al. define it as &lsquo;any conserved sequence blocks, regardless of whether it encompasses multiple genes, an area containing single genes, or areas devoid of known genes to be considers as synteny block as long as there is conservation at the sequence level. Today, however, biologists usually refer to synteny as the conservation of blocks of order within two sets of chromosomes that are being compared with each other. This concept can also be referred to as shared synteny. The NHBLI/NCBI Glossary define synteny as &ldquo;Two genes which occur on the same chromosome are syntenic; however, syntenic genes may or may not be "linked."</p><p>Now a day, geneticists have developed a language of their own. They are pouring lots of money and energy to read the entire genomic text and understand the gods own code ATGC. It is somewhat fascinating, not only for geneticist but also for non-biologist to know that there are several conserved blocks in genome which remain conserved over hundreds of millions of years. There have been several researches on conserved blocks and non-conserved regions to understand the mechanism and importance of all these regions (http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2675965/). The finding indicates conservation and rearrangements of certain evolutionary important genes play an important role in evolution/adaptive changes (http://www.nature.com/nature/journal/v491/n7424/abs/nature11622.html https://academic.oup.com/gbe/article/8/8/2442/2198198/Novel-Insights-into-Chromosome-Evolution-in-Birds , http://science.sciencemag.org/content/346/6215/1311).</p><p>But the puzzle remains open, how to correctly define the synteny (presence of two or more genes on the same chromosome) and conserved synteny (presence of two or more genes on chromosome of each of the two species) on several genomes.</p><p><img src="http://bioinformaticsonline.com/mod/photo/syntenyImg.jpg" alt="image" width="720" height="179" style="border: 0px; border: 0px;"></p><p>Figure: Image generated with Evolution Highway (EH) tool http://eh-demo.ncsa.illinois.edu/&nbsp;</p><p>Keeping the new approach to define conserved synteny in mind there have been various algorithms developed to identify the conserved homologous synteny blocks (HSB) amongst species. Some of them which were commonly used for synteny detections are:</p><p>SyntenyTracker ( http://www-app.igb.uiuc.edu/labs/lewin/donthu/Synteny_assign/html/),</p><p>SyntenyTracker was shown to be an efficient and accurate automated tool for defining HSBs using datasets that may contain minor errors resulting from limitations in map construction methodologies.</p><p>CoGe (http://genomevolution.org/CoGe/SynFind.pl )</p><p>Satsuma (http://evomics.org/learning/genomics/satsuma/)</p><p>Cinteny (http://cinteny.cchmc.org/) ,</p><p>Cinteny server can be used for finding regions syntenic across multiple genomes and measuring the extent of genome rearrangement using reversal distance as a measure.</p><p>OrthoCluster (http://krono.act.uji.es/noticias/orthocluster-a-new-tool-for-mining-syntenic-blocks)</p><p>A new tool for mining syntenic blocks in comparative genomics</p><p>SynMap (http://genomevolution.org/wiki/index.php/SynMap),</p><p>SyMAP (http://www.symapdb.org/)</p><p>SyMAP (Synteny Mapping and Analysis Program) v4.0 is an automated system for identifying and displaying genome synteny alignments. The genomes may be represented by sequenced chromosomes (pseudomolecules), by draft sequence contigs, or by FPC physical maps (with BAC-end or marker sequence).</p><p>http://genomevolution.org/CoGe/SynMap.pl</p><p>RegionMiner (http://www.genomatix.de/online_help/help_regionminer/orthologous.html)</p><p>SyntenyMiner is being developed as an application to visualize and interrogate comparisons among multiple complete genome sequences. http://syntenyminer.sourceforge.net/</p><p>AutoGRAPH ( http://autograph.genouest.org/),</p><p>AutoGRAPH is an integrated web server for multi-species comparative genomic analysis. It is designed for constructing and visualizing synteny maps between two or three species, determination and display of macrosynteny and microsynteny relationships among species, and for highlighting evolutionary breakpoints.</p><p>SynChro(http://www.lgm.upmc.fr/CHROnicle/SynChro.html)</p><p>SynChro is a tool designed to define conserved synteny blocks. It reconstructs synteny blocks between pairwise comparison of multiple genomes. The reconstructed synteny blocks may overlap each other, be included in one another or duplicated due to micro-rearrangements.</p><p>SyntenyView ( http://www.cbs.dtu.dk/dtucourse/cookbooks/nikob/exercises/gf1_output_5.html),</p><p>Ensembl 'SyntenyView' shows conservation of large-scale gene order between species pairs. A brief summary of the calculation method appears at the bottom of this help page.&nbsp; The left of a 'SyntenyView' page displays a diagram of chromosomes with blocks of conserved synteny. The right of a page shows homology matches between individual genes within syntenic blocks.</p><p>SynBrowse ( http://www.synbrowse.org/),</p><p>SynBrowse (Synteny Browser) is a generic sequence comparison tool for visualizing genome alignments both within and between species. It is intended to help scientists study and analyze synteny, homologous genes and other conserved elements between sequences. This software is useful in studying genome duplication and evolution. It can also aid in identifying uncharacterized genes, putative regulatory elements and novel structural features of study species by comparing to a well annotated reference sequence, thus enabling genome curators to refine and edit annotations of species that have incomplete genome annotations.</p><p>Sibelia (http://arxiv.org/abs/1307.7941).</p><p>A comparative genomic tool: It assists biologists in analysing the genomic variations that correlate with pathogens, or the genomic changes that help microorganisms adapt in different environments. Sibelia will also be helpful for the evolutionary and genome rearrangement studies for multiple strains of microorganisms.</p><p>GSV (http://cas-bioinfo.cas.unt.edu/gsv/homepage.php)</p><p>Genome Synteny Viewer allows users to upload files which contain synteny regions between two or more genomes and interactively visualize the synteny between them. GSV also allows users to upload annotation files to visualize annotated regions in addition to synteny regions.</p><p>MicroSyn (http://www.lgm.upmc.fr/CHROnicle/SynChro.html)</p><p>MicroSyn software as a means of detecting microsynteny in adjacent genomic regions surrounding genes in gene families. MicroSyn searches for conserved, flanking colinear homologous gene pairs between two genomic fragments to determine the relationship between two members in a gene family.</p><p>SynOrth (http://synorth.genereg.net/)</p><p>Synorth [s n &ocirc;rth], named in combination of "synteny" and "ortholog", is designed for the study of evolutionary changes of genomic regulatory blocks (GRBs) in vertebrate genomes, and especially the changes following the whole-genome duplication in teleost fish, by tracing the ortholog genes gain and loss in ancient synteny blocks.</p><p>SyDiG (http://www.ncbi.nlm.nih.gov/pubmed/21441096)</p><p>Uncovering Synteny in Distant Genomes.</p><p>MapSynteny&nbsp; (http://www.automatizacionysistemas.com/download.html)</p><p>MapSynteny is a macro in MS Excel&reg; able to create images to show the relationship between genetic maps and large sequences (scaffolds, chromosomes, BACs, etc.). Based on tab &ndash; delimited BLAST results and some formulas, a suitable image of syntenic relationships or physical mapping can be obtained. http://www.automatizacionysistemas.com/Poster_MapSynteny.pdf</p><p>One of the best synteny tutorial for beginer @&nbsp;http://www.nature.com/scitable/topicpage/synteny-inferring-ancestral-genomes-44022</p><p>Reference:</p><p><a href="http://www.nature.com/scitable/topicpage/synteny-inferring-ancestral-genomes-44022">http://www.nature.com/scitable/topicpage/synteny-inferring-ancestral-genomes-44022</a></p><p><a href="http://www.nature.com/nature/journal/v491/n7424/full/nature11622.html">http://www.nature.com/nature/journal/v491/n7424/full/nature11622.html</a></p><p><a href="http://en.wikipedia.org/wiki/Synteny">http://en.wikipedia.org/wiki/Synteny</a></p><p><a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2675965/">http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2675965/</a></p>]]></description>
	<dc:creator>Jitendra Narayan</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/file/view/8650/bioinformatician-duties-and-jobs</guid>
	<pubDate>Wed, 05 Mar 2014 14:32:26 -0600</pubDate>
	<link>https://bioinformaticsonline.com/file/view/8650/bioinformatician-duties-and-jobs</link>
	<title><![CDATA[Bioinformatician duties and jobs !!!]]></title>
	<description><![CDATA[<p><span><em>Needle</em> in a haystack</span> ... ohh yes this is what bioinformatician do. We handle and analyse, Terabytes and Petabytes of genomic data on daily basis.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/8650" length="37079" type="image/gif" />
</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/11582/monitor-running-jobs-on-linux-server</guid>
	<pubDate>Fri, 06 Jun 2014 16:18:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/11582/monitor-running-jobs-on-linux-server</link>
	<title><![CDATA[Monitor running jobs on Linux server]]></title>
	<description><![CDATA[<p>You as a bioinformatican run lots of program on your servers. Sometime the shared server is also used by your colleague. If server is busy you sometime need to check the running programs and want to monitor the running programs as well. The "top" command will come in handy when you need to find out if things are still running, how long they&rsquo;ve been running, or how much memory is being used.<br /><br />&lsquo;top&rsquo; is very simple to run: type<br /><br />%% top<br /><br />You&rsquo;ll get a screen that looks like this, and is updated regularly:<br /><br /><img src="http://bioinformaticsonline.com/mod/photo/top.png" width="659" height="582" alt="image" style="border: 0px;"><br />Simple, right? Heh.<br /><br />First! Note that you can use &lsquo;q&rsquo; or &lsquo;CTRL-C&rsquo; to exit from &lsquo;top&rsquo;.<br /><br />Now let&rsquo;s read and understand at each line independently.<br /><br />The first line:<br /><br />top - 23:00:48 up 39 days,&nbsp; 2 user,&nbsp; load average: 0.00, 0.00, 0.00<br /><br />The first line tells you the current time, how long the machine has been up, how many users are logged in, and the short/medium/long-term compute load on the machine. If you run something for a long time, you&rsquo;ll see these numbers go up. Right now, the machine is basically just sitting there, so these are all close to 0.<br /><br />The second line:</p><p>Tasks:&nbsp; 239 total,&nbsp;&nbsp; 1 running,&nbsp; 238 sleeping,&nbsp;&nbsp; 0 stopped,&nbsp;&nbsp; 0 zombie<br /><br />This line tells you how many processes are running. If you are using laptops machines it&rsquo;s not so interesting because you really are the only one using this machine.<br /><br />Cpu(s):&nbsp; 0.0%us,&nbsp; 0.0%sy,&nbsp; 0.0%ni,100.0%id,&nbsp; 0.0%wa,&nbsp; 0.0%hi,&nbsp; 0.0%si,&nbsp; 0.0%st<br /><br />This line contains the CPU load. The first two numbers are how busy the system is doing computation (&ldquo;us&rdquo; stands for &ldquo;user&rdquo;) and how busy the system is doing system-y things like accessing disks or network (&ldquo;sy&rdquo; stands for &ldquo;system&rdquo;). We&rsquo;ll talk more about this later.<br /><br />Mem:&nbsp;&nbsp; 49457320k total,&nbsp;&nbsp;&nbsp; 3492174k used,&nbsp; 14535596k free,&nbsp;&nbsp;&nbsp; 1435148k buffers<br /><br />This should be easy to understand &ndash; how much memory you&rsquo;re using! <br /><br />Swap:&nbsp;&nbsp; 539356k total,&nbsp;&nbsp; 28332k used,&nbsp;&nbsp; 836562k free,&nbsp;&nbsp;&nbsp; 29862014k cached<br /><br />Swap is just on-disk memory that can be used to &ldquo;swap&rdquo; out programs from main memory. Again, we&rsquo;ll talk about this later.:<br /><br />PID USER&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; PR&nbsp; NI&nbsp; VIRT&nbsp; RES&nbsp; SHR S %CPU %MEM&nbsp;&nbsp;&nbsp; TIME+&nbsp; COMMAND<br />&nbsp; 1 root&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 39 &nbsp; 19&nbsp; 0&nbsp; 0&nbsp; 0 S&nbsp; 0.0&nbsp; 0.0&nbsp;&nbsp; 246:57.22 kipmi0<br />&nbsp; 2 root&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; RT&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp; 0&nbsp;&nbsp;&nbsp; 0 S&nbsp; 0.0&nbsp; 0.0&nbsp;&nbsp; 0:00.00 migration/0<br /><br />And... finally! What&rsquo;s actually running! The two most important numbers are the %CPU and %MEM towards the right, as well as the COMMAND. This tells you how compute- and memory-intensive your program is. Right now, nothing&rsquo;s running so the numbers aren&rsquo;t very interesting, but just wait until we run something...</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34216/meraculous-de-novo-genome-assembly-with-short-paired-end-reads</guid>
	<pubDate>Tue, 07 Nov 2017 04:36:10 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34216/meraculous-de-novo-genome-assembly-with-short-paired-end-reads</link>
	<title><![CDATA[Meraculous: De Novo Genome Assembly with Short Paired-End Reads]]></title>
	<description><![CDATA[<p><span>We describe a new algorithm, meraculous, for whole genome assembly of deep paired-end short reads, and apply it to the assembly of a dataset of paired 75-bp Illumina reads derived from the 15.4 megabase genome of the haploid yeast&nbsp;</span><em>Pichia stipitis</em><span>. More than 95% of the genome is recovered, with no errors; half the assembled sequence is in contigs longer than 101 kilobases and in scaffolds longer than 269 kilobases. Incorporating fosmid ends recovers entire chromosomes. Meraculous relies on an efficient and conservative traversal of the subgraph of the&nbsp;</span><em>k</em><span>-mer (deBruijn) graph of oligonucleotides with unique high quality extensions in the dataset, avoiding an explicit error correction step as used in other short-read assemblers. A novel memory-efficient hashing scheme is introduced. The resulting contigs are ordered and oriented using paired reads separated by &sim;280 bp or &sim;3.2 kbp, and many gaps between contigs can be closed using paired-end placements. Practical issues with the dataset are described, and prospects for assembling larger genomes are discussed.</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3158087/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3158087/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35762/genome-assembly-stats-plotting</guid>
	<pubDate>Wed, 28 Feb 2018 03:45:39 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35762/genome-assembly-stats-plotting</link>
	<title><![CDATA[Genome assembly stats plotting]]></title>
	<description><![CDATA[<p>A&nbsp;<em>de novo</em>&nbsp;genome assembly can be summarised b</p>
<p>y a number of metrics, including:</p>
<ul>
<li>Overall assembly length</li>
<li>Number of scaffolds/contigs</li>
<li>Length of longest scaffold/contig</li>
<li>Scaffold/contig N50 and N90Assembly base composition, in particular percentage GC and percentage Ns</li>
<li>CEGMA completeness</li>
<li>Scaffold/contig length/count distribution</li>
</ul>
<p>assembly-stats supports two widely used presentations of these values, tabular and cumulative length plots, and introduces an additional circular plot that summarises most commonly used assembly metrics in a single visualisation. Each of these presentations is generated using javascript from a common (JSON) data structure, allowing toggling between alternative views, and each can be applied to a single or multiple assemblies to allow direct comparison of alternate assemblies.</p>
<p>Tabular presentation allows direct comparison of exact values between assemblies, the limitations of this approach lie in the necessary omission of distributions and the challenge of interpreting ratios of values that may vary by several orders of magnitude.</p><p>Address of the bookmark: <a href="https://github.com/rjchallis/assembly-stats" rel="nofollow">https://github.com/rjchallis/assembly-stats</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/11441/assistant-professor-in-bioinformatics-at-dr-d-y-patil-biotechnology-bioinformatics-institute</guid>
  <pubDate>Tue, 03 Jun 2014 19:54:15 -0500</pubDate>
  <link></link>
  <title><![CDATA[Assistant Professor 	in Bioinformatics at Dr. D. Y. Patil Biotechnology &amp; Bioinformatics Institute]]></title>
  <description><![CDATA[
<p>Dr. D. Y. Patil Biotechnology &amp; Bioinformatics Institute <br />Tathawade, Pune 411033.</p>

<p>Assistant Professor 	in Bioinformatics </p>

<p>Essential :<br />First Class Master’s Degree in the appropriate branch of Life Sciences / Technology (Tech.)<br />OR<br />Ph.D in Life Sciences or in the respective subject area of specialization<br />OR<br />Good Academic record with at least 55% marks (or an equivalent grade) at the Master’s Degree level, in the relevant subject or an equivalent degree from an Indian / Foreign University.<br />Besides fulfilling the above qualifications, candidates should have cleared the eligibility test (NET) for lecturers conducted by the UGC, CSIR or similar test accredited by the UGC and as per the requirements of UGC guidelines.</p>

<p>Desirable :<br />Teaching, research industrial and/or professional experience in a reputed organization. <br />Papers presented at Conferences and/or in refereed journals</p>

<p>Note : Application are invited in prescribed form Click here for Application Form<br />Kindly send your applications to “Registrar, Dr. D. Y. Patil Vidyapeeth, Pune, Sant Tukaram Nagar, Pimpri, Pune – 411018., Maharashtra, India.” should reach in the University office within 15 days from the publication.</p>

<p>More Info: http://www.dpu.edu.in/BiotechResearchPositions.aspx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36478/the-marvel-assembler</guid>
	<pubDate>Fri, 04 May 2018 19:18:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36478/the-marvel-assembler</link>
	<title><![CDATA[The MARVEL assembler]]></title>
	<description><![CDATA[<p><span>MARVEL consists of a set of tools that facilitate the overlapping, patching, correction and assembly of noisy (not so noisy ones as well) long reads.</span></p>
<p>The assembly process can be summarized as follows:</p>
<ol>
<li>overlap</li>
<li>patch reads</li>
<li>overlap (again)</li>
<li>scrubbing</li>
<li>assembly graph construction and touring</li>
<li>optional read correction</li>
<li>fasta file creation</li>
</ol><p>Address of the bookmark: <a href="https://github.com/schloi/MARVEL" rel="nofollow">https://github.com/schloi/MARVEL</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/11656/faculty-post-at-zhejiang-university</guid>
  <pubDate>Tue, 10 Jun 2014 03:40:40 -0500</pubDate>
  <link></link>
  <title><![CDATA[Faculty post at Zhejiang University]]></title>
  <description><![CDATA[
<p>Zhejiang University (ZJU) is seeking faculty candidates for its newly launched, highly competitive and well funded “Hundred Talents Program”. This search covers all colleges and departments at ZJU. Applicants, expected to be about 35 years old, should hold PhD degree, and postdoctoral experiences are preferred for applicants in most fields. Applicants should have demonstrated commitment to excellence in teaching and research at a level comparable to the academic achievement of assistant professor or associate professor in world-renowned universities. Successful candidates must work full-time and are expected to establish internationally competitive and independent research program in cutting-edge areas of the relevant field at ZJU.</p>

<p>As one of the leading research-intensive universities in China, ZJU is located in the beautiful city of Hangzhou. Successful candidates will be employed as Principal Investigators and are qualified to supervise doctoral students. ZJU will offer an internationally competitive salary and the opportunity to purchase university's apartment at a price much lower than the market price, and will provide office and laboratory spaces as well as internationally competitive research startup packages.</p>

<p>Qualified applicants are strongly encouraged to submit their applications electronically to tr@zju.edu.cn. Applicants should include the following materials in pdf format: a comprehensive CV, a statement of research and teaching plan, and a list of 3 to 5 references with detailed contact information.</p>

<p>Contact：Talents Office, ZJU</p>

<p>Tel：+86-571-88981345, +86-571-88981390</p>

<p>Fax：+86-571-88981976</p>

<p>E-mail:tr@zju.edu.cn</p>
]]></description>
</item>

</channel>
</rss>