<?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/28903?offset=1360</link>
	<atom:link href="https://bioinformaticsonline.com/related/28903?offset=1360" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/7216/free-math-books</guid>
	<pubDate>Thu, 12 Dec 2013 19:38:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/7216/free-math-books</link>
	<title><![CDATA[Free math books]]></title>
	<description><![CDATA[<p>Bioinformatics require some match skills, therefore I decided to provide this wonderful math eBooks links to the BOL community.</p>
<p>Please add ur links/bookmarks in comment section.</p><p>Address of the bookmark: <a href="http://physicsdatabase.com/free-math-books/" rel="nofollow">http://physicsdatabase.com/free-math-books/</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/34707/string-graph-based-genome-assembly-software-and-tools</guid>
	<pubDate>Tue, 19 Dec 2017 17:17:38 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/34707/string-graph-based-genome-assembly-software-and-tools</link>
	<title><![CDATA[String graph based genome assembly software and tools !]]></title>
	<description><![CDATA[<p>In&nbsp;<a href="https://en.wikipedia.org/wiki/Graph_theory" title="Graph theory">graph theory</a>, a&nbsp;<strong>string graph</strong>&nbsp;is an&nbsp;<a href="https://en.wikipedia.org/wiki/Intersection_graph" title="Intersection graph">intersection graph</a>&nbsp;of&nbsp;<a href="https://en.wikipedia.org/wiki/Curve" title="Curve">curves</a>&nbsp;in the plane; each curve is called a "string".&nbsp; String graphs were first proposed by E. W. Myers in a&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/21/suppl_2/ii79.full.pdf+html">2005 publication</a>.&nbsp;In&nbsp;recent&nbsp;<a href="http://genome.cshlp.org/content/early/2012/01/22/gr.126953.111">Genome Research paper</a>&nbsp;describing an innovative approach for assembling large genomes from NGS data caught our attention for several reasons. i) it give different "string graph" prospective of long lasting genome assembly problem ii) the&nbsp;paper is coauthored by Jared Simpson, the developer of&nbsp;<a href="http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2694472/">ABySS assembler</a>&nbsp;and Richard Durbin. iii)&nbsp;Simpson-Durbin algorithm is that it does not rely on de Bruijn graphs, and instead employs a different graph construction approach called &lsquo;string graph&rsquo;.</p><p>Following are the genome assembly tools based on string graph:</p><p>1.SGA (String Graph Assembler)&nbsp;https://github.com/jts/sga</p><p>Assembles large genomes from high coverage short read data. SGA is designed as a modular set of programs, which are used to form an assembly pipeline. SGA implements a set of assembly algorithms based on the FM-index. As the FM-index is a compressed data structure, the algorithms are very memory efficient. The SGA assembly has three distinct phases. The first phase corrects base calling errors in the reads. The second phase assembles contigs from the corrected reads. The third phase uses paired end and/or mate pair data to build scaffolds from the contigs. The output of this software is a PDF report that allows the properties of the genome and data quality to be visually explored. By providing more information to the user at the start of an assembly project, this software will help increase awareness of the factors that make a given assembly easy or difficult, assist in the selection of software and parameters and help to troubleshoot an assembly if it runs into problems.</p><p>2.&nbsp;SAGE: String-overlap Assembly of GEnomes&nbsp;https://github.com/lucian-ilie/SAGE2</p><p>SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers.</p><p>3. FSG: Fast String Graph</p><p>The new integrated assembler has been assessed on a standard benchmark, showing that fast string graph (FSG) is significantly faster than SGA while maintaining a moderate use of main memory, and showing practical advantages in running FSG on multiple threads. Moreover, we have studied the effect of coverage rates on the running times.</p><p>4.&nbsp;&nbsp;BASE&nbsp;https://github.com/dhlbh/BASE</p><p>It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.&nbsp;BASE is a practically efficient tool for constructing contig, with significant improvement in quality for long NGS reads. It is relatively easy to extend BASE to include scaffolding.</p><p>5.&nbsp;Fermi&nbsp;https://github.com/lh3/fermi/</p><p>Fermi is a de novo assembler with a particular focus on assembling Illumina&nbsp;short sequence reads from a mammal-sized genome. In addition to the role of a&nbsp;typical assembler, fermi also aims to preserve heterozygotes which are often&nbsp;collapsed by other assemblers. Its ultimate goal is to find a minimal set of&nbsp;unitigs to represent all the information in raw reads.</p><p>If you want to learn about String Graph assembler, please read the following papers -</p><p>i)&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/21/suppl_2/ii79.full.pdf+html">The Fragment Assembly String Graph - E. W. Myers</a></p><p>This paper describes the String Graph concept.</p><p>ii)&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/26/12/i367.full#ref-20">Efficient construction of an assembly string graph using the FM-index - Jared T. Simpson and Richard Durbin</a></p><p>This earlier paper from Simpson and Durbin</p><p>iii)&nbsp;<a href="http://genome.cshlp.org/content/early/2012/01/22/gr.126953.111">Efficient de novo assembly of large genomes using compressed data structures - Jared T. Simpson and Richard Durbin</a></p><p>&nbsp;</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/7387/bioinformatics-software-for-biologists-in-the-genomics-era</guid>
	<pubDate>Sun, 22 Dec 2013 17:31:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/7387/bioinformatics-software-for-biologists-in-the-genomics-era</link>
	<title><![CDATA[Bioinformatics software for biologists in the genomics era]]></title>
	<description><![CDATA[<p>The genome sequencing revolution is approaching a landmark figure of 1000 completely sequenced genomes. Coupled with fast-declining, per-base sequencing costs, this influx of DNA sequence data has encouraged laboratory scientists to engage large datasets in comparative sequence analyses for making evolutionary, functional and translational inferences. However, the majority of the scientists at the forefront of experimental research are not bioinformaticians, so a gap exists between the user-friendly software needed and the scripting/programming infrastructure often employed for the analysis of large numbers of genes, long genomic segments and groups of sequences. We see an urgent need for the expansion of the fundamental paradigms under which biologist-friendly software tools are designed and developed to fulfill the needs of biologists to analyze large datasets by using sophisticated computational methods. We argue that the design principles need to be sensitive to the reality that comparatively small teams of biologists have historically developed some of the most popular biological software packages in molecular evolutionary analysis. Furthermore, biological intuitiveness and investigator empowerment need to take precedence over the current supposition that biologists should re-tool and become programmers when analyzing genome scale datasets.</p><p>Address of the bookmark: <a href="http://bioinformatics.oxfordjournals.org/content/23/14/1713.full" rel="nofollow">http://bioinformatics.oxfordjournals.org/content/23/14/1713.full</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/35432/mummer4-a-fast-and-versatile-genome-alignment-system</guid>
	<pubDate>Sat, 03 Feb 2018 04:59:17 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/35432/mummer4-a-fast-and-versatile-genome-alignment-system</link>
	<title><![CDATA[MUMmer4: A fast and versatile genome alignment system]]></title>
	<description><![CDATA[<p><span>MUMmer4, a substantially improved version of MUMmer that addresses genome size constraints by changing the 32-bit suffix tree data structure at the core of MUMmer to a 48-bit suffix array, and that offers improved speed through parallel processing of input query sequences. With a theoretical limit on the input size of 141Tbp, MUMmer4 can now work with input sequences of any biologically realistic length. We show that as a result of these enhancements, the&nbsp;</span><span>nucmer</span><span>&nbsp;program in MUMmer4 is easily able to handle alignments of large genomes;&nbsp;</span></p><p>Address of the bookmark: <a href="https://mummer4.github.io/" rel="nofollow">https://mummer4.github.io/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7753/jrf-pondicherry-university</guid>
  <pubDate>Fri, 03 Jan 2014 16:48:56 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF @ PONDICHERRY UNIVERSITY]]></title>
  <description><![CDATA[
<p>PONDICHERRY UNIVERSITY</p>

<p>CENTRE FOR BIOINFORMATICS</p>

<p>PUDUCHERRY</p>

<p>Applications are invited for one Project Assistant to work in the UGC sponsored Research Award "Molecular Docking and Dynamics studies to understand the interacting mechanism of oncogenic 101 protein with its cellular proteins".</p>

<p>The duration for the fellowship is 12months only with consolidated pay ofRs. 5,000 per month.</p>

<p>Application on plain paper with following details: Name, Address, Data of Birth, Father's Name, Nationality, Educational Qualification (SSLC onwards-enclose attested copies of certificate) and Researcb Experience may be addressed to Dr. R. Krishna, Principle Investigator (PI), UGC Research Award, Centre for Bioinformatics, Pondicherry University, Pondicherry - 605 014.</p>

<p>Application should reach in January 261h , 2013.</p>

<p>Essential Qualification: M.Sc. in Bioinformatics/Biophysics with good academic record.</p>

<p>Qualification for Project Fellow:</p>

<p>M.Sc in Bioinformatics/Biophysics.</p>

<p>The person to be considered for appointment as Project Fellow must have second class master degree with a minimum of 55% marks in the subject concerned or a related subject.</p>

<p>The candidate to be appointed as Project Fellows should be below thc age of40 years at the time of appointment.</p>

<p>Desirable Qualification for this Project: Research Experience in Small/Macromolecule Crystallography and Structural Bioinformatics.</p>

<p>For more details, refer the web site: www.pondiuni.edu.in/sites/default/files/BIC-311213.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</guid>
	<pubDate>Tue, 17 Apr 2018 16:21:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36257/aligngraph-algorithm-for-secondary-de-novo-genome-assembly-guided-by-closely-related-references</link>
	<title><![CDATA[AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references]]></title>
	<description><![CDATA[<p>AlignGraph is a software that extends and joins contigs or scaffolds by reassembling them with help provided by a reference genome of a closely related organism.</p>
<p>Using AlignGraph</p>
<pre><code>AlignGraph --read1 reads_1.fa --read2 reads_2.fa --contig contigs.fa --genome genome.fa --distanceLow distanceLow --distanceHigh distancehigh --extendedContig extendedContigs.fa --remainingContig remainingContigs.fa [--kMer k --insertVariation insertVariation --coverage coverage --part p --fastMap --ratioCheck --iterativeMap --misassemblyRemoval --resume]</code></pre>
<h3>&nbsp;</h3><p>Address of the bookmark: <a href="https://github.com/baoe/AlignGraph" rel="nofollow">https://github.com/baoe/AlignGraph</a></p>]]></description>
	<dc:creator>Manisha Mishra</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/7999/senior-research-fellow-indian-agricultural-statistics-research-institute</guid>
  <pubDate>Thu, 23 Jan 2014 06:22:15 -0600</pubDate>
  <link></link>
  <title><![CDATA[Senior Research Fellow @ Indian Agricultural Statistics Research Institute]]></title>
  <description><![CDATA[
<p>Indian Agricultural Statistics Research Institute<br />Library Avenue, Pusa, New Delhi – 110012</p>

<p>Walk-in-Interview</p>

<p>Walk-in-interview will be held on February 11, 2014 at 10:00 A.M. at IASRI, New Delhi for a project “Whole Genome Sequencing and Development of Allied Genomics Resources in Two Commercially Important Fish-Labeo rohita and Clarias batrachus” funded by Department of Biotechnology, Ministry of Science and Technology, Government of India, New Delhi for the following posts. The appointment will be on contractual basis upto September, 2016 or till the termination of the project whichever is earlier and the incumbent shall not have any claim for regular appointment under ICAR.</p>

<p>Senior Research Fellow Two</p>

<p>Post-Graduation in Bioinformatics/ Agricultural Statistics/ Statistics/ Computer Science/ Computer Application/ Biotechnology or equivalent with 1st Division</p>

<p> Knowledge of Statistical Analysis /Bioinformatics tools/computer programming for computational genomics.</p>

<p>Emoluments for Research Associate: Consolidated Rs: 16000/- per month + 30% HRA (1st Two years) and Rs: 18000/- per month + 30% HRA (3rd Year)</p>

<p>Age Limit: Age should be not more than 35 years (5 years relaxation for SC/ST/women candidates and 3 years for OBC candidates as on date of interview).<br />Interested candidates are requested to appear for Walk-in-Interview on the date and time as specified above in Room No. 106, Training Cum Administrative Block of the Institute along with their application giving bio-data with attested copies of certificates, degrees, testimonials, etc. and one passport size photograph. Original certificates/ Degrees are needed to be produced at the time of interview. No T.A. /D.A. will be paid for appearing in the interview.</p>

<p>Advertisement: http://www.iasri.res.in/employment/2014/srf_cabin.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36861/eagler-a-scaffolding-tool-for-long-reads</guid>
	<pubDate>Mon, 04 Jun 2018 05:26:03 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36861/eagler-a-scaffolding-tool-for-long-reads</link>
	<title><![CDATA[EAGLER: a scaffolding tool for long reads.]]></title>
	<description><![CDATA[<p>EAGLER is a scaffolding tool for long reads. The scaffolder takes as input a draft genome created by any NGS assembler and a set of long reads. The long reads are used to extend the contigs present in the NGS draft and possibly join overlapping contigs. EAGLER supports both PacBio and Oxford Nanopore reads.</p>
<p>The tool should be compatible with most UNIX flavors and has been successfully tested on the following operating systems:</p>
<ul>
<li>Mac OS X 10.11.1</li>
<li>Mac OS X 10.10.3</li>
<li>Ubuntu 14.04 LTS</li>
</ul>

https://bib.irb.hr/datoteka/844447.Diplomski_2015_Luka_terbi.pdf<p>Address of the bookmark: <a href="https://github.com/mculinovic/EAGLER" rel="nofollow">https://github.com/mculinovic/EAGLER</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/8108/jrf-institute-of-cytology-preventive-oncology</guid>
  <pubDate>Sat, 01 Feb 2014 13:47:29 -0600</pubDate>
  <link></link>
  <title><![CDATA[JRF @ Institute of Cytology &amp; Preventive Oncology]]></title>
  <description><![CDATA[
<p>Institute of Cytology &amp; Preventive Oncology (ICPO) which was initially established as Cytology Research Centre ( CRC ) by the Indian Council of Medical Research (ICMR) in 1979, came into the existence in 1989 when CRC was elevated to the level of Institute. ICPO was instituted with the main aim of promoting research in the field of cancers that are most prevalent in India with an emphasis on their early detection and prevention.</p>

<p>Candidates having the below mentioned qualifications may appear for Walk in Interview at ICPO on 5th Feb 2014 between 10.00 AM and 12.00 PM under the NIF project entitled "Prediction of drug tragets of chemical constituents present within non-codified medicinal plants" under Dr Subhash M.Agarwal, Scientist C</p>

<p>    Position : JRF<br />    No of Post : One<br />    Pay : Rs 12000/- + 30% HRA </p>

<p>    Desired Profile : M.Sc in Bioinformatics with good academic record. Candidate with experience in database development and scripting would be preferred<br />    Age Limit : Below 28 years<br />    Period : 2 months</p>

<p>Interested candidates may send their applications with bio-data by email (smagarwal@gmail.com) or post addressed to Dr Subhash M Agarwal, Scientist C, Bioinformatics Division, Institute of Cytology and Preventive Oncology (ICPO) I-7, Sector 39, Noida-201301 so as to reach latest by 04.02.14</p>

<p>Deadline : 04.02.14</p>

<p>http://icmr.nic.in/icmrnews/icpo_jrf.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/file/view/36945/download-blasr-13-version</guid>
	<pubDate>Fri, 15 Jun 2018 03:01:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/file/view/36945/download-blasr-13-version</link>
	<title><![CDATA[Download blasr 1.3 version]]></title>
	<description><![CDATA[<p>DOWNLOAD LINK: https://github.com/BioInf-Wuerzburg/proovread/raw/master/util/blasr-1.3.1/blasr</p><p>I'm running "OPERA-LG_v2.0.5/bin/preprocess_reads.pl" and have the following error:</p><p>fail to open file './temporarySam'</p><p><br />[bwa_aln_core] write to the disk... 0.09 sec<br />[bwa_aln_core] 70778880 sequences have been processed.<br />[bwa_aln_core] calculate SA coordinate... 161.35 sec<br />[bwa_aln_core] write to the disk... 0.06 sec<br />[bwa_aln_core] 70989574 sequences have been processed.<br />[main] Version: 0.7.15-r1140<br />[main] CMD: bwa aln -t 30 all_p_ctg.fa -<br />[main] Real time: 2402.523 sec; CPU: 53429.488 sec<br />[E::hts_open_format] Failed to open file temporarySam<br />samtools sort: can't open "temporarySam": No such file or directory<br />[bwa_aln_core] convert to sequence coordinate... 1.00 sec<br />[bwa_aln_core] refine gapped alignments... 6.07 sec<br />[bwa_aln_core] print alignments... PREPROCESS:<br />Fastq format is recognized<br />[Thu Jun 14 18:16:47 2018] Building bwa index...<br />bwa index -p all_p_ctg.fa /home/urbe/Tools/OPERA-LG_v2.0.6/all_p_ctg.fa<br />[Thu Jun 14 18:18:35 2018] Finding the SA coordinates of the reads using BWA aln...<br />[Thu Jun 14 18:58:37 2018] Generate alignments of reads using bwa sampe...<br />bwa samse -n 1 all_p_ctg.fa read.sai - | grep '\(^@\|XT:A:U\)' | /usr/local/bin/samtools view -S -h -b -F 0x4 - | /usr/local/bin/samtools sort -@ 20 -no - temporarySam &gt; FALCON-Unzip-Scaff.bam<br />Mapping long-reads using blasr...<br />/home/urbe/Tools/SSpace/SSPACE-LongRead_v1-1/blasr -nproc 40 -m 1 -minMatch 5 -bestn 10 -noSplitSubreads -advanceExactMatches 1 -nCandidates 1 -maxAnchorsPerPosition 1 -sdpTupleSize 7 /media/urbe/MyDDrive/ONTdata/allONT/allONT.fasta /home/urbe/Tools/OPERA-LG_v2.0.6/all_p_ctg.fa | cut -d ' ' -f1-5,7-12 | sed 's/ /\t/g' &gt; FALCON-Unzip-Scaff.map<br />sh: 1: /home/urbe/Tools/SSpace/SSPACE-LongRead_v1-1/blasr: Permission denied<br />Sorting mapping results...<br />sort -k1,1 -k9,9g FALCON-Unzip-Scaff.map &gt; FALCON-Unzip-Scaff.map.sort<br />Analyzing sorted results...<br />Extracting linking information...<br />i3 2000 5000<br />i2 1000 2000<br />i4 5000 15000<br />i0 -200 300<br />i5 15000 40000<br />i1 300 1000<br />Repeat detection...<br />/home/urbe/Tools/OPERA-LG_v2.0.6/bin//filter_conflicting_edge.pl pairedEdges_i0 contig_length.dat 100 2<br />Illegal division by zero at /home/urbe/Tools/OPERA-LG_v2.0.6/bin//filter_conflicting_edge.pl line 93.<br />readline() on closed filehandle FILE at bin/OPERA-long-read.pl line 250.<br />rm anchor_contig_info.dat contig_length.dat filtered_edges.dat filtered_edges_cov.dat *.sai<br />rm: cannot remove 'anchor_contig_info.dat': No such file or directory<br />mv FALCON-Unzip-Scaff.bam FALCON-Unzip-Scaff-with-repeat.bam<br />/home/urbe/Tools/OPERA-LG_v2.0.6/bin//filter_repeat.pl FALCON-Unzip-Scaff-with-repeat.bam repeat.dat | /usr/local/bin/samtools view - -h -S -b &gt; FALCON-Unzip-Scaff.bam<br />rm FALCON-Unzip-Scaff-with-repeat.bam<br />/home/urbe/Tools/OPERA-LG_v2.0.6/bin/OPERA-LG config &gt; log<br />Analyzing 1 library: FALCON-Unzip-Scaff.bam<br />min library mean : 0<br />minimum contig length is 500<br />Current library: 1 out of 7<br />Analyzing file: pairedEdges_no_repeat_i0<br />Analyzing file: pairedEdges_no_repeat_i1<br />Analyzing file: pairedEdges_no_repeat_i2<br />Analyzing file: pairedEdges_no_repeat_i3<br />Analyzing file: pairedEdges_no_repeat_i4<br />Analyzing file: pairedEdges_no_repeat_i5<br />ln -s results/scaffoldSeq.fasta scaffoldSeq.fasta</p><p>To resolve this, try downloading blasr version 1.3 above and re-run :)</p>]]></description>
	<dc:creator>Jit</dc:creator>
	<enclosure url="https://bioinformaticsonline.com/file/download/36945" length="0" type="inode/x-empty" />
</item>

</channel>
</rss>