<?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/26325?offset=1110</link>
	<atom:link href="https://bioinformaticsonline.com/related/26325?offset=1110" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/28141/csbb-v10</guid>
	<pubDate>Wed, 29 Jun 2016 07:33:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/28141/csbb-v10</link>
	<title><![CDATA[CSBB-v1.0]]></title>
	<description><![CDATA[<p>CSBB is a command line based bioinformatics suite to analyze biological data acquired through varied avenues of biological experiments. CSBB is implemented in Perl, while it also leverages the use of R and python in background for specific modules. Major focus of CSBB is to allow users from biology and bioinformatics community, to get benefited by performing down-stream analysis tasks while eliminating the need to write programming code. CSBB is currently available on Linux, UNIX, MAC OS and Windows platforms.</p>
<p>Currently CSBB provides 13 modules focused on analytical tasks like performing upper-quantile normalization on expression data or convert genome wide gene expression to z-scores when comparing expression data from different platforms.</p>
<p>More at&nbsp;https://github.com/skygenomics/CSBB-v1.0</p><p>Address of the bookmark: <a href="https://github.com/skygenomics/CSBB-v1.0" rel="nofollow">https://github.com/skygenomics/CSBB-v1.0</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28286/nipgr-hires-research-associate-jrf-laboratory-assistant</guid>
  <pubDate>Mon, 04 Jul 2016 20:12:14 -0500</pubDate>
  <link></link>
  <title><![CDATA[NIPGR Hires Research Associate, JRF, Laboratory Assistant]]></title>
  <description><![CDATA[
<p>National Institute of Plant Genome Research (NIPGR), Aruna Asaf Ali Marg - Delhi, Delhi <br />₹15,000 a month<br />National Institute of Plant Genome Research (NIPGR) invites applications to recruit on vacant posts of Research Associate (RA), Junior Research Fellow (JRF) and Laboratory Assistant. Applications against these Sarkari Naukri can be submitted on or before 16 July 2016. <br />NIPGR Vacancy 2016 Details <br />1. Research Associate (RA) <br />Qualification: Ph.D. degree (awarded) in Molecular Biology/Biotechnolgy/Biochemistry/Plant Science/ Life Sciences/Bioinformatics or related field with 03 years post-doctoral research experience or 02 research papers in the journals of International repute are eligible to apply. Experience in the area of functional genomics, proteomics, metabolomics, multiomics and system biology will be preferred. <br />Age Limit: As Per Rules <br />2. Junior Research Fellow (JRF) <br />Qualification: M.Sc. degree or equivalent in Biotechnolgy/Biochemistry/Plant Science or Botany/ Life Sciences/Bioinformatics/ Molecular Biology or any other related field. Experience in advanced multiomics, big data analysis, molecular and system biology techniques will be given preference. <br />Age Limit: As Per Rules <br />3. Laboratory Assistant <br />Qualification: B.Sc. degree with 05 years working experience in government R&amp;D Laboratory assisting in the field of molecular biology and genomis. <br />Pay Scale: Rs.15000/- Per Month <br />Age Limit: As Per Rules <br />How to Apply : Duly filled-in applications in prescribed application format along with copies of required documents should be reach to: Dr. Subhra Chakraborty, Staff Scientist-VII, National Institute of Plant Genome Research (NIPGR), Aruna Asaf Ali Marg, P.O. Box NO. 10531, New Delhi – 110067 . The Last Date to submit application is 16 July 2016</p>

<p>Source: http://www.nipgr.res.in/careers/vacancies_latest.php#<br />Form at http://www.nipgr.res.in/files/careers/format_RA_JRF_LA.doc</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28546/ra-bioinformatics-at-national-bureau-of-fish-genetic-resources</guid>
  <pubDate>Mon, 25 Jul 2016 03:14:06 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at  National Bureau of Fish Genetic Resources]]></title>
  <description><![CDATA[
<p>F.No. 1(16)/2016-Admn. (DBT-BBSRC Project)<br />Research Associate /JRF Biotechnology Job vacancies in National Bureau of Fish Genetic Resources on contract basis</p>

<p>Research Associate /01 Post</p>

<p>Essential: Ph.D. in Bioinformatics or 03 years research experience after Post Graduation in Bioinformatics with at least one research paper in Science Citation Indexed (SCI) journals.</p>

<p>Desirable:  The candidate should have at least 1st Division during Graduation and Post Graduation.  Experience in assembly/ analysis/ annotation of genomic/transcriptomic data generated on next generation sequencing platforms and working knowledge on different genomic softwares.  Publications in Relevant Field.</p>

<p>Pay Scale : Rs. 36,000/- +20% HRA </p>

<p>Age: 40 years for male and 45 years for female candidates, as on the date of interview</p>

<p>Junior Research Fellow/ 01 </p>

<p>Essential: Master Degree in Biotechnology/Life Science with Specialization in Molecular Biology with NET qualification. </p>

<p>Desirable:  Research Experience in Molecular Biology. 1st Division during Graduation as well as Post Graduation. Publications in Relevant Field.</p>

<p>Pay Scale: Rs. 25,000/-+ 20% HRA for 1st and 2nd year and Rs. 28,000/-+ 20% HRA for 3rd year</p>

<p>Age: 35 years for male and 40 years for female candidates, as on the date of interview.<br />How to apply<br />A walk-in-interview will be held on 26.07.2016 at 10:00 hrs. at ICAR-National Bureau of Fish Genetic Resources, Lucknow.</p>

<p>More at http://www.nbfgr.res.in/Recruitments.aspx</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/28564/dbt-%E2%80%93-bioinformatics-industrial-training-programme-biitp-2016-%E2%80%93-17</guid>
	<pubDate>Wed, 27 Jul 2016 04:09:59 -0500</pubDate>
	<link>https://bioinformaticsonline.com/news/view/28564/dbt-%E2%80%93-bioinformatics-industrial-training-programme-biitp-2016-%E2%80%93-17</link>
	<title><![CDATA[DBT – Bioinformatics Industrial Training Programme (BIITP) 2016 – 17]]></title>
	<description><![CDATA[<p>BIITP is a programme of Department of Biotechnology (DBT), Ministry of Science and Technology, Government of India, managed by Biotech Consortium India Limited (BCIL).The objective of BIITP is to provide an opportunity to bioinformatics students to acquire practical skills and experience by working on projects alongside industry experts as well as to provide an opportunity for the industry to identify potential employees.</p><p><strong>DBT Invites online applications from the bioinformatics&nbsp;students and requisitions from biotech/bioinformatics companies.</strong></p><p><strong>Biotech Industry</strong>&nbsp;:</p><p>Biotech/Bioinformatics companies interested to provide hands on industrial training to the students of Bioinformatics under BIITP may apply online. The companies would have no obligation towards any payments to trainees. The companies would be paid bench fee to cover expenses towards training. Trainees would be provided to companies subject to availability.</p><p><strong>Attn: Bioinformatics Students</strong></p><p>Bioinformatics students interested in training in biotech / bioinformatics companies may apply online.&nbsp;<strong>Stipend of Rs. 10,000/- per month</strong>&nbsp;will be paid to candidates placed for training. The candidates will be selected for training through an interview.</p><p><strong>Eligiblity</strong>&nbsp;:</p><p>a) B.E /B.Tech./M.Sc./M.Tech./Advanced Post Graduate Diploma in Bioinformatics from an Indian recognized university with minimum 55% marks or equivalent grade at highest degree/diploma completed in the year 2015 or 2016 are only eligible to apply.</p><p>b) The Advanced Post Graduate diploma should be of at least one year duration after graduation.</p><p>c)&nbsp; Students whose result of last semester/final year is not declared can also apply mentioning their marks upto the semester/year upto which result declared. The final result with original mark sheet(s) of all the semesters/years will have to be produced at the time of interview.</p><p><strong>Application Procedure</strong>&nbsp;:</p><p>The online application form is available below :</p><p><strong><a href="https://www.biotecnika.org/2016/07/dbt-bioinformatics-industrial-training-programme-biitp-2016-17/?xurl=%3A%2F%2Fwww.bcil.nic.in%2Fbiitp2016-17%2Fregistration1.asp" target="_blank">Application Form For Students (New User)</a></strong></p><p><strong><a href="https://www.biotecnika.org/2016/07/dbt-bioinformatics-industrial-training-programme-biitp-2016-17/?xurl=%3A%2F%2Fwww.bcil.nic.in%2Fbiitp2016-17%2Fregistration.asp%3FT1%3DCompany" target="_blank">Requisition form for companies (New User)</a></strong></p><p><strong><a href="https://www.biotecnika.org/2016/07/dbt-bioinformatics-industrial-training-programme-biitp-2016-17/?xurl=%3A%2F%2Fwww.bcil.nic.in%2Fbiitp2016-17%2Findex1.asp" target="_blank">Already registered User Click Here</a></strong></p><p>The following documents are to be sent to Mr. Manoj Gupta, Manager, Biotech Consortium India Limited, 5th floor, Anuvrat Bhawan, 210, Deen Dayal UpadhyayaMarg, New Delhi-110002.</p><p>More at&nbsp;http://www.bcil.nic.in/biitp2016-17/index.asp</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28592/bioinformatics-technical-position-at-cdac-pune-india</guid>
  <pubDate>Mon, 01 Aug 2016 03:36:26 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics Technical Position at CDAC Pune - India]]></title>
  <description><![CDATA[
<p>CDAC Pune Recruitment 2016 – Apply Online for Technical Positions: Department of Information Technology under the Ministry of Communications and Information Technology, Government of India, Centre for Development of Advanced Computing (C-DAC), Pune has advertised notification for the recruitment of Technical vacancies for for PwD candidates n direct recruitment basis. Eligible candidates can apply Online from 27-07-2016 at 10.00 AM to 31-08-2016 at 18.00 PM.. Other information like age limit, educational qualification, selection process &amp; how to apply are given below… </p>

<p>CDAC Pune Vacancy Details:<br />Total No. of Posts: 23 </p>

<p>Name of the Post: Technical </p>

<p>Name of the Discipline:<br />A. Computer Science/ Information Technology and Allied disciplines. </p>

<p>B.Electronics Communications/ Electrical/ Telecommunication/Instrumentation &amp; Control/ Medical Electronics/ Power Electronics/ VLSI &amp; Embedded System and Allied disciplines. </p>

<p>C.Biotechnology/ Bioinformatics/ Health informatics/ Geoinformatics/ Meteorology/ Environmental Science/ Ocean Sciences/Oceanography/Environmental Engineering </p>

<p>1. Visually Impaired: 09 Posts </p>

<p>2. Hearing Impaired: 08 Posts </p>

<p>3. Orthopedically Impaired: 06 Posts </p>

<p>Educational Qualification : Candidates should possess Graduation in relvany discpline with relevant experience. </p>

<p>Selection Process: Candidates will be selected based on applicants performance in interview. </p>

<p>How to Apply: Eligible candidates can apply online through the website www.cdac.in from 27-07-2016 at 10.00 AM to 31-08-2016 at 18.00 PM. </p>

<p>More at http://www.cdac.in/index.aspx?id=current_jobs</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</guid>
	<pubDate>Mon, 10 Jul 2017 05:56:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/33847/omega2-metagenome-assembly-pipeline</link>
	<title><![CDATA[Omega2: metagenome assembly pipeline]]></title>
	<description><![CDATA[<p><span>Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming short branches. Unitigs were generated based on minimum cost flow analysis of the overlap graph and then merged to contigs and scaffolds using mate-pair information. In comparison with three de Bruijn graph assemblers (SOAPdenovo, IDBA-UD and MetaVelvet), Omega provided comparable overall performance on a HiSeq 100-bp dataset and superior performance on a MiSeq 300-bp dataset. In comparison with Celera on the MiSeq dataset, Omega provided more continuous assemblies overall using a fraction of the computing time of existing overlap-layout-consensus assemblers. This indicates Omega can more efficiently assemble longer Illumina reads, and at deeper coverage, for metagenomic datasets.</span></p><p>Address of the bookmark: <a href="http://omega.omicsbio.org/" rel="nofollow">http://omega.omicsbio.org/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/28819/research-project-at-iit-madras</guid>
  <pubDate>Wed, 17 Aug 2016 03:26:06 -0500</pubDate>
  <link></link>
  <title><![CDATA[Research Project at IIT, Madras]]></title>
  <description><![CDATA[
<p>Two project positions are available to work on (i) molecular modeling and molecular dynamics simulations and (ii) development of bioinformatics databases and tools at Protein Bioinformatics Lab, Department of Biotechnology, IIT Madras.</p>

<p>Duration : Initially for a period of one year. Extendable based on the performance.</p>

<p>Qualification: (i) MSc in Bioinformatics, Biotechnology, Physics, Biophysics, Biochemistry,Computer Science with NET (UGC/CSIR/GATE/BINC/INSPIRE etc) qualification. (OR) (ii) M. Tech in Bioinformatics, Biotechnology</p>

<p>Additional qualification: Programming skills</p>

<p>Candidates who fulfill the requirements of IIT have the possibility to register for PhD.</p>

<p>Fellowship: Rs.25,000 and HRA.</p>

<p>Applicants are encouraged to send the CV to the coordinator by postal mail and e-mail. The deadline to receive the applications is 31st August 2016. The project coordinator has the discretion to restrict the number of candidates to be called for interview to a reasonable limit on the basis of qualifications and experience higher than the minimum prescribed in the announcement.</p>

<p>Project Co-ordinator:</p>

<p>Dr. M. Michael Gromiha <br />Department of Biotechnology <br />Indian Institute of Technology Madras <br />Chennai 600036 <br />Email: gromiha@iitm.ac.in</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34416/miniasm-very-fast-olc-based-de-novo-assembler-for-noisy-long-reads</guid>
	<pubDate>Mon, 27 Nov 2017 07:58:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34416/miniasm-very-fast-olc-based-de-novo-assembler-for-noisy-long-reads</link>
	<title><![CDATA[miniasm: very fast OLC-based de novo assembler for noisy long reads]]></title>
	<description><![CDATA[<p>Miniasm is a very fast OLC-based&nbsp;<em>de novo</em>&nbsp;assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>) as input and outputs an assembly graph in the&nbsp;<a href="https://github.com/pmelsted/GFA-spec/blob/master/GFA-spec.md">GFA</a>&nbsp;format. Different from mainstream assemblers, miniasm does not have a consensus step. It simply concatenates pieces of read sequences to generate the final&nbsp;<a href="http://wgs-assembler.sourceforge.net/wiki/index.php/Celera_Assembler_Terminology">unitig</a>&nbsp;sequences. Thus the per-base error rate is similar to the raw input reads.</p>
<p>So far miniasm is in early development stage. It has only been tested on a dozen of PacBio and Oxford Nanopore (ONT) bacterial data sets. Including the mapping step, it takes about 3 minutes to assemble a bacterial genome. Under the default setting, miniasm assembles 9 out of 12 PacBio datasets and 3 out of 4 ONT datasets into a single contig. The 12 PacBio data sets are&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/E.-coli-Bacterial-Assembly">PacBio E. coli sample</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS473430">ERS473430</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS544009">ERS544009</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS554120">ERS554120</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS605484">ERS605484</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS617393">ERS617393</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS646601">ERS646601</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS659581">ERS659581</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS670327">ERS670327</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS685285">ERS685285</a>,&nbsp;<a href="http://www.ebi.ac.uk/ena/data/view/ERS743109">ERS743109</a>&nbsp;and a&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/E.-coli-20kb-Size-Selected-Library-with-P6-C4/ce0533c1d2a957488594f0b29da61ffa3e4627e8">deprecated PacBio E. coli data set</a>. ONT data are acquired from the&nbsp;<a href="http://lab.loman.net/2015/09/24/first-sqk-map-006-experiment/">Loman Lab</a>.</p>
<p>For a&nbsp;<em>C. elegans</em>&nbsp;<a href="https://github.com/PacificBiosciences/DevNet/wiki/C.-elegans-data-set">PacBio data set</a>&nbsp;(only 40X are used, not the whole dataset), miniasm finishes the assembly, including reads overlapping, in ~10 minutes with 16 CPUs. The total assembly size is 105Mb; the N50 is 1.94Mb. In comparison, the&nbsp;<a href="https://github.com/PacificBiosciences/Bioinformatics-Training/wiki/HGAP">HGAP3</a>produces a 104Mb assembly with N50 1.61Mb.&nbsp;<a href="http://lh3lh3.users.sourceforge.net/download/ce-miniasm.png">This dotter plot</a>&nbsp;gives a global view of the miniasm assembly (on the X axis) and the HGAP3 assembly (on Y). They are broadly comparable. Of course, the HGAP3 consensus sequences are much more accurate. In addition, on the whole data set (assembled in ~30 min), the miniasm N50 is reduced to 1.79Mb. Miniasm still needs improvements.</p>
<p>Miniasm confirms that at least for high-coverage bacterial genomes, it is possible to generate long contigs from raw PacBio or ONT reads without error correction. It also shows that&nbsp;<a href="https://github.com/lh3/minimap">minimap</a>&nbsp;can be used as a read overlapper, even though it is probably not as sensitive as the more sophisticated overlapers such as&nbsp;<a href="https://github.com/marbl/MHAP">MHAP</a>&nbsp;and&nbsp;<a href="https://github.com/thegenemyers/DALIGNER">DALIGNER</a>. Coupled with long-read error correctors and consensus tools, miniasm may also be useful to produce high-quality assemblies.</p>
<p>Minimap and miniasm are ultrafast tools for (i) mapping and (ii) assembly. Designed for long, noisy reads, they do not have a correction or consensus step, and therefore the resulting assemblies are contiguous (i.e. long) but very noisy (i.e. full of errors)</p>
<p>We start with an all against all comparison:</p>
<div>
<pre><code>minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq | gzip -1 &gt; reads.paf.gz
</code></pre>
</div>
<p>Then we can assemble</p>
<div>
<pre><code>miniasm -f reads.fq reads.paf.gz &gt; reads.gfa
</code></pre>
</div>
<p>Convert GFA to FASTA:</p>
<div>
<pre><code>awk <span>'/^S/{print "&gt;"$2"\n"$3}'</span> reads.gfa | fold &gt; reads.fa
</code></pre>
</div>
<p>And then count how many contigs:</p>
<div>
<pre><code>grep <span>"&gt;"</span> reads.fa | wc -l</code></pre>
</div>
<p>&nbsp;</p>
<pre><span><span>#</span> Download sample PacBio from the PBcR website</span>
wget -O- http://www.cbcb.umd.edu/software/PBcR/data/selfSampleData.tar.gz <span>|</span> tar zxf -
ln -s selfSampleData/pacbio_filtered.fastq reads.fq
<span><span>#</span> Install minimap and miniasm (requiring gcc and zlib)</span>
git clone https://github.com/lh3/minimap <span>&amp;&amp;</span> (cd minimap <span>&amp;&amp;</span> make)
git clone https://github.com/lh3/miniasm <span>&amp;&amp;</span> (cd miniasm <span>&amp;&amp;</span> make)
<span><span>#</span> Overlap</span>
minimap/minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq <span>|</span> gzip -1 <span>&gt;</span> reads.paf.gz
<span><span>#</span> Layout</span>
miniasm/miniasm -f reads.fq reads.paf.gz <span>&gt;</span> reads.gfa</pre><p>Address of the bookmark: <a href="https://github.com/lh3/miniasm" rel="nofollow">https://github.com/lh3/miniasm</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<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/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</guid>
	<pubDate>Thu, 25 Jan 2018 05:47:53 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35345/rgfa-powerful-and-convenient-handling-of-assembly-graphs</link>
	<title><![CDATA[RGFA: powerful and convenient handling of assembly graphs]]></title>
	<description><![CDATA[<p><span>RGFA, an implementation of the proposed GFA specification in Ruby. It allows the user to conveniently parse, edit and write GFA files. Complex operations such as the separation of the implicit instances of repeats and the merging of linear paths can be performed. A typical application of RGFA is the editing of a graph, to finish the assembly of a sequence, using information not available to the assembler. We illustrate a use case, in which the assembly of a repetitive metagenomic fosmid insert was completed using a script based on RGFA.</span></p>
<p><span>https://github.com/ggonnella/rgfa</span></p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>

</channel>
</rss>