<?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/31353?offset=1450</link>
	<atom:link href="https://bioinformaticsonline.com/related/31353?offset=1450" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/33486/quick-next-generation-sequencing-ngs-terms-definition</guid>
	<pubDate>Fri, 09 Jun 2017 04:52:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/33486/quick-next-generation-sequencing-ngs-terms-definition</link>
	<title><![CDATA[Quick next generation sequencing (NGS) terms definition]]></title>
	<description><![CDATA[<p><strong>fragment size:</strong><span>&nbsp;the Illumina WGS protocol generates paired-end reads from both ends of longer fragments. The lengths of these fragments are assumed to be sampled from a normal distribution. Therefore, in the absence of structural variants, mapping locations of the paired ends span within an interval [&delta;min,&delta;max]. Most (&gt;90%) of paired-end reads are sampled from no-SV regions, therefore the fragment size distribution can be learned empirically for each WGS data set separately.</span><br /><br /><strong>concordant reads:</strong><span>&nbsp;a read pair is called concordant if they can be mapped to the reference genome as &ldquo;expected&rdquo;: (a) mapped to opposing strands where the upstream read is mapped to the forward strand and the downstream read is mapped to the reverse strand2, (b) the distance between ends is between the minimum and maximum expected fragment size.</span><br /><br /><strong>discordant reads:</strong><span>&nbsp;briefly, any non-concordant read pair is considered discordant. Note that, by definition, the discordant read pairs signal potential SVs. The sequence signature produced by these type of reads is known as read-pair signature.</span><br /><br /><strong>split reads:</strong><span>&nbsp;a read that can only be mapped to the reference genome by breaking into two sub-reads is called a split-read. These types of reads also indicate a potential SV or a short insertion or deletion (indel).</span><br /><br /><strong>read depth:</strong><span>&nbsp;number of reads that map within a region of the genome. Overall genome-wide read depth is also referred to as depth of coverage. It is expected that the number of reads that &ldquo;cover&rdquo; each base-pair to follow a Poisson distribution. Therefore, if the read depth over a certain region deviates significantly from this distribution, it signals for a potential copy number variation (CNV).</span></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36518/mix-combining-multiple-assemblies-from-ngs-data</guid>
	<pubDate>Tue, 08 May 2018 04:58:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36518/mix-combining-multiple-assemblies-from-ngs-data</link>
	<title><![CDATA[MIX: Combining multiple assemblies from NGS data]]></title>
	<description><![CDATA[<p>Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices represent extremities of contigs and edges represent existing alignments between these extremities. These alignment edges are used for contig extension. The resulting output assembly corresponds to a path in the extension graph that maximizes the cumulative contig length.</p>
<p>The Mix algorithm, approach and results were published in BMC bioinformatics :&nbsp;<a href="http://www.biomedcentral.com/1471-2105/14/S15/S16">http://www.biomedcentral.com/1471-2105/14/S15/S16</a>.</p><p>Address of the bookmark: <a href="https://github.com/cbib/MIX" rel="nofollow">https://github.com/cbib/MIX</a></p>]]></description>
	<dc:creator>Rahul Nayak</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/37236/installing-salmon-for-trinity</guid>
	<pubDate>Tue, 03 Jul 2018 09:02:29 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/37236/installing-salmon-for-trinity</link>
	<title><![CDATA[Installing Salmon for Trinity !]]></title>
	<description><![CDATA[
<p>➜  trinityrnaseq-Trinity-v2.6.6 git:(master) ✗ conda install salmon<br />Solving environment: done</p>

<p>## Package Plan ##</p>

<p>  environment location: /home/urbe/anaconda3</p>

<p>  added / updated specs: <br />    - salmon</p>

<p>The following packages will be downloaded:</p>

<p>    package                    |            build<br />    ---------------------------|-----------------<br />    boost-1.64.0               |           py36_4         331 KB  conda-forge<br />    jemalloc-5.1.0             |       hfc679d8_0         8.2 MB  conda-forge<br />    boost-cpp-1.64.0           |                1        17.8 MB  conda-forge<br />    salmon-0.10.2              |                1         3.7 MB  bioconda<br />    conda-4.5.5                |           py36_0         624 KB  conda-forge<br />    tbb-2018_20171205          |                0         1.2 MB  conda-forge<br />    ------------------------------------------------------------<br />                                           Total:        31.8 MB</p>

<p>The following NEW packages will be INSTALLED:</p>

<p>    boost:     1.64.0-py36_4    conda-forge<br />    boost-cpp: 1.64.0-1         conda-forge<br />    jemalloc:  5.1.0-hfc679d8_0 conda-forge<br />    salmon:    0.10.2-1         bioconda   <br />    tbb:       2018_20171205-0  conda-forge</p>

<p>The following packages will be UPDATED:</p>

<p>    conda:     4.5.4-py36_0     conda-forge --&gt; 4.5.5-py36_0 conda-forge</p>

<p>Proceed ([y]/n)? y</p>

<p>Downloading and Extracting Packages<br />boost-1.64.0         |  331 KB | ####################################################################################################################################### | 100% <br />jemalloc-5.1.0       |  8.2 MB | ####################################################################################################################################### | 100% <br />boost-cpp-1.64.0     | 17.8 MB | ####################################################################################################################################### | 100% <br />salmon-0.10.2        |  3.7 MB | ####################################################################################################################################### | 100% <br />conda-4.5.5          |  624 KB | ####################################################################################################################################### | 100% <br />tbb-2018_20171205    |  1.2 MB | ####################################################################################################################################### | 100% <br />Preparing transaction: done<br />Verifying transaction: done<br />Executing transaction: done</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>
<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/38169/amstat-display-statistics-of-large-sequence-files-from-next-generation-sequencing-projects</guid>
	<pubDate>Fri, 09 Nov 2018 13:34:56 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38169/amstat-display-statistics-of-large-sequence-files-from-next-generation-sequencing-projects</link>
	<title><![CDATA[AMStat: display statistics of large sequence files from next generation sequencing projects]]></title>
	<description><![CDATA[<p><span>SAMStat is an efficient C program to quickly display statistics of large sequence files from next generation sequencing projects. When applied to&nbsp;</span><a href="http://samstat.sourceforge.net/#about">SAM/BAM</a><span>&nbsp;files all statistics are reported for unmapped, poorly and accurately mapped reads separately. This allows for identification of a variety of problems, such as remaining linker and adaptor sequences, causing poor mapping. Apart from this SAMStat can be used to verify individual processing steps in large analysis pipelines.</span></p><p>Address of the bookmark: <a href="http://samstat.sourceforge.net/" rel="nofollow">http://samstat.sourceforge.net/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/42418/scientist-b-bioinformatics-at-aiims-delhi</guid>
  <pubDate>Sun, 20 Dec 2020 04:34:55 -0600</pubDate>
  <link></link>
  <title><![CDATA[Scientist-B (Bioinformatics) at AIIMS, Delhi]]></title>
  <description><![CDATA[
<p>Name of the Project: “Artificial intelligence in Oncology, Harnessing big data and advanced computing to provide personalized diagnosis and treatment for Cancer patients”</p>

<p>Age Limit: 35</p>

<p>How to Apply for the AIIMS Life Science Job:</p>

<p>Interested applicants are asked to send out a detailed CV to Dr Ashok Sharma (aioncoaiims@gmail.com). Laboratory of Chromatin and also Cancer Epigenetics, Department of Biochemistry with the subject line “Application for Scientist-B position for MeitY project” latest by January 01st, 2021.<br />Complete Information of the year of passing, experience, marks, etc. ought to be mentioned in the CV Incomplete. applications will certainly be rejected Just shortlisted applicants will be called for interview. Chosen candidates will certainly be intimated by email/phone.<br />No TA/DA will certainly be paid for appearing in the interview.<br />Note, The institute reserved the right to fill up or not to fill up the post advertised.</p>

<p>Emoluments: Rs. 56,000/- plus 24 percent HRA</p>

<p>Eligibility:<br />2nd class Master’s Degree with a PhD in a pertinent subject (Bioinformatics) from.a recognized University<br />1st class Master’s degree in Life Sciences (Bioinformatics) from a recognized university OR.<br />Bachelor’s Degree in Engineering or-Technology with minimal 60% marks from a recognized University or equivalent.</p>

<p>Desirable Qualifications:<br />Experience in Bioinformatics/NGS data. Analysis/System Biology/Computer Science/ statistics with experience in Machine learning/Al project.<br />Experience of Deep learning applications in biological data ( image/text).<br />Proficient in Rf Python machine learning libraries.<br />Prior experience in the cancer-related project (ML-based) will be advantageous.<br />Experience with PyTorch/TensorFlow will certainly be very desirable.<br />Applicant should have strong scientific writing as well as. verbal abilities.<br />Papers in sci-indexed journals demonstrating ML skill sets.<br />Database handling will certainly be plus yet not required.</p>

<p>More detail at https://www.aiims.edu/images/pdf/recruitment/advertisement/biochem-16-12-20.pdf</p>
]]></description>
</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>

</channel>
</rss>