<?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=810</link>
	<atom:link href="https://bioinformaticsonline.com/related/29586?offset=810" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	
<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5422/shendure-lab</guid>
  <pubDate>Wed, 09 Oct 2013 14:21:58 -0500</pubDate>
  <link></link>
  <title><![CDATA[Shendure Lab]]></title>
  <description><![CDATA[
<p>The Shendure Lab is part of the Department of Genome Sciences at the University of Washington (Seattle, WA). The mission of the lab is to develop and apply new technologies in genomics and molecular biology. Most projects in the lab exploit new DNA sequencing technologies (Shendure et al., Nature Reviews Genetics 2004; Shendure &amp; Ji, Nature Biotechnology 2008; Shendure &amp; Lieberman Aiden, Nature Biotechnology 2012), and generally fall into one of six areas: 1) next-generation human genetics; 2) genome contiguity &amp; completeness; 3) massively parallel functional analysis; 4) molecular tagging; 5) synthetic biology; 6) translational genomics. Our interests in each of these areas are outlined briefly below, and a full list of publications is available via PubMed. http://www.ncbi.nlm.nih.gov/pubmed?cmd=search&amp;term=shendure<br />More http://krishna.gs.washington.edu/research.html</p>

<p>Lab page @ http://krishna.gs.washington.edu/index.html</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</guid>
	<pubDate>Fri, 08 Dec 2017 16:26:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34567/jobtree-based-python-wrapper-to-run-the-genome-simulation-tool-suite-evolver</link>
	<title><![CDATA[jobTree based python wrapper to run the genome simulation tool suite Evolver]]></title>
	<description><![CDATA[<p><span>evolverSimControl</span><span>&nbsp;(</span><span>eSC</span><span>) can be used to simulate multi-chromosome genome evolution on an arbitrary phylogeny (</span><a href="http://evolution.genetics.washington.edu/phylip/newicktree.html">Newick format</a><span>). In addition to simply running evolver,&nbsp;</span><span>eSC</span><span>&nbsp;also automatically creates statistical summaries of the simulation as it runs including text and image files. Also included are convenience scripts to: check on a running simulation and see detailed status and logging information; extract fasta sequence files from the leaf nodes of a completed simulation; extract pairwise multiple alignment files (</span><a href="http://genome.ucsc.edu/FAQ/FAQformat.html#format5">.maf</a><span>) from leaf and branch nodes from a completed simulation and with the help of&nbsp;</span><a href="https://github.com/dentearl/mafTools/">mafJoin</a><span>, join them together into a single maf covering the entire simulation.</span></p><p>Address of the bookmark: <a href="https://github.com/dentearl/evolverSimControl" rel="nofollow">https://github.com/dentearl/evolverSimControl</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/5661/shankar-lab</guid>
  <pubDate>Wed, 16 Oct 2013 07:02:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[Shankar Lab]]></title>
  <description><![CDATA[
<p>Research Interest:</p>

<p>(A) Regulatory System Analysis with respect to microRNAs</p>

<p>(B) Computational Epigenomics &amp; Regulomics:</p>

<p>(C) Computational issues with Next Generation Sequencing:</p>

<p>Department of Biotechnology, <br />Institute of Himalyan Bioresources Technology<br />CSIR, Palampur(Himachal Pradesh), India.<br />Email: ravishihbt.res.in; ravish9gmail.com</p>

<p>More @ http://scbb.ihbt.res.in/SCBB_dept/Lab_Member.php</p>
]]></description>
</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/researchlabs/view/5747/dbbrowser-attwood-lab</guid>
  <pubDate>Fri, 18 Oct 2013 10:48:19 -0500</pubDate>
  <link></link>
  <title><![CDATA[DbBrowser: Attwood Lab]]></title>
  <description><![CDATA[
<p>DbBrowser: Attwood Lab research concerns protein sequence analysis, primarily using the method of protein 'fingerprinting'. DbBrowser: Attwood Lab maintain a diagnostic fingerprint database (PRINTS), one of the founding partner of InterPro. We also design software to display sequence and structural data in visually-striking ways (e.g., Ambrosia, CINEMA); DbBrowser: Attwood Lab are building re-usable software components to create semantically integrated bioinformatics applications through UTOPIA, including a 'smart' PDF reader that links bioinformatics databases and tools directly with scientific articles (Utopia Documents); and have developed a number of tools for automatic annotation and text mining (e.g., MINOTAUR, PRECIS, METIS). </p>

<p>More @ http://www.bioinf.manchester.ac.uk/dbbrowser/index.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/opportunity/view/5946/bioinformatics-tata-memorial-centre-navi-mumbai</guid>
  <pubDate>Mon, 28 Oct 2013 10:40:25 -0500</pubDate>
  <link></link>
  <title><![CDATA[Bioinformatics @ TATA MEMORIAL CENTRE, NAVI MUMBAI]]></title>
  <description><![CDATA[
<p>TATA MEMORIAL CENTRE<br />ADVANCED CENTRE FOR TREATMENT, RESEARCH AND EDUCATION IN CANCER<br />KHARGHAR, NAVI MUMBAI – 410210</p>

<p>No. ACTREC/Advt./ 72 /2013</p>

<p>WALK IN INTERVIEW</p>

<p>1. JRF*<br />Genome-wide RNAi screen with human pooled tyrosine kinase shRNA libraries in head and neck squamous call carcinoma (HNSCC) cell lines<br />DBT A/C No. 3071, Dr. Amit Dutt</p>

<p>2. JRF<br />IRB Project ACTREC Funds<br />Dr. Amit Dutt</p>

<p>3. RA<br />Defining the cancer genome of Head and Neck Squamous Cell Carcinoma (HNSCC) with SNP arrays and next generation sequencing technology<br />A/C No. 2895, Dr. Amit Dutt</p>

<p>Duration of the Project: One year from the date of appointment, or as and when project terminates.</p>

<p>Consolidated Salary: RA : Rs. 40,000/- p.m.<br />JRF* (DBT): Rs. 20,800/- p.m.<br />JRF: Rs. 16,000/- p.m.<br />Date &amp; Time: 6th November, 2013, at 10.00 a.m.</p>

<p>Venue: Conference Room</p>

<p>Minimum Qualifications and Experience:</p>

<p>RA: The ideal applicant should have a PhD in a relevant field. He/she should have a strong computational biology background, with demonstrated experience in coding using Perl, Python, Java or C++. He/she should be familiar with working in unix enviromnent, devising computational algorithms for data analysis, statistical data analysis in R and matlab and database programming using MySQL. Hands on experience in analyzing high throughput data would be an added advantage.</p>

<p>JRF* (DBT project): M.Sc. in Life Sciences or M.Tech in Biotechnology with good academic record (Minimum of 60% aggregate). Valid UGC-CSIR/DBT/ICMR JRF qualification and laboratory experience in molecular biology. Previous experience in molecular biology and animal tissue culture with high throughput platforms and ability to work with a large team would be desirable.</p>

<p>JRF (ACTREC project): M.Sc. in Life Sciences or M.Tech in Biotechnology with good academic record (Minimum of 60% aggregate). Minimum 2 yrs experience in molecular biology and animal tissue culture with high throughput platforms and ability to work with a large team is essential.</p>

<p>*M.Sc. degree obtained after a one year course will not be considered.</p>

<p>Candidates fulfilling above requirements should send their application by e-mail to<br />‘careers.duttlab@gmail.com. in the format given below so as to reach on or before<br />4th November, 2013.</p>

<p>Advertisement:</p>

<p>http://www.actrec.gov.in/data%20files/2013/AD-RA-JR-TECHN-6-NOV.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/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/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>

</channel>
</rss>