<?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/29586?offset=880</link>
	<atom:link href="https://bioinformaticsonline.com/related/29586?offset=880" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<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/opportunity/view/6012/project-junior-research-fellow-ccmb</guid>
  <pubDate>Fri, 01 Nov 2013 10:38:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Project Junior Research Fellow @ CCMB]]></title>
  <description><![CDATA[
<p>Temporary Project positions available purely on temporary basis - Oct/2013</p>

<p>1. Project Junior Research Fellow / Project Assistant</p>

<p>Last Date: 11th Nov 2013</p>

<p>Qualification B.Tech (Comp. Sci.), B.Tech/M.Tech (Bioinformatics), MCA,  M.Sc. (Mathematics/Statistics)</p>

<p>Desirable Qualifications: Programming in FORTRAN/ C /PERL, Web application technologies</p>

<p>Upper Age limit 28</p>

<p>Rs.12000 / Rs.16000 (as sanctioned by the funding agency)</p>

<p>General terms and conditions:</p>

<p>    Positions are purely temporary and co-terminus with the project.</p>

<p>    HRDG (CSIR) prevailing guidelines are applicable these positions.</p>

<p>    All categories of applicants are required to submit online application.</p>

<p>    Enhancement of stipend to Project JRF to Project SRF will be with the due recommendation of Principal Investigator and approval of the Director on the evaluation of the 3 member Standing Committee consisting of Chairperson at the level of Chief Scientist, Coordinator of the JRFs/RAs/PDFs and the Principal Investigator of the Project.</p>

<p>    The age relaxation as per HRDG (CSIR) norms: SC/ST/OBC/Women/Physically Handicapped persons – five years.</p>

<p>    The Stipend normally be fixed at Rs.22000/- for Research Associates/Post Doc. Fellows. However, a selected RA/PDF may be placed in the higher start of stipend if there is ample justification and such recommendation is made by the Selection Committee. Based on the recommendation with justification by the PI and approval of the Director, person getting stipend at lower rate may be elevated to higher rate subject to availability of the funds in the project.</p>

<p>    Recruitment will be based on initial screening based on qualifications and experience criteria and also based on suitability of the candidates to the nature of research project. This screening will be followed by written test followed / interview. After completing this process, candidates will be shortlisted and appointed in specific project subjects as and when appropriate positions become available. The pool of selected candidates will be valid for six months.</p>

<p>    Remunerations indicate are maximum admissible and will depend upon the availability of funds and subject to conditions applicable to projects from different funding agencies at the time of recruitment.</p>

<p>Apply : http://www.ccmb.res.in/positions/projects/temp_positions.php</p>

<p>Form download : http://www.ccmb.res.in/positions/projects/oct-2013/pdf_download.php</p>
]]></description>
</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/researchlabs/view/6233/edwards-lab</guid>
  <pubDate>Sun, 10 Nov 2013 15:07:08 -0600</pubDate>
  <link></link>
  <title><![CDATA[Edwards Lab]]></title>
  <description><![CDATA[
<p>We study the evolutionary biology of birds and relatives, combining field, museum and genomics approaches to understand the basis of avian diversity, evolution and behavior. Our guiding approaches include population genetics, which provides a quantitative framework for studying speciation, geographic variation and genome evolution; systematics, which acknowledges that the focal species of any study has relatives that are behaviorally and ecologically no less interesting; and natural history, which gives meaning to the genes and genomic patterns we study.</p>

<p>Lab page: http://www.oeb.harvard.edu/faculty/edwards/index.html</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/6559/ai-cadd-project-kerela-university</guid>
  <pubDate>Tue, 19 Nov 2013 17:48:15 -0600</pubDate>
  <link></link>
  <title><![CDATA[Ai-CADD Project @ Kerela University]]></title>
  <description><![CDATA[
<p>Applications are invited for the following Positions in the AiCADD project funded by MHRD Govt of India</p>

<p>Last Date for Submitting Application: 25th November 2013</p>

<p>1. Senior Scientist: (01 position)<br />Pay Scale: Rs.40, 000/-<br />Qualifications:  PhD/ Post Doctoral with Experience in CADD</p>

<p>2. Junior Scientist (10 positions)<br />Pay Scale: Rs. 22,000/-<br />Qualifications: MPhil / Masters Degree in Bioinformatics / Computational Biology / CADD / Ayurveda</p>

<p>3. Technical Assistant (01+01 positions)<br />Pay Scale: Rs.12,000/-<br />Qualifications: 1. BSc Computer Science/ MCA<br />Qualifications: 2. MSc Biotechnology / MSc Microbiology </p>

<p>4. Programmer (01 position)<br />Pay Scale: Rs.20,000/-<br />Qualifications: MSc Computer Science/ MCA / B Tech (Experience in MATLAB, C, C++) Industrial experience is desirable</p>

<p>5. Teaching Assistant (03 positions)<br />Pay Scale: Rs.10,000/-<br />Qualifications: MSc in Bioinformatics </p>

<p>6. Administration Assistant (02 positions)<br />Pay Scale: Rs.8,000/-<br />Qualifications: Degree + PGDCA</p>

<p>The Selection process comprises of written test and interview. Positions are purely temporary (initially for the period of one year) and co-terminus with the project. For more details mail to: cbi.uok [at] gmail.com</p>

<p>More detail @ https://sites.google.com/site/centreforbioinformatics/announcements/applicationsinvitedforapplicationforai-caddproject</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36830/crossmap-a-program-for-convenient-conversion-of-genome-coordinates</guid>
	<pubDate>Thu, 31 May 2018 06:00:47 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36830/crossmap-a-program-for-convenient-conversion-of-genome-coordinates</link>
	<title><![CDATA[CrossMap: a program for convenient conversion of genome coordinates]]></title>
	<description><![CDATA[CrossMap is a program for convenient conversion of genome coordinates (or annotation files) between different assemblies (such as Human hg18 (NCBI36) &lt;&gt; hg19 (GRCh37), Mouse mm9 (MGSCv37) &lt;&gt; mm10 (GRCm38)).

It supports most commonly used file formats including SAM/BAM, Wiggle/BigWig, BED, GFF/GTF, VCF.

CrossMap is designed to liftover genome coordinates between assemblies. 

It’s not a program for aligning sequences to reference genome.

We do not recommend using CrossMap to convert genome coordinates between species.<p>Address of the bookmark: <a href="http://crossmap.sourceforge.net" rel="nofollow">http://crossmap.sourceforge.net</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/6577/scientist-b-vector-control-research-centre</guid>
  <pubDate>Tue, 19 Nov 2013 21:19:15 -0600</pubDate>
  <link></link>
  <title><![CDATA[Scientist-B @ VECTOR CONTROL RESEARCH CENTRE]]></title>
  <description><![CDATA[
<p>VECTOR CONTROL RESEARCH CENTRE<br />(Indian Council of Medical Research)<br />Indira Nagar Medical Complex<br />Puducherry-605006</p>

<p>WALK-IN-INTERVIEW</p>

<p>The following vacancies shall be filled purely on adhoc basis under Non-Institutional adhoc project “Bioinformatics in ICMR Institutes” funded by Indian Council of Medical Research at Vector Control Research Centre, Puducherry, to be renewed annually and filled through Walk-in-Interview as indicated below. Candidates who wish to appear for the Walk-in-Interview can download the application format given in the website of Vector Control Research Centre (www.vcrc.res.in). Duly filled in application along with attested copies of certificate should be submitted at time of interview.</p>

<p>Date &amp; Time : 05.12.2013 at 9.00 AM – Scientist-C (Non-Medical)</p>

<p>05.12.2013 at 1.30 PM – Scientist-B (Non-Medical)<br />06.12.2013 at 9.00 AM – Technical Assistant (Research Assistant)<br />06.12.2013 at 1.30 PM – Multi Tasking Staff (General)</p>

<p>Place : Vector Control Research Centre, Puducherry</p>

<p>Project entitled : Biomedical Informatics Centres of ICMR</p>

<p>1. Scientist - C (Non-Medical) Number of post – ONE</p>

<p>Essential qualification</p>

<p>B.E./ B. Tech. Degree in Bioinformatics/ Computational Biology from a recognized University with 6 years experience in the relevant field  OR</p>

<p>First class Master’s Degree and Ph.D. Degree in Bioinformatics/ Computational Biology from a recognized University OR</p>

<p>First class Master’s Degree in Bioinformatics/ Computational Biology from a recognized University with 4 years R &amp; D experience in the related subjects as mentioned above OR</p>

<p>Second class Master’s Degree + Ph.D. in Bioinformatics/ Computational Biology from a recognized University with 4 years research experience in bio-medical subjects</p>

<p>Age: Not exceeding 40 years Consolidated Salary – Rs.39,960/- p.m. + HRA as<br />admissible </p>

<p>Desirable qualification (i) Post-doctorate in Bioinformatics/ Computational Biology or M.E. / M. Tech. Degree in Bioinformatics/ Computational Biology from a recognized University for candidates with First Class relevant degree.</p>

<p>(ii) Additional post-doctoral research / teaching experience in Bioinformatics/Computational Biology in recognized Institute(s).</p>

<p>(iii) Knowledge of computer applications or data management</p>

<p>Job requirements i) To apply Bioinformatics / Computational Biology tools in understanding interactions between vectors and parasites/ pathogens and target based development of drug / insecticides.</p>

<p>ii) To assist the investigators to carry out genomic studies on parasites/pathogens/vectors of vector borne diseases</p>

<p>Advertisement: http://vcrc.res.in/Adv_Bio13.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</guid>
	<pubDate>Thu, 14 Jun 2018 07:31:00 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36935/assemblytics-delta-file-to-analyze-alignments-of-an-assembly-to-another-assembly-or-a-reference-genome</link>
	<title><![CDATA[assemblytics: delta file to analyze alignments of an assembly to another assembly or a reference genome]]></title>
	<description><![CDATA[Download and install MUMmer
Align your assembly to a reference genome using nucmer (from MUMmer package)
$ nucmer -maxmatch -l 100 -c 500 REFERENCE.fa ASSEMBLY.fa -prefix OUT
Consult the MUMmer manual if you encounter problems

Optional: Gzip the delta file to speed up upload (usually 2-4X faster)
$ gzip OUT.delta
Then use the OUT.delta.gz file for upload.
Upload the .delta or delta.gz file (view example) to Assemblytics
Important: Use only contigs rather than scaffolds from the assembly. This will prevent false positives when the number of Ns in the scaffolded sequence does not match perfectly to the distance in the reference.

The unique sequence length required represents an anchor for determining if a sequence is unique enough to safely call variants from, which is an alternative to the mapping quality filter for read alignment.

http://assemblytics.com/<p>Address of the bookmark: <a href="http://assemblytics.com/" rel="nofollow">http://assemblytics.com/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/6835/roslin-bioinformatics-group</guid>
  <pubDate>Mon, 25 Nov 2013 23:55:25 -0600</pubDate>
  <link></link>
  <title><![CDATA[Roslin Bioinformatics Group]]></title>
  <description><![CDATA[
<p>Roslin Bioinformatics Group</p>

<p>The Law group provides internal Institute-specific development, training and support roles for data manipulation, sequence analysis and any other aspect of the analysis of biological data using computer systems. Additionally we provide databases and applications supporting the international animal science community, particularly tools and resources for genome mapping.</p>

<p>Head: Andy Law. Members: John Bowman (animal facility database applications), Zen Lu (bioinformatics support), Trevor Paterson (software development)</p>

<p>More @ http://www.bioinformatics.ed.ac.uk/groups/roslin-bioinformatics-group</p>
]]></description>
</item>

</channel>
</rss>