<?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/11457?offset=40</link>
	<atom:link href="https://bioinformaticsonline.com/related/11457?offset=40" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26909/sequence-assembly-with-mira-4</guid>
	<pubDate>Wed, 06 Apr 2016 08:21:22 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26909/sequence-assembly-with-mira-4</link>
	<title><![CDATA[Sequence assembly with MIRA 4]]></title>
	<description><![CDATA[<p>MIRA is a multi-pass DNA sequence data assembler/mapper for whole genome and EST/RNASeq projects. MIRA assembles/maps reads gained by</p>
<div>
<ul>
<li>
<p>electrophoresis sequencing (aka Sanger sequencing)</p>
</li>
<li>
<p>454 pyro-sequencing (GS20, FLX or Titanium)</p>
</li>
<li>
<p>Ion Torrent</p>
</li>
<li>
<p>Solexa (Illumina) sequencing</p>
</li>
<li>
<p>(in development) Pacific Biosciences sequencing</p>
</li>
</ul>
</div>
<p>into contiguous sequences (called <span><em>contigs</em></span>). One can use the sequences of different sequencing technologies either in a single assembly run (a <span><em>true hybrid assembly</em></span>) or by mapping one type of data to an assembly of other sequencing type (a <span><em>semi-hybrid assembly (or mapping)</em></span>) or by mapping a data against consensus sequences of other assemblies (a <span><em>simple mapping</em></span>).</p>
<p>The MIRA acronym stands for <span><strong>M</strong></span>imicking <span><strong>I</strong></span>ntelligent <span><strong>R</strong></span>ead <span><strong>A</strong></span>ssembly and the program pretty well does what its acronym says (well, most of the time anyway). It is the Swiss army knife of sequence assembly that I've used and developed during the past 14 years to get assembly jobs I work on done efficiently - and especially accurately. That is, without me actually putting too much manual work into it.</p>
<p>More at http://mira-assembler.sourceforge.net/docs/DefinitiveGuideToMIRA.html</p><p>Address of the bookmark: <a href="http://mira-assembler.sourceforge.net/docs/DefinitiveGuideToMIRA.html" rel="nofollow">http://mira-assembler.sourceforge.net/docs/DefinitiveGuideToMIRA.html</a></p>]]></description>
	<dc:creator>Priya Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/26972/understanding-fastqc-output</guid>
	<pubDate>Fri, 15 Apr 2016 05:47:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/26972/understanding-fastqc-output</link>
	<title><![CDATA[Understanding Fastqc Output]]></title>
	<description><![CDATA[<p>Understanding Following table and graphs</p>
<ol>
<li>Duplication level</li>
<li>kmer profile</li>
<li>per base GC content</li>
<li>per base N content</li>
<li>per base quality</li>
<li>per base sequence content</li>
<li>per sequence GC content</li>
<li>per sequence quality</li>
<li>sequence length distribution</li>
</ol>
<p>More at http://www.bioinformatics.babraham.ac.uk/projects/fastqc/Help/3%20Analysis%20Modules/</p><p>Address of the bookmark: <a href="http://www.bioinformatics.babraham.ac.uk/projects/fastqc/Help/3%20Analysis%20Modules/" rel="nofollow">http://www.bioinformatics.babraham.ac.uk/projects/fastqc/Help/3%20Analysis%20Modules/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27076/ale-a-generic-assembly-likelihood-evaluation-framework-for-assessing-the-accuracy-of-genome-and-metagenome-assemblies</guid>
	<pubDate>Tue, 26 Apr 2016 03:38:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27076/ale-a-generic-assembly-likelihood-evaluation-framework-for-assessing-the-accuracy-of-genome-and-metagenome-assemblies</link>
	<title><![CDATA[ALE: a Generic Assembly Likelihood Evaluation Framework for Assessing the Accuracy of Genome and Metagenome Assemblies]]></title>
	<description><![CDATA[<p>Assembly Likelihood Evaluation (ALE) framework that overcomes these limitations, systematically evaluating the accuracy of an assembly in a reference-independent manner using rigorous statistical methods. This framework is comprehensive, and integrates read quality, mate pair orientation and insert length (for paired-end reads), sequencing coverage, read alignment and k-mer frequency. ALE pinpoints synthetic errors in both single and metagenomic assemblies, including single-base errors, insertions/deletions, genome rearrangements and chimeric assemblies presented in metagenomes. At the genome level with real-world data, ALE identifies three large misassemblies from the Spirochaeta smaragdinae finished genome, which were all independently validated by Pacific Biosciences sequencing. At the single-base level with Illumina data, ALE recovers 215 of 222 (97%) single nucleotide variants in a training set from a GC-rich Rhodobacter sphaeroides genome. Using real Pacific Biosciences data, ALE identifies 12 of 12 synthetic errors in a Lambda Phage genome, surpassing even Pacific Biosciences' own variant caller, EviCons. In summary, the ALE framework provides a comprehensive, reference-independent and statistically rigorous measure of single genome and metagenome assembly accuracy, which can be used to identify misassemblies or to optimize the assembly process.</p>
<p>More at&nbsp;http://www.ncbi.nlm.nih.gov/pubmed/23303509</p><p>Address of the bookmark: <a href="http://sc932.github.io/ALE/about.html" rel="nofollow">http://sc932.github.io/ALE/about.html</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/29957/record</guid>
	<pubDate>Fri, 25 Nov 2016 08:23:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/29957/record</link>
	<title><![CDATA[RECORD]]></title>
	<description><![CDATA[<p>Background. Next-generation sequencing technologies are now producing multiple times the genome size in total reads from a single experiment. This is enough information to reconstruct at least some of the differences between the individual genome studied in the experiment and the reference genome of the species. However, in most typical protocols, this information is disregarded and the reference genome is used. Results. We provide a new approach that allows researchers to reconstruct genomes very closely related to the reference genome (e.g., mutants of the same species) directly from the reads used in the experiment. Our approach applies de novo assembly software to experimental reads and so-called pseudoreads and uses the resulting contigs to generate a modified reference sequence. In this way, it can very quickly, and at no additional sequencing cost, generate new, modified reference sequence that is closer to the actual sequenced genome and has a full coverage. In this paper, we describe our approach and test its implementation called RECORD. We evaluate RECORD on both simulated and real data. We made our software publicly available on sourceforge. Conclusion. Our tests show that on closely related sequences RECORD outperforms more general assisted-assembly software.</p>
<p>More at&nbsp;https://sourceforge.net/projects/record-genome-assembler/files/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pubmed/26558255" rel="nofollow">https://www.ncbi.nlm.nih.gov/pubmed/26558255</a></p>]]></description>
	<dc:creator>Bulbul</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30076/sga-string-graph-assembler</guid>
	<pubDate>Thu, 08 Dec 2016 05:08:59 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30076/sga-string-graph-assembler</link>
	<title><![CDATA[SGA: String Graph Assembler]]></title>
	<description><![CDATA[<p><span>SGA is a de novo genome assembler based on the concept of string graphs. The major goal of SGA is to be very memory efficient, which is achieved by using a compressed representation of DNA sequence reads.</span></p>
<p><span>More at</span></p>
<p><span>https://github.com/jts/sga</span></p>
<p>SGA dependencies:<br> -google sparse hash library (http://code.google.com/p/google-sparsehash/)<br> -the bamtools library (https://github.com/pezmaster31/bamtools)<br> -zlib (http://www.zlib.net/)<br> -(optional but suggested) the jemalloc memory allocator (http://www.canonware.com/jemalloc/download.html)</p><p>Address of the bookmark: <a href="https://github.com/jts/sga" rel="nofollow">https://github.com/jts/sga</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30124/understanding-greedy-algorithms</guid>
	<pubDate>Mon, 12 Dec 2016 04:37:40 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30124/understanding-greedy-algorithms</link>
	<title><![CDATA[Understanding Greedy Algorithms]]></title>
	<description><![CDATA[<p>Learning greedy algo for biologist.&nbsp;</p>
<p>https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/</p>
<p>This webpage is also useful for the same:</p>
<p>http://learninglover.com/examples.php?id=59</p>
<p>http://www.cs.rpi.edu/~magdon/ps/conference/super_biokdd.pdf</p>
<p>https://ocw.mit.edu/courses/biology/7-91j-foundations-of-computational-and-systems-biology-spring-2014/lecture-slides/MIT7_91JS14_Lecture6.pdf</p>
<p>http://schatzlab.cshl.edu/teaching/AssemblyClass/01.%20Assembly%20Intro.pdf</p>
<p>http://lsl.sinica.edu.tw/Services/Class/files/20150612449.pdf</p>
<p>http://www.cs.jhu.edu/~langmea/resources/lecture_notes/assembly_scs.pdf</p>
<p>https://www2.eecs.berkeley.edu/Pubs/TechRpts/2016/EECS-2016-43.pdf</p><p>Address of the bookmark: <a href="https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/" rel="nofollow">https://www.topcoder.com/community/data-science/data-science-tutorials/greedy-is-good/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30625/pandaseq</guid>
	<pubDate>Mon, 23 Jan 2017 04:54:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30625/pandaseq</link>
	<title><![CDATA[PANDASEQ]]></title>
	<description><![CDATA[<p>PANDASEQ assembles paired-end Illumina reads into sequences, trying to correct for errors and uncalled bases. The assembler reads two files in FASTQ format with quality information. If amplification primers were used (e.g., to isolate a variable region of the 16S gene, or the constant regions around zinc finger binding residues), they can be removed from the sequence during assembly. The final sequence will correct any uncalled bases in the overlapping region using the complementary strand. When mismatches occur in the overlapping region, the base with the better quality score is chosen.<br>The algorithm is as follows:<br><br>1.Find the positions where the forward and reverse primers match best above the threshold and discard the ends of the sequence, including the primer.<br>2.Pick and overlap to maximise the probability of the forward and reverse reads having come from a single piece of DNA.<br>3.Identify the masking of the end of the read with the quality score B or # as done by CASAVA and adjust the probabilities in this region.<br>4.Construct an assembled sequence between the primers and calculate the quality.<br>5.Check for various constraints, including quality, length, uncalled bases, and user-supplied modules.</p>
<p>http://neufeldserver.uwaterloo.ca/~apmasell/pandaseq_man1.html</p><p>Address of the bookmark: <a href="http://neufeldserver.uwaterloo.ca/~apmasell/pandaseq_man1.html" rel="nofollow">http://neufeldserver.uwaterloo.ca/~apmasell/pandaseq_man1.html</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32709/cabog-celera-assembler-with-best-overlap-graph</guid>
	<pubDate>Mon, 15 May 2017 05:04:39 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32709/cabog-celera-assembler-with-best-overlap-graph</link>
	<title><![CDATA[CABOG: Celera Assembler with Best Overlap Graph]]></title>
	<description><![CDATA[<p>CABOG (Celera Assembler with Best Overlap Graph) is scientific software for&nbsp;<a href="http://bioinformatics.oxfordjournals.org/content/24/24/2818.abstract">DNA research</a>. CABOG has been a critical component of many genome sequencing projects. CABOG operates on small genomes such as bacterial as well as large genomes such as mammalian. CABOG is an extension of the Celera Assembler software that was originally developed at&nbsp;<a href="http://www.celera.com/">Celera</a>&nbsp;for the 2001 publication of the first draft human genome sequence. The software was released to the public domain in 2004. Its open source&nbsp;<a href="http://wgs-assembler.sf.net/">repository</a>&nbsp;on Source Forge is an internet resource for scientists around the world.&nbsp;</p>
<p>CABOG is one of many software programs called genome assemblers. These programs exist to overcome the fundamental limitation of all sequencing machines, namely, that they read out very few DNA letters at a time. These programs reconstruct genomes that are billions of letters long from the hundreds of letters per read that modern sequencers provide. What these programs do is often described as a scaled up version of a family solving a jigsaw puzzle.</p>
<p>The CABOG software was the first to accomplish many scientific goals. It was the first to assemble the genome of a multicellular organism (<em>Drosophila melanogaster</em>, 2000). It was the first to assemble both parental haplotypes of one human genome (J. Craig Venter, 2007). It was the first to assemble environmental sequence from the oceans (Sargasso Sea in 2004 and Global Ocean Sampling in 2007). It was first to combine reads from first-generation Sanger sequencing machines and second-generation pyrosequencing machines (Marine microbes, 2006). Today, CABOG is one of the leading assembly programs for data sets that include paired end data from the Roche 454 line of sequencing machines.</p><p>Address of the bookmark: <a href="http://www.jcvi.org/cms/research/projects/cabog/overview/" rel="nofollow">http://www.jcvi.org/cms/research/projects/cabog/overview/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/915/researcher-in-computer-sciencebiology</guid>
  <pubDate>Mon, 15 Jul 2013 18:38:40 -0500</pubDate>
  <link></link>
  <title><![CDATA[Researcher in computer science/biology]]></title>
  <description><![CDATA[
<p>Researcher in Computer Science at the Computational Biology Unit - temporary employment</p>

<p>The Department of Informatics is a vacant position as a researcher in computer science, related to Computational Biology Unit (CBU), for 3 years.<br /> <br />The position is part of CBU Service Group and will focus on bioinformatic analysis project and especially the analysis of high-throughput data, including NGS (sequencing), and proteomics data.<br /> <br />The successful candidate will be part of the Norwegian bioinformatics platform's national helpdesk within the project ELIXIR.NO<br /> <br />Applicants must hold a PhD in a relevant subject such as computer science, mathematics, molecular biology and also possess expertise and experience in bioinformatics statistics and analysis of data from high-throughput molecular experiment.<br /> <br />Basic programming or scripting skills are required. Experience in Python, R, Perl, Linux-based operating systems and moreover knowledge of databases and web programming will be a strength for applicants.<br /> <br />We expect enthusiasm and independence and moreover the ability to work in an interdisciplinary team environment.<br /> <br />Good knowledge of English is required.<br /> <br />Salaries start at level 57 (code 1109/LR 24.1) by appointment. Further promotion occurs after<br />service seniority in the position (at grade 57-65). Of particularly highly qualified applicants may be considered a higher salary.<br /> <br />Further information about the position is available from the chair of the CBU, <br />Professor Inge Jonassen, e-mail: Inge.Jonassen @ ii.uib.no<br /> <br />The successful applicant must comply with the guidelines that apply at any given time the position.<br /> <br />State employment shall as far as possible reflect the diversity of the population. It is therefore an objective to achieve a balanced age and sex composition and the recruitment of persons with immigrant backgrounds. Persons with immigrant background are requested to apply for the position.<br /> <br />Women are particularly encouraged to apply. If the experts find that several applicants have approximately equivalent qualifications, the rules on equal in the Personnel Regulations for Academic Positions will be applied.<br /> <br />University of Bergen applies the principles of public openness when recruiting staff to scientific positions.<br /> <br />Information about the applicant may be made public even though the applicant has requested not to be named in the list of applicants. If the request does not host admitted to the result, the applicant shall be notified of this.<br /> <br />Send application, CV, certificates, diplomas, undergraduate work and a list of publications (list of publications) online by clicking on https://www.jobbnorge.no/jobbsoknet/login.aspx?returnurl=/jobbsoknet/jobapplication.aspx?jobid=95196<br /> <br />You need to upload certified translations into English or a Scandinavian language of appendices, such as diplomas and transcripts.<br /> <br />Applications sent by email to individuals at the institute will not be considered.<br /> <br />Deadline: 9 August 2013</p>
]]></description>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/6961/research-assistant-national-bureau-of-animal-genetic-resources</guid>
  <pubDate>Tue, 03 Dec 2013 06:17:34 -0600</pubDate>
  <link></link>
  <title><![CDATA[Research Assistant @ NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES]]></title>
  <description><![CDATA[
<p>NATIONAL BUREAU OF ANIMAL GENETIC RESOURCES<br />Near Basant Vihar G.T. Road Bypass<br />P.O. Box No.129, Karnal-132001 (Haryana)</p>

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

<p>A walk-in-Interview is proposed to be held at National Bureau of Animal Genetic Resources, Karnal (Haryana)-132001 at 11:30 AM on 18.12.2013 to select One RA and One SRF as per details given below:</p>

<p>1. One post of Research Associate under DBT sponsored Support under BIPP for the “SanGenix: A comprehensive Next Generation Sequence (NGS) data analysis solution” as Grants in AID. Thepost duration is Upto 31st March 2015 or earlier.</p>

<p>2. One post of Senior Research Fellow under NAIP (Component-4) Bioprospecting of genes and allele mining for abiotic stress tolerance. The post duration is Upto 31st March 2014 or earlier</p>

<p>Essential Qualifications: Ph.D. in Bioinformatics/ Computer Application or<br />First Class Masters degree in Bioinformatics/ Computer Application with two years experience as evidenced by Publications.</p>

<p>Desirable: Experience in the field of handling Next generation Sequencing Data.</p>

<p>Emolument: Rs. 22,000/- per month + HRA as per admissibility</p>

<p>Age Limit:</p>

<p>40 years for Men<br />45 years for women as on date of interview</p>

<p>Research Associate: ONE</p>

<p>Duration of engagement: Upto</p>

<p>31st March 2015 or earlier &amp; Coterminus with the project</p>

<p>Responsibilities: To help the PI for Beta testing and development of the SanGenix Tool for NGS data.</p>

<p>Essential Qualifications: First Class Masters’ degree in Bioinformatics/Biotechnology.</p>

<p>Desirable: Experience in the field of Biotechnology/ Bioinformatics</p>

<p>Emoluments:</p>

<p>Rs. 16,000/- per month + HRA as per admissibility.<br />Senior Research Fellow: ONE<br />Duration of engagement: Upto 31st March 2014 or earlier &amp; Coterminus with the project</p>

<p>Age Limit</p>

<p>35 years for men<br />40 years for women as on date of interview</p>

<p>Note: Relaxation in age will be admissible for SC/ST &amp; OBC candidates as per Govt. of India /ICAR norms</p>

<p>1. The applicants must bring with them original documents and brief of research work done during post graduation along with a set of photocopy and latest two passport size photographs.<br />2. A panel of selected candidates will also be made which may be utilized for filling of positions of shorter durations in future if demand arises.<br />3. Experience certificate in original, if any 4. The above positions are purely on temporary basis and are co-terminus with the project. No TA/DA will be paid to attend the interview.<br />5. Any other clarifications can be had on the date of interview.<br />6. The Director’s decision will be final and binding on all respects.</p>

<p>Advertisement: http://210.212.93.85/rasrfadvertise.pdf</p>
]]></description>
</item>

</channel>
</rss>