<?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/29638?offset=830</link>
	<atom:link href="https://bioinformaticsonline.com/related/29638?offset=830" 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/32875/finishing</guid>
	<pubDate>Sat, 20 May 2017 15:50:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32875/finishing</link>
	<title><![CDATA[Finishing !!]]></title>
	<description><![CDATA[<p>The process of&nbsp;<em>finishing</em>&nbsp;a genome and moving it from a&nbsp;<em>draft</em>&nbsp;stage (the result of sequencing and initial assembly) to a complete genome is typically a time and resource intensive task. The advent of new sequencing technologies has come with its own set of opportunities and pitfalls in the finishing process. While genomes can now be sequenced to high redundancy in a cost-effective manner, the process of assembling the genomes is more challenging and often draft genomes are fragmented into hundreds of contigs. Correspondingly, the task of producing the complete genome can involve months of lab work and thousands of finishing experiments and is usually done in large genome centers.</p>
<p>The work in our lab has focussed on computational approaches to speed-up the finishing process. Specifically, we have explored the use of optical mapping and mate-pair data to augment assemblies and direct finishing experiments. The tools developed in our lab have been used in several finishing projects, producing complete genomes (and near-complete ones) with surprisingly little computational and experimental effort (Nagarajan et al., in submission). The executables (as well as source code) for these tools are freely available here:</p>
<ul>
<li><strong>Scaffolding using Optical Restriction Mapping</strong><br>Optical Maps are global, ordered maps of restriction site locations in a genome. This information can be quite useful in scaffolding contigs from a shotgun assembly to guide the finishing process. A set of programs to exploit optical maps for assembly can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/soma-v2.tar.gz">SOMA v2.0 (63 MB tar.gz file)</a>. This version of SOMA contains several improvements to programs in v1.0 as well as new scripts for working with multiple maps, contig graphs and scaffolds.&nbsp;<br><br></li>
<li><strong>Augmenting assemblies with mate-pair data</strong><br>Mate-pair information can be valuable in augmenting short-read assemblies and reconstructing the genome as larger scaffolds. AMOS-Hybrid is a pipeline written in the AMOS framework (open-source assembly tools) to merge arbitrary mated reads into an existing assembly and merge contigs and create scaffolds where possible. Source code and executables for AMOS-Hybrid are available here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/AMOS-Hybrid-v1.tar.gz">AMOS-Hybrid v1.0 (142 MB tar.gz file)</a>.&nbsp;<br><br></li>
<li><strong>Assembly and sequence-composition guided finishing</strong><br>Contigs from a shotgun assembly are typically linked together in a graph structure that can serve to guide finishing and in some case close gaps&nbsp;<em>in-silico</em>. Also, in many cases, sequence composition of contigs can provide clues to fill gaps in scaffolds. A set of scripts to automate some of these tasks can be found here:&nbsp;<a href="http://www.cbcb.umd.edu/finishing/finishing-v1.tar.gz">Finishing Scripts v1.0 (63 MB tar.gz file)</a>.&nbsp;</li>
</ul>
<p>http://www.cbcb.umd.edu/finishing/</p><p>Address of the bookmark: <a href="http://www.cbcb.umd.edu/finishing/" rel="nofollow">http://www.cbcb.umd.edu/finishing/</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/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</guid>
	<pubDate>Fri, 01 Dec 2017 04:10:54 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/34493/plast-a-fast-accurate-and-ngs-scalable-bank-to-bank-sequence-similarity-search-tool</link>
	<title><![CDATA[PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool]]></title>
	<description><![CDATA[<p><strong>PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.</strong></p>
<p><strong>Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.</strong></p>
<p>PLAST stands for&nbsp;<em>Parallel Local Sequence Alignment Search Tool&nbsp;</em>and is was&nbsp;<a href="http://www.biomedcentral.com/1471-2105/10/329" target="_blank">published in BMC Bioinformatics.</a></p>
<p>PLAST is a general purpose sequence comparison tool providing the following benefits:</p>
<ul>
<li>PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),</li>
<li>Reduces the processing time of sequences comparisons while providing highest quality results,</li>
<li>Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),</li>
<li>Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,</li>
<li>Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.</li>
</ul>
<p>https://plast.inria.fr/</p><p>Address of the bookmark: <a href="https://plast.inria.fr/" rel="nofollow">https://plast.inria.fr/</a></p>]]></description>
	<dc:creator>Jit</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/36518/mix-combining-multiple-assemblies-from-ngs-data</guid>
	<pubDate>Tue, 08 May 2018 04:58:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36518/mix-combining-multiple-assemblies-from-ngs-data</link>
	<title><![CDATA[MIX: Combining multiple assemblies from NGS data]]></title>
	<description><![CDATA[<p>Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices represent extremities of contigs and edges represent existing alignments between these extremities. These alignment edges are used for contig extension. The resulting output assembly corresponds to a path in the extension graph that maximizes the cumulative contig length.</p>
<p>The Mix algorithm, approach and results were published in BMC bioinformatics :&nbsp;<a href="http://www.biomedcentral.com/1471-2105/14/S15/S16">http://www.biomedcentral.com/1471-2105/14/S15/S16</a>.</p><p>Address of the bookmark: <a href="https://github.com/cbib/MIX" rel="nofollow">https://github.com/cbib/MIX</a></p>]]></description>
	<dc:creator>Rahul Nayak</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/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/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/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</guid>
	<pubDate>Mon, 30 Jul 2018 12:01:52 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37457/nanofilt-filtering-and-trimming-of-long-read-sequencing-data</link>
	<title><![CDATA[nanofilt: Filtering and trimming of long read sequencing data]]></title>
	<description><![CDATA[<p>Filtering on quality and/or read length, and optional trimming after passing filters.<br>Reads from stdin, writes to stdout.</p>
<p>Intended to be used:</p>
<ul>
<li>directly after fastq extraction</li>
<li>prior to mapping</li>
<li>in a stream between extraction and mapping</li>
</ul>
<p>https://github.com/wdecoster/nanofilt</p><p>Address of the bookmark: <a href="https://github.com/wdecoster/nanofilt" rel="nofollow">https://github.com/wdecoster/nanofilt</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>