<?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/31105?offset=990</link>
	<atom:link href="https://bioinformaticsonline.com/related/31105?offset=990" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35061/proovread-large-scale-high-accuracy-pacbio-correction-through-iterative-short-read-consensus</guid>
	<pubDate>Fri, 05 Jan 2018 04:12:20 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35061/proovread-large-scale-high-accuracy-pacbio-correction-through-iterative-short-read-consensus</link>
	<title><![CDATA[proovread : large-scale high-accuracy PacBio correction through iterative short read consensus]]></title>
	<description><![CDATA[<p>proovread : large-scale high-accuracy PacBio correction through iterative short read consensus</p>
<ul>
<li>outperforms PacBioToCA/LSC in terms of accuracy and contiguity/sensitivity (<a href="http://dx.doi.org/10.1093/bioinformatics/btu392">http://dx.doi.org/10.1093/bioinformatics/btu392</a>)</li>
<li>is easy to install/run/configure</li>
<li>supports various types of dat
<ul>
<li><strong>HiSeq/MiSeq&nbsp;</strong>(100-500bp)</li>
<li><strong>Unitigs</strong></li>
<li>454, ...</li>
</ul>
</li>
</ul>
<p>proovread maps high coverage data to pacbio reads (bwa mem, blasr, daligner) in multiple iterations.</p><p>Address of the bookmark: <a href="https://github.com/BioInf-Wuerzburg/proovread" rel="nofollow">https://github.com/BioInf-Wuerzburg/proovread</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/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</guid>
	<pubDate>Fri, 08 Jun 2018 10:47:41 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36884/halc-high-throughput-algorithm-for-long-read-error-correction</link>
	<title><![CDATA[HALC: High throughput algorithm for long read error correction]]></title>
	<description><![CDATA[HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach)

HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.<p>Address of the bookmark: <a href="https://github.com/lanl001/halc" rel="nofollow">https://github.com/lanl001/halc</a></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/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/41148/pbmm2a-minimap2-frontend-for-pacbio-native-data-formats</guid>
	<pubDate>Tue, 18 Feb 2020 03:36:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41148/pbmm2a-minimap2-frontend-for-pacbio-native-data-formats</link>
	<title><![CDATA[pbmm2:A minimap2 frontend for PacBio native data formats]]></title>
	<description><![CDATA[<p><em>pbmm2</em> is a SMRT C++ wrapper for <a href="https://github.com/lh3/minimap2">minimap2</a>'s C API. Its purpose is to support native PacBio in- and output, provide sets of recommended parameters, generate sorted output on-the-fly, and postprocess alignments. Sorted output can be used directly for polishing using GenomicConsensus, if BAM has been used as input to <em>pbmm2</em>. Benchmarks show that <em>pbmm2</em> outperforms BLASR in sequence identity, number of mapped bases, and especially runtime. <em>pbmm2</em> is the official replacement for BLASR.</p><p>Address of the bookmark: <a href="https://github.com/PacificBiosciences/pbmm2" rel="nofollow">https://github.com/PacificBiosciences/pbmm2</a></p>]]></description>
	<dc:creator>BioStar</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/news/view/11603/ncbi-webinar</guid>
	<pubDate>Sun, 08 Jun 2014 02:47:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/11603/ncbi-webinar</link>
	<title><![CDATA[NCBI Webinar]]></title>
	<description><![CDATA[<p>In less than two weeks, NCBI will offer a webinar entitled "Introducing 3 NCBI Resources to Navigate Testing for Disease Linked Variants: MedGen, GTR and ClinVar". This webinar will delve into the lifecycle of genetic testing and teach attendees how to navigate the NIH Genetic Testing Registry, ClinVar, and MedGen resources. These resources can be used to prepare for clinical cases, access detailed information about orderable genetic tests, interpret test results, and more.</p><p>More at https://attendee.gotowebinar.com/register/8452228815737989634</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33461/graphmap-a-highly-sensitive-and-accurate-mapper-for-long-error-prone-reads</guid>
	<pubDate>Wed, 07 Jun 2017 04:18:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33461/graphmap-a-highly-sensitive-and-accurate-mapper-for-long-error-prone-reads</link>
	<title><![CDATA[GraphMap - A highly sensitive and accurate mapper for long, error-prone reads]]></title>
	<description><![CDATA[<p>GraphMap - A highly sensitive and accurate mapper for long, error-prone reads http://www.nature.com/ncomms/2016/160415/ncomms11307/full/ncomms11307.html<br><br><strong>Features</strong><br><br>&nbsp;&nbsp;&nbsp; Mapping position agnostic to alignment parameters.<br>&nbsp;&nbsp;&nbsp; Consistently very high sensitivity and precision across different error profiles, rates and sequencing technologies even with default parameters.<br>&nbsp;&nbsp;&nbsp; Circular genome handling to resolve coverage drops near ends of the genome.<br>&nbsp;&nbsp;&nbsp; E-value.<br>&nbsp;&nbsp;&nbsp; Meaningful mapping quality.<br>&nbsp;&nbsp;&nbsp; Various alignment strategies (semiglobal bit-vector and Gotoh, anchored).<br>&nbsp;&nbsp;&nbsp; Overlapping of reads for de novo assembly.<br>&nbsp;&nbsp;&nbsp; Transcriptome mapping through internal construction of a transcriptome from a given genomic reference and a GTF file.<br>&nbsp;&nbsp;&nbsp; ...and much more.<br><br>GraphMap is also used as an overlapper in a new de novo genome assembly project called Ra (https://github.com/mariokostelac/ra-integrate).<br>Ra attempts to create de novo assemblies from raw nanopore and PacBio reads without requiring error correction, for which a highly sensitive overlapper is required.<br><br>Currently, development of a new spliced-alignment mode for mapping RNA-seq reads is under way.<br>Description of the current effort as well as how to reach the experimental implementation can be found here: doc/rnaseq.md.</p><p>Address of the bookmark: <a href="https://github.com/isovic/graphmap" rel="nofollow">https://github.com/isovic/graphmap</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/12111/internship-program-with-arraygen-technolgies</guid>
  <pubDate>Sun, 22 Jun 2014 23:18:31 -0500</pubDate>
  <link></link>
  <title><![CDATA[Internship program with ArrayGen Technolgies]]></title>
  <description><![CDATA[
<p>Internship Program for Bioinformatics / Biotechnology Professionals Currently we offer positions to outstanding students interested in Next Generation Sequencing (NGS) data analysis. Applications are accepted throughout the year. Accepted students will be listed on web with their schedules. Accepted students can attend our future workshops and trainings freely at the specified venue.</p>

<p>Interested candidates may email their resume along with a cover letter to careers@arraygen.com</p>

<p>Official website: http://www.arraygen.com/</p>
]]></description>
</item>

</channel>
</rss>