<?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/32726?offset=200</link>
	<atom:link href="https://bioinformaticsonline.com/related/32726?offset=200" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34618/mashmap-a-fast-and-approximate-software-for-mapping-long-reads-pacbioont-or-assembly-to-reference-genomes</guid>
	<pubDate>Tue, 12 Dec 2017 17:23:31 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34618/mashmap-a-fast-and-approximate-software-for-mapping-long-reads-pacbioont-or-assembly-to-reference-genomes</link>
	<title><![CDATA[MashMap: a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s)]]></title>
	<description><![CDATA[<p><span>MashMap is a fast and approximate software for mapping long reads (PacBio/ONT) or assembly to reference genome(s). It maps a query sequence against a reference region if and only if its estimated alignment identity is above a specified threshold. It does not compute the alignments explicitly, but rather estimates a&nbsp;</span><em>k</em><span>-mer based&nbsp;</span><a href="https://en.wikipedia.org/wiki/Jaccard_index">Jaccard similarity</a><span>&nbsp;using a combination of&nbsp;</span><a href="http://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/p76-schleimer.pdf">Winnowing</a><span>&nbsp;and&nbsp;</span><a href="https://en.wikipedia.org/wiki/MinHash">MinHash</a><span>. This is then converted to an estimate of sequence identity using the&nbsp;</span><a href="http://mash.readthedocs.org/">Mash</a><span>&nbsp;distance. An appropriate&nbsp;</span><em>k</em><span>-mer sampling rate is automatically determined given minimum local alignment length and identity thresholds. The efficiency of the algorithm improves as both of these thresholds are increased.</span></p><p>Address of the bookmark: <a href="https://github.com/marbl/MashMap" rel="nofollow">https://github.com/marbl/MashMap</a></p>]]></description>
	<dc:creator>Jit</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>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/37514/list-of-non-commercial-ngs-genotype-calling-software</guid>
	<pubDate>Thu, 09 Aug 2018 04:21:32 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/37514/list-of-non-commercial-ngs-genotype-calling-software</link>
	<title><![CDATA[List of non-commercial NGS genotype-calling software]]></title>
	<description><![CDATA[<p><span>Meaningful analysis of next-generation sequencing (NGS) data, which are produced extensively by genetics and genomics studies, relies crucially on the accurate calling of SNPs and genotypes. Recently developed statistical methods both improve and quantify the considerable uncertainty associated with genotype calling, and will especially benefit the growing number of studies using low- to medium-coverage data.&nbsp;</span></p><p><span>A list of programs for genotype and SNP calling :</span></p><p><br />SOAP2&nbsp;http://soap.genomics.org.cn/index.html</p><p>Single-sample High-quality variant database (for example, dbSNP) Package for NGS data analysis, which includes a single individual genotype caller (SOAPsnp)</p><p>realSFS&nbsp;http://128.32.118.212/thorfinn/realSFS/</p><p>Single-sample Aligned reads Software for SNP and genotype calling using single individuals and allele frequencies. Site frequency spectrum (SFS) estimation</p><p>Samtools http://samtools.sourceforge.net/</p><p>Multi-sample Aligned reads Package for manipulation of NGS alignments, which includes a computation of genotype likelihoods (samtools) and SNP and genotype calling (bcftools)</p><p>GATK http://www.broadinstitute.org/gsa/wiki/index.php/The_Genome_Analysis_Toolkit Multi-sample Aligned reads Package for aligned NGS data analysis, which includes a SNP and genotype caller (Unifed Genotyper), SNP filtering (Variant Filtration) and SNP quality recalibration (Variant Recalibrator)</p><p>Beagle http://faculty.washington.edu/browning/beagle/beagle.html</p><p>Multi-sample LD Candidate SNPs, genotype likelihoods Software for imputation, phasing and association that includes a mode for genotype calling</p><p>IMPUTE2 http://mathgen.stats.ox.ac.uk/impute/impute_v2.html</p><p>Multi-sample LD Candidate SNPs, genotype likelihoods Software for imputation and phasing, including a mode for genotype calling. Requires fine-scale linkage map</p><p>QCall ftp://ftp.sanger.ac.uk/pub/rd/QCALL</p><p>Multi-sample LD &lsquo;Feasible&rsquo; genealogies at a dense set of loci, genotype likelihoods Software for SNP and genotype calling, including a method for generating candidate SNPs without LD information (NLDA) and a method for incorporating LD information (LDA). The &lsquo;feasible&rsquo; genealogies can be generated using Margarita (http://www.sanger.ac.uk/resources/software/margarita)</p><p>MaCH http://genome.sph.umich.edu/wiki/Thunder</p><p>Multi-sample LD Genotype likelihoods Software for SNP and genotype calling, including a method (GPT_Freq) for generating candidate SNPs without LD information and a method (thunder_glf_freq) for incorporating LD information</p>]]></description>
	<dc:creator>Jit</dc:creator>
</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/38445/orthoani-an-improved-algorithm-and-software-for-calculating-average-nucleotide-identity</guid>
	<pubDate>Wed, 12 Dec 2018 08:36:08 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38445/orthoani-an-improved-algorithm-and-software-for-calculating-average-nucleotide-identity</link>
	<title><![CDATA[OrthoANI: An improved algorithm and software for calculating average nucleotide identity]]></title>
	<description><![CDATA[<p><span>OAT uses OrthoANI to measure the overall similarity between two genome sequences. ANI and OrthoANI are comparable algorithms: they share the same species demarcation cut-off at 95~96% and large comparison studies have demonstrated both algorithms to produce near identical reciprocal similarities. Details of the OrthoANI algorithm is given in (Lee et al. 2015). OAT employs an easy-to-follow Graphical User Interface that allow researchers to calculate OrthoANI values between genomes of interest without unfamiliar Command Line Environments. Moreover, the OAT_cmd command-line software can be integrated into preexisting bioinformatics pipelines.&nbsp;</span></p><p>Address of the bookmark: <a href="https://www.ezbiocloud.net/tools/orthoani" rel="nofollow">https://www.ezbiocloud.net/tools/orthoani</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/11355/genomics-and-personalized-medicine-breakthroughs</guid>
	<pubDate>Sun, 01 Jun 2014 23:40:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/11355/genomics-and-personalized-medicine-breakthroughs</link>
	<title><![CDATA[Genomics and Personalized Medicine Breakthroughs]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/VAR-1vNc0TE" frameborder="0" allowfullscreen></iframe>http://bit.ly/e8QGzY Human genome mapping is now enabling a breakthrough in medical innovation -- personalized medicine. What does this mean for patients? We can now identify predispositions to disease, predict how we metabolize drugs, and figure out what kinds of treatments we may respond to, and even determine when a drug may give us an adverse reaction. All medical specialties benefit from human genome intelligence -- oncology saw the first impacts -- but advances are now being seen in cardiology, obstetrics and gynecology, pediatric diseases, gastroenterology, rheumatology, immunology and other areas. This video covers the areas that genetic medicine is impacting and where the future of genomic medicine is heading.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39019/iq-tree-efficient-software-for-phylogenomic-inference</guid>
	<pubDate>Mon, 18 Feb 2019 04:25:11 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39019/iq-tree-efficient-software-for-phylogenomic-inference</link>
	<title><![CDATA[IQ-TREE: Efficient software for phylogenomic inference]]></title>
	<description><![CDATA[<p><span>A fast and effective stochastic algorithm to infer phylogenetic trees by maximum likelihood.&nbsp;</span><em>IQ-TREE compares favorably to RAxML and PhyML</em><span>&nbsp;in terms of likelihoods with similar computing time</span></p>
<p><span><span>IQ-TREE found higher likelihoods between 62.2% and 87.1% of the studied alignments, thus efficiently exploring the tree-space. If we use the IQ-TREE stopping rule, RAxML and PhyML are faster in 75.7% and 47.1% of the DNA alignments and 42.2% and 100% of the protein alignments, respectively. However, the range of obtaining higher likelihoods with IQ-TREE improves to 73.3&ndash;97.1%. IQ-TREE is freely available at&nbsp;</span><a href="http://www.cibiv.at/software/iqtree" target="">http://www.cibiv.at/software/iqtree</a></span></p><p>Address of the bookmark: <a href="http://www.iqtree.org/" rel="nofollow">http://www.iqtree.org/</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/42359/dnasp-dna-sequence-polymorphism-is-a-software-package-for-the-analysis-of-dna-polymorphisms</guid>
	<pubDate>Wed, 25 Nov 2020 19:51:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42359/dnasp-dna-sequence-polymorphism-is-a-software-package-for-the-analysis-of-dna-polymorphisms</link>
	<title><![CDATA[DnaSP: DNA Sequence Polymorphism, is a software package for the analysis of DNA polymorphisms]]></title>
	<description><![CDATA[<p><span>DnaSP, DNA Sequence Polymorphism, is a software package for the analysis of DNA polymorphisms using data from a single locus (a multiple sequence aligned -MSA data), or from several loci (a Multiple-MSA data, such as formats generated by some assembler RAD-seq software). DnaSP can estimate several measures of DNA sequence variation within and between populations in noncoding, synonymous or nonsynonymous sites, or in various sorts of codon positions), as well as linkage disequilibrium, recombination, gene flow and gene conversion parameters.</span></p><p>Address of the bookmark: <a href="http://www.ub.edu/dnasp/" rel="nofollow">http://www.ub.edu/dnasp/</a></p>]]></description>
	<dc:creator>Neel</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>